[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 toArr-outside-gen
m ≤ n ⊦ #c mx = # a ∧ n < #r mx → toArr(mx[n, a]r, m) = toArr(mx, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
perm-updrow-ind
,
toArr-outside
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
overwrite-row
,
toArr-rec
,
toArr-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
fle-01
nat-basic
/
succ
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
refl-nat
list
/list-as-arrayinstance/
a
list
/list-as-arrayinstance/
len-06
nat
/
lels-03