[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 del
⊦ perm(x, a ' + y) ↔ a ∈ x ∧ perm(x -1l a, y)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
app-04
,
del-01
,
del-03
,
empty-01
,
perm-mklist
,
rec
,
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:
in-01
,
del1
,
msubset
,
in-05
,
subrec-01
,
subrec
,
perm
,
Used spec theorems:
Used simplifier rules:
list
/
a
nat-basic1
/
f
nat
/
pred-03
nat
/
lels-01
nat-basic1
/
one-01
nat
/
ls-03
nat
/
ls-le-simp