[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 150 from proof spawn-sat-rg-strnger (previous step)

□ (Outf = Outf' ∧ Inpf = Inpf'), GInv(S) → GInv(S'), ∀ m. ¬ m ≤ n0 + 1 ∨ ¬ Gr(m)(S, S'), Gr(n0 + 1)(S, S') ∨ m ≤ n0 ∧ Gr(m)(S, S') ⊦ last, blocked

User applied rule case distinction

And obtained the following new goals

Proof step 151:
□ (Outf = Outf' ∧ Inpf = Inpf'), GInv(S) → GInv(S'), ∀ m. ¬ m ≤ n0 + 1 ∨ ¬ Gr(m)(S, S'), Gr(n0 + 1)(S, S') ⊦ blocked, last
Proof step 152:
□ (Outf = Outf' ∧ Inpf = Inpf'), GInv(S) → GInv(S'), ∀ m. ¬ m ≤ n0 + 1 ∨ ¬ Gr(m)(S, S'), m ≤ n0 ∧ Gr(m)(S, S') ⊦ blocked, last

Rule argument

pos: left 4

Additional information