[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 6 from proof rg2-not-pre2-unfair (
previous step
)
(last ⊃ Post2(pm, s, S) ∧ Post1(pm, s, S);G2(pm, S, S') ∨ G1(pm, S, S')), I(pm, s), Pre1(pm, s), RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2) ⊦ (last ⊃ Post1(pm, s, S) ∧ Post2(pm, s, S);G1(pm, S, S') ∨ G2(pm, S, S'))
User applied rule case distinction
And closed the goal!
Rule argument
pos: right 1
Additional information