[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 app
⊦ perm(x + y, x + z) ↔ perm(y, z)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
a
,
app-04
,
cons
,
papp-02
,
papp-03
,
perm-com1
,
perm-com2
,
perm-dups-02
,
perm-dups-03
,
perm-rec
,
perm-shift-in2
,
perm-shift-out2
,
shift-03
,
Used by units in proved state:
olist-sort
,
olist
,
list-perm
,
list-perm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 6
Used lemmas:
oc-zero
,
ocappend
,
msubset
,
perm-def
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
c
nat-basic2
/
a
nat
/
lep-02
list
/
a
nat-basic1
/
f
nat
/
lels-01
nat
/
le-ls-simp