[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,

Proof step 16 from proof CSPAWN-sat-rely-guar-ind (previous step)

\A ∀ Act, CS, n, Inp, Outp. CInitto(m0, Act, CS) ∧ CInv(n, Act, CS) ∧ m0 ≤ n → [: Act, Inp, CS, Outp | CRelyto(m0, Act', CS', Act'', CS'') , CGuarto(m0, Act, CS, Act', CS') , CInv(n, Act, CS) , CSPAWN(m0; Act, Inp, CS, Outp) ] CInv(n, Act, CS), n ≠ 0, CInitto(m0 + 1, Act, CS), CInv(n, Act, CS), m0 < n ⊦ [: Act, Inp, CS, Outp | CRelyto(m0 + 1, Act', CS', Act'', CS'') , CGuarto(m0 + 1, Act, CS, Act', CS') , CInv(n, Act, CS) , CSPAWN(m0 + 1; Act, Inp, CS, Outp) ] CInv(n, Act, CS)

User applied rule tl call right

And obtained the following new goals

Proof step 17:
\A ∀ Act, CS, n, Inp, Outp. CInitto(m0, Act, CS) ∧ CInv(n, Act, CS) ∧ m0 ≤ n → [: Act, Inp, CS, Outp | CRelyto(m0, Act', CS', Act'', CS'') , CGuarto(m0, Act, CS, Act', CS') , CInv(n, Act, CS) , CSPAWN(m0; Act, Inp, CS, Outp) ] CInv(n, Act, CS), n ≠ 0, CInitto(m0 + 1, Act, CS), CInv(n, Act, CS), m0 < n, n0 = m0 + 1 ⊦ [: Act, Inp, CS, Outp | CRelyto(m0 + 1, Act', CS', Act'', CS'') , CGuarto(m0 + 1, Act, CS, Act', CS') , CInv(n, Act, CS) , if* n0 = 0 then CSEQ(n0; Act, Inp, CS, Outp) else CSEQ(n0; Act, Inp, CS, Outp) ∥ CSPAWN(n0 - 1; Act, Inp, CS, Outp) ] CInv(n, Act, CS)

Rule argument

pos: right 1

Additional information

Used simplifier rules: CSPAWN(n; Act, Inp, CS, Outp) {if* n = 0 then CSEQ(n; Act, Inp, CS, Outp) else CSEQ(n; Act, Inp, CS, Outp) ∥ CSPAWN(n - 1; Act, Inp, CS, Outp) };