[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 13 from proof unsub-union-01 (
previous step
)
a ∈ s2, a1 ∈ s2, ∀ a. a ∈ s1 ∨ a ∈ s2 → a ∈ s ⊦ a ∈ s1, (a ∈ s1 → a ∈ s) ∧ (a0 ∈ s2 → a0 ∈ s)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 14
:
a ∈ s2, a1 ∈ s2, a0 ∈ s2, ∀ a. a ∈ s1 ∨ a ∈ s2 → a ∈ s ⊦ a ∈ s1, a0 ∈ s
Rule argument
Additional information