[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
,
Theorem g-r
⊦ CGuar(n, act, cs, act0, cs0) ∧ m ≠ n ∧ CInv(n0, act, cs) ∧ CInv(n0, act0, cs0) → (¬ CRely(m, act, cs, act0, cs0) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
CRely-refl
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
Used spec theorems:
CSPAWN+Preds
/
CGuar-def
CSPAWN+Preds
/
CRely-def
RGI-Conds
/
g-r
CSPAWN+Preds
/
CInv-def
Used simplifier rules: