[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 11 from proof ocs-dups-ex (
previous step
)
a = a0 ∨ a ∈ x0, ∀ a1. a1 ∈ x0 → #oc(a1, x0) = 1 ⊦ a = a0, a0 ∈ x0, dups(x0), a ≠ a0 ∧ #oc(a, x0) = 1, ¬ a ∈ x0 ∧ #oc(a, a0 ') = 1
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 12
:
a ∈ x0, ∀ a1. a1 ∈ x0 → #oc(a1, x0) = 1 ⊦ #oc(a, x0) = 1, a0 ∈ x0, dups(x0)
Rule argument
Additional information