[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 allperm-permtoArr-ind
#r mx = #r mx0, #c mx = #c mx0, r ≤ #r mx0, ∀ r0. r0 < r → perm(mx0[r0]r, mx[r0]r) ⊦ perm(toArr(mx0, r), toArr(mx, r))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
allperm-permtoArr
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
Used spec theorems:
list-perm
/list-as-arrayinstance/
papp
Used simplifier rules:
nat
/
lez
rowcol-upd
/
toArr-base
list-perm
/list-as-arrayinstance/
perm-e
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
rowcol-upd
/
toArr-rec
nat
/
succ-01
nat
/
lels-03
nat-basic
/
refl-nat
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
ls-02