[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 uni-ass (
previous step
)
H0 ⊥ H1, H1 ⊥ H, H ⊥ H0 ⊦ (H0 ∪ H1) ∪ H = H0 ∪ H1 ∪ H
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
H ⊥ H0, H1 ⊥ H, H0 ⊥ H1 ⊦ (H0 ∪ H1) ∪ H = H0 ∪ H1 ∪ H
Rule argument
Additional information