[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 CSEQ-sat-rely-guar
CInv(n, Act, CS), Idle(m, CS), m ≤ n ⊦ [: Act, Inp, CS, Outp | CRely(m, Act', CS', Act'', CS'') , CGuar(m, Act, CS, Act', CS') , CInv(n, Act, CS) , CSEQ(m; Act, Inp, CS, Outp) ] CInv(n, Act, CS)
Type: A user defined theorem
Validity: The proof is valid.
Features: tl,
Comment:
Used by:
CSPAWN-sat-rely-guar-ind
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 41
Proof steps: 72
Used lemmas:
CRely-refl
,
COP-sat-rely-guar
,
Used spec theorems:
RGI-Conds
/
g-refl
CSPAWN+Preds
/
CInv-def
CSPAWN+Preds
/
CGuar-def
CSPAWN+Preds
/
CRely-def
Used simplifier rules:
nat-basic2
/
succ
nat-basic2
/
s
nat-basic1
/
ref-1
RGI-Conds
/
g-refl
nat
/
fle-01
nat-basic1
/
f
nat-basic1
/
lf-02
nat-basic1
/
lf-01
nat-basic1
/
ls-02
nat
/
lels
nat
/
le-add
nat-basic2
/
l
nat-basic2
/
a
nat-basic2
/
c