[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 1 from proof uni-ass (conclusion)
⊦ H0 ⊥ H1 ∧ H1 ⊥ H ∧ H ⊥ H0 → (H0 ∪ H1) ∪ H = H0 ∪ H1 ∪ H
System applied rule normalize
And obtained the following new goals
Proof step 2
:
H0 ⊥ H1, H1 ⊥ H, H ⊥ H0 ⊦ (H0 ∪ H1) ∪ H = H0 ∪ H1 ∪ H
Rule argument
Additional information