[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 2 from proof union-eq-empty (
previous step
)
zh0 ⊥ zh1 ⊦ ∅ = zh0 ∪ zh1 ↔ zh0 = ∅ ∧ zh1 = ∅
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
∅ = zh0 ∪ zh1, zh0 ⊥ zh1 ⊦ zh0 = ∅ ∧ zh1 = ∅
Rule argument
Additional information
Used simplifier rules: ⊦ ∅ ∪ zh = zh; (s)