[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 3 from proof del-e (
previous step
)
⊦ a = b, (∀ a0. a0 = b ∨ a0 ≠ a ∧ ¬ a0 ∈ s) ↔ (∀ a0. ¬ a0 ∈ s) ∧ a = b, a ∈ s
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
∀ a0. a0 = b ∨ a0 ≠ a ∧ ¬ a0 ∈ s ⊦ a = b, a ∈ s
Rule argument
Additional information