[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-mklist
⊦ perm(x, mklist(a, n)) ↔ x = mklist(a, n)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
perm-mklist-del
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
perm-l
,
del
,
trans
,
sym-01
,
ref
,
perm-e
,
empty
,
Used spec theorems:
list-last
/
mk-rec
list-del
/
del1-first
Used simplifier rules:
list-last
/
mk-zero
nat-basic2
/
succ
nat-basic2
/
z-01
nat-basic2
/
oz
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
add-base
nat
/
add-01
list
/
in-empty
list-last
/
mk-empty
list-del
/
del1-e
list
/
c
list-del
/
del1-n
list
/
a
list
/
e-01
list
/
in-01
list
/
in-14
list-last
/
mk-elem
list-data
/
elim-list-c