[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 4 from proof del-e-02 (
previous step
)
a0 ∈ s, a2 ∈ s, ∀ a0. a0 = a ∨ ¬ a0 ∈ s ⊦ a1 ∈ s ↔ a1 = a
Heuristic cut applied rule cut formula
And obtained the following new goals
Proof step 5
:
a2 ∈ s, a0 ∈ s, ∀ a0. a0 = a ∨ ¬ a0 ∈ s ⊦ a1 ∈ s ↔ a1 = a
Rule argument
fma: a0 ∈ s
Additional information
Used formulas: a0 ∈ s