[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-permtoArr
#r mx = #r mx0, #c mx = #c mx0, c ≤ #c mx0 ⊦ scolsorted(mx, c, mx0) → perm(mx0.toArr, mx.toArr)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
sortcol-correct
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 10
Used lemmas:
scolsorted-permtoArc-ind
,
Used spec theorems:
rowcol-upd
/
perm-toArr-toArc
list-perm
/oarray-sort/
sym
rowcol-upd
/
toArc-def
Used simplifier rules:
list-perm
/oarray-sort/
trans
nat
/
le-def
nat-basic
/
refl-nat