[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-rmdup-rev
⊦ perm(x, rmdup(rev(y))) ↔ perm(x, rmdup(y))
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: 5
Proof steps: 6
Used lemmas:
del-01
,
perm-e
,
empty-01
,
Used spec theorems:
list-del
/
rmdup-del1-del
list-del
/
del-rev
Used simplifier rules:
list-dup
/
rm-empty
list-last
/
rev-empty
list-dup
/
rmdup-e
list-last
/
rev-e
list
/
a
list-last
/
rev-in
list-dup
/
rm-in-02
list
/
c