[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
,
Proof step 1 from proof rm-rm (conclusion)
⊦ rmdup(rmdup(x)) = rmdup(x)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ ¬ dups(x) → rmdup(x) = x
Proof step 3
:
dups(rmdup(x)) ⊦ rmdup(rmdup(x)) = rmdup(x)
Rule argument
spec: <toplevel> name: rm-eq seq: ⊦ ¬ dups(x) → rmdup(x) = x subst: [x] → [rmdup(x)] flags: <all paths>
Additional information
Used terms: rmdup(x)