| C_≤T_A(cioaut, aioaut), adet(aioaut) ⊦ ≤F(cioaut, aioaut) |
C_≤T_A(cioaut, aioaut), adet(aioaut), ¬ ≤F(cioaut, aioaut) ⊦
| C_≤T_A(cioaut, aioaut), adet(aioaut), ¬ ≤F(cioaut, aioaut) ⊦ |
cioaut = CIOAut(cstartf0, cstepf0), C_≤T_A(cioaut, aioaut), adet(aioaut), ¬ ≤F(cioaut, aioaut) ⊦
Used simplifier rules: CIOAutomaton freely generated by CIOAut;;
| cioaut = CIOAut(cstartf0, cstepf0), C_≤T_A(cioaut, aioaut), adet(aioaut), ¬ ≤F(cioaut, aioaut) ⊦ |
C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut), adet(aioaut), ¬ ≤F(CIOAut(cstartf0, cstepf0), aioaut) ⊦
| C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut), adet(aioaut), ¬ ≤F(CIOAut(cstartf0, cstepf0), aioaut) ⊦ |
aioaut = AIOAut(astartf0, astepf0), C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut), adet(aioaut), ¬ ≤F(CIOAut(cstartf0, cstepf0), aioaut) ⊦
Used simplifier rules: AIOAutomaton freely generated by AIOAut;;
| aioaut = AIOAut(astartf0, astepf0), C_≤T_A(CIOAut(cstartf0, cstepf0), aioaut), adet(aioaut), ¬ ≤F(CIOAut(cstartf0, cstepf0), aioaut) ⊦ |
C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), adet(AIOAut(astartf0, astepf0)), ¬ ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)) ⊦
| C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), adet(AIOAut(astartf0, astepf0)), ¬ ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)) ⊦ |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), adet(AIOAut(astartf, astepf)) ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ β. cafter(CIOAut(cstartf, cstepf))(β, cs) ∧ aafter(AIOAut(astartf, astepf))(β, as))
C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), adet(AIOAut(astartf0, astepf0)), ¬ ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), fwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ as, cs. ∃ β. cafter(CIOAut(cstartf0, cstepf0))(β, cs) ∧ aafter(AIOAut(astartf0, astepf0))(β, as)) ⊦
Used terms: cstartf0, cstepf0, astartf0, astepf0
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), adet(AIOAut(astartf, astepf)) ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ β. cafter(CIOAut(cstartf, cstepf))(β, cs) ∧ aafter(AIOAut(astartf, astepf))(β, as)) |
| C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), adet(AIOAut(astartf0, astepf0)), ¬ ≤F(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), fwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ as, cs. ∃ β. cafter(CIOAut(cstartf0, cstepf0))(β, cs) ∧ aafter(AIOAut(astartf0, astepf0))(β, as)) ⊦ |
⊦ ≤F(cioaut, aioaut) ↔ (∃ r. fwsim(cioaut, aioaut, r))
C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), adet(AIOAut(astartf0, astepf0)), ∀ r. ¬ fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), fwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ as, cs. ∃ β. cafter(CIOAut(cstartf0, cstepf0))(β, cs) ∧ aafter(AIOAut(astartf0, astepf0))(β, as)) ⊦
Used terms: AIOAut(astartf0, astepf0), CIOAut(cstartf0, cstepf0)
| ⊦ ≤F(cioaut, aioaut) ↔ (∃ r. fwsim(cioaut, aioaut, r)) |
| C_≤T_A(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0)), adet(AIOAut(astartf0, astepf0)), ∀ r. ¬ fwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), r), fwsim (CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), λ as, cs. ∃ β. cafter(CIOAut(cstartf0, cstepf0))(β, cs) ∧ aafter(AIOAut(astartf0, astepf0))(β, as)) ⊦ |
Used terms: λ as, cs. ∃ β. cafter(CIOAut(cstartf0, cstepf0))(β, cs) ∧ aafter(AIOAut(astartf0, astepf0))(β, as)
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.