[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem srowsorted-def
⊦ m ≤ #r mx → ( srowsorted(mx, m, mx0) ↔ #r mx = #r mx0 ∧ #c mx = #c mx0 ∧ (∀ r. r < #r mx → (r < m ⊃ perm(mx0[r]r, mx[r]r) ∧ ordered≤((even(r) ⊃ mx[r]r;rev(mx[r]r)));mx0[r]r = mx[r]r)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
rowsorted-biggercol-oddbounded
,
rowsorted-smallercol-evnbounded
,
shearsort-correct
,
sortrowsnake-correct
,
sortrowssnake-correct
,
srowsorted-evenrowordered
,
srowsorted-oddrowordered
,
srowsorted-permrow
,
srowsorted-permtoArr-ind
,
Used by units in proved state:
Proof exists?: No