[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 ocs-mklist
⊦ x = mklist(a, #oc(a, x)) ↔ x -l a = []
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: 3
Proof steps: 7
Used lemmas:
one-01
,
one
,
ocappend
,
oc-e
,
Used spec theorems:
list-last
/
mk-rec
Used simplifier rules:
list-last
/
mk-zero
list-del
/
del-e
list-del
/
del-n
list
/
e-01
list
/
in-14
list-last
/
mk-elem
list-del
/
del-y
nat-basic2
/
z-01
nat-basic2
/
oz
list
/
a
list
/
app-08
list
/
c
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
add-base
nat
/
add-01