[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 intu-empty (
previous step
)
∀ a. ¬ a ∈ s ∨ ¬ a ∈ s0 ∪ s1 ⊦ (∀ a. ¬ a ∈ s ∨ ¬ a ∈ s0) ∧ (∀ a. ¬ a ∈ s ∨ ¬ a ∈ s1)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
∀ a. ¬ a ∈ s ∨ ¬ a ∈ s0 ∪ s1 ⊦ (¬ a ∈ s ∨ ¬ a ∈ s0) ∧ (¬ a0 ∈ s ∨ ¬ a0 ∈ s1)
Rule argument
Additional information