[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 10 from proof ex3-shiftw (
previous step
)
oP(o)(H0), H0 ⊥ H, H0 ⊥ H ∧ (∃ o. oP(o)(H0)) → P(H0 ∪ H), ∀ H1. H1 ⊥ H ∧ (∃ o. oP(o)(H1)) → P(H1 ∪ H) ⊦ P(H0 ∪ H)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 11
:
oP(o)(H0), H0 ⊥ H, ∀ H1. H1 ⊥ H ∧ (∃ o. oP(o)(H1)) → P(H1 ∪ H) ⊦ P(H0 ∪ H), ∃ o. oP(o)(H0)
Rule argument
Additional information