[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 ad
⊦ a ∈ y → perm(x + (y -1l a), (x + y) -1l a)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
oc-zero
,
oc-del-01
,
del1
,
del1-01
,
ocappend
,
msubset
,
perm-def
,
Used spec theorems:
Used simplifier rules:
nat
/
ls-01
nat-basic2
/
s
list-del
/
in-01-01
nat-basic1
/
f
list-del
/
del1-in
list
/
in-append
list
/
a
nat-basic2
/
l
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
nat
/
pred-03
nat
/
lels-01
nat-basic1
/
one-01
nat-basic2
/
z-01
nat
/
ls
nat
/
sub-ls