[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 delapp
⊦ perm(x + y, y -1l a) ↔ x = [] ∧ ¬ a ∈ y
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
app-all-end
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
in-05
,
notin
,
del1-01
,
one
,
oc-zero
,
del1
,
oc-e
,
ocappend
,
msubset
,
perm
,
Used spec theorems:
Used simplifier rules:
list
/
a
nat-basic
/
c
nat-basic
/
a
nat-basic
/
z-02
list-del
/
in-02-01
nat
/
ler
nat
/
pred-03
nat
/
le-def
nat-basic
/
one-01
nat
/
ls-02
nat
/
le-add
list-data
/
elim-list-c
nat-basic
/
f
list
/
c
nat
/
succ-01
list
/
e-01
nat-basic
/
l-02
nat
/
ls
nat-basic
/
less-zero