[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 CRelytosucc-CRelyto (
previous step
)
∀ m0. m0 ≤ m + 1 → CRely(m0, act, cs, act0, cs0) ⊦ ∀ m0. m0 ≤ m → CRely(m0, act, cs, act0, cs0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
m0 ≤ m, ∀ m0. m0 ≤ m + 1 → CRely(m0, act, cs, act0, cs0) ⊦ CRely(m0, act, cs, act0, cs0)
Rule argument
Additional information