| ⊦ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) |
¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) ⊦
| ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) ⊦ |
⊦ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf))
imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)), ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) ⊦
Used terms:
| ⊦ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)) |
| imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)), ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) ⊦ |
≤iBI(cioaut, aioaut) ⊦ C_≤T_A(cioaut, aioaut)
imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)), ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)), ¬ ≤iBI(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) ⊦
Used terms: CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)
| ≤iBI(cioaut, aioaut) ⊦ C_≤T_A(cioaut, aioaut) |
| imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)), ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)), ¬ ≤iBI(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)) ⊦ |
⊦ ≤iBI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. imfinbwsim(cioaut, aioaut, t, cINV, aINV))
imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)), ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)), ∀ t, aINV, cINV. ¬ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), t, cINV, aINV) ⊦
Used terms: CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)
| ⊦ ≤iBI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. imfinbwsim(cioaut, aioaut, t, cINV, aINV)) |
| imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)), ¬ C_≤T_A(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep)), ∀ t, aINV, cINV. ¬ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), t, cINV, aINV) ⊦ |
Used terms: bwabs, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf), DQINV
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.