[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 perm-updcol-ind
⊦ #r mx = # a ∧ n ≤ #c mx ∧ c < #c mx ∧ perm(mx[c]c, a) → perm(toArc(mx, n), toArc(mx[c, a]c, n))
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
Comment:
Used by:
perm-updcol-aux
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
overwrite-col
,
toArc-rec
,
toArc-base
,
toArc-outside-gen
,
Used spec theorems:
Used simplifier rules:
nat
/
lez
list-perm
/list-as-arrayinstance/
perm-e
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
succ
nat
/
succ-01
nat
/
le-def
nat-basic
/
refl-nat
list-perm
/list-as-arrayinstance/
a
list
/list-as-arrayinstance/
a
list-perm
/list-as-arrayinstance/
app-end-end
nat
/
lels-03