[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 dups-05 (conclusion)
⊦ ¬ dups(x) → (dups(x + set2list(s)) ↔ s ∩ list2set(x) ≠ ∅)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
⊦ dups(x + set2list(s)) ↔ s ∩ list2set(x) ≠ ∅, dups(x)
Rule argument
Additional information