[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 scolsorted-def
⊦ m ≤ #c mx → ( scolsorted(mx, m, mx0) ↔ #r mx = #r mx0 ∧ #c mx = #c mx0 ∧ (∀ c. c < #c mx → (c < m ⊃ perm(mx0[c]c, mx[c]c) ∧ ordered≤(mx[c]c);mx0[c]c = mx[c]c)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
dirtyrowsone-rowsincreasing
,
max0column-clean0rowsbounded
,
scolsort-dirtyboundhalf
,
scolsorted-clean0notls
,
scolsorted-clean1notls
,
scolsorted-colordered
,
scolsorted-permcol
,
scolsorted-permtoArc-ind
,
shearsort-correct
,
sortcol-correct
,
sortcols-correct
,
Used by units in proved state:
Proof exists?: No