[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 5 from proof uni-inj (
previous step
)
H ∪ H0 = H ∪ H1, H ⊥ H0, H ⊥ H1 ⊦ ∀ r. (r ∈ H0 ↔ r ∈ H1) ∧ (r ∈ H0 → H0[r] = H1[r])
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
H ∪ H0 = H ∪ H1, H ⊥ H1, H ⊥ H0 ⊦ (r ∈ H0 ↔ r ∈ H1) ∧ (r ∈ H0 → H0[r] = H1[r])
Rule argument
Additional information