[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-restr2
⊦ ¬ RG-restr(GInit, GInv, Ry(n0 + 1), Gr(n0 + 1), Pr(n0 + 1), Po(n0 + 1), λ s. true, Rton(n0), Gton(n0), Prton(n0), Poton(n0), λ s. true) ↔ false
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
spawn-sat-rg-strnger
,
Used by units in proved state:
RGn-Decomp-Total
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 25
Proof steps: 57
Used lemmas:
poton-def
,
prton-def
,
gto-def
,
rton-def
,
Used spec theorems:
RG2+DF-Theory
/
RG-restr-def
RGn
/
init-ex
RGn
/
init-inv-pr
RGn
/
g-r
Used simplifier rules:
RGn
/
r-trans
nat
/
eq
RGn
/
rely-pr
RGn
/
rely-po
RGn
/
g-refl
nat-basic2
/
succ
nat-basic2
/
eq
nat-basic2
/
a
nat-basic2
/
c