[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 2 from proof ocs-dups-ex (
previous step
)
⊦ dups(x) ↔ (∃ a. a ∈ x ∧ #oc(a, x) ≠ 1)
User applied rule case distinction
And obtained the following new goals
Proof step 3
:
dups(x) ⊦ ∃ a. a ∈ x ∧ #oc(a, x) ≠ 1
Proof step 7
:
∃ a. a ∈ x ∧ #oc(a, x) ≠ 1 ⊦ dups(x)
Rule argument
pos: right 1
Additional information