[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 spawn-sat-rg-strnger
[:Inpf, S, Outf | SPAWN#(n; Inpf, S, Outf)], GInv(S), Prton(n)(S) ⊦ (Rton(n)(S', S'') ∧ (GInv(S') → GInv(S''))) -+-> (last ⊃ Poton(n)(S) ∧ GInv(S);Gton(n)(S, S') ∧ ¬ blocked ∧ (GInv(S) → GInv(S')))
Type: A user defined theorem
Validity: The proof is valid.
Features: tl,
Comment:
Used by:
spawn-partial-corr-strng
,
spawn-sat-rg
,
Used by units in proved state:
RGn-Decomp-Total
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 83
Proof steps: 169
Used lemmas:
rg-restr2
,
rg-restr1
,
gto-def
,
poton-def
,
rton-def
,
prton-def
,
seq-sat-rg
,
Used spec theorems:
RG2+DF-Theory
/
rg2-not-pre1
RG2+DF-Theory
/
rg2-not-pre2
RG2+DF-Theory
/
rg2-sound-main
Used simplifier rules:
nat
/
lez-01
nat-basic2
/
succ
nat-basic2
/
add-base
nat
/
add-01
nat-basic2
/
oz
nat
/
lep-02
nat
/
fle
nat-basic1
/
f
nat-basic2
/
l-02
nat
/
lels-01
nat
/
les
nat-basic2
/
a
nat-basic2
/
c