[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-del
⊦ ¬ a ∈ y → (perm(x, mklist(a, #oc(a, x)) + y) ↔ perm(x -l a, y))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
del1-01
,
perm-rec
,
del-03
,
empty
,
ocs-mklist
,
perm-mklist
,
Used spec theorems:
list-del
/
del1-del-switch
Used simplifier rules:
list
/
app
list-del
/
in-del-new
list
/
in-06
list
/
a
list
/
c