[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 RG-restr-sym
⊦ RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2) → (¬ RG-restr(pm, R2, G2, Pre2, Post2, I, R1, G1, Pre1, Post1) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
fair-always-right-rely
,
fair-never-violates-right-rely
,
not-pre2-term-unfair
,
rg-blocked2-not-r2-term-unfair
,
rg-blocked2-not-r2-unfair
,
rg2-not-pre2-unfair
,
Used by units in proved state:
Progress-I-2-Theory
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 6
Used lemmas:
RG-restr-def
,
Used spec theorems:
Used simplifier rules: