This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.
| Name: | Sequent: | Type: |
|---|---|---|
| proofobls-backwardsiminv | ⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))) | An Axiom |
| backwardsiminv-def | ⊦ ≤BI(cioaut, aioaut) ↔ (∃ t, aINV, cINV. bwsim(cioaut, aioaut, t, cINV, aINV)) | An Axiom |
| proofobls-backwardsim | ⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t) ↔ (∀ cs. ∃ as. t(cs, as)) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cstepf(cs, a, cs0) ∧ t(cs0, as0) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))) | An Axiom |
| backwardsim-def | ⊦ ≤B(cioaut, aioaut) ↔ (∃ t. bwsim(cioaut, aioaut, t)) | An Axiom |
| proofobls-weakbackwardsim | ⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as))) | An Axiom |
| weakbackwardsim-def | ⊦ ≤wB(cioaut, aioaut) ↔ (∃ t, aINV. weakbwsim(cioaut, aioaut, t, aINV)) | An Axiom |
| bwsim-bwsiminv | ≤B(cioaut, aioaut) ⊦ ≤BI(cioaut, aioaut) | A User Theorem |
| bwsim-bwsiminv-aux | ⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t) ↔ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, λ cs. true, λ as. true) | A User Theorem |
| bwsiminv-implies-weakbwsim | ≤BI(cioaut, aioaut) ⊦ ≤wB(cioaut, aioaut) | A User Theorem |
| bwsiminv-implies-weakbwsim-aux | bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) | A User Theorem |
| lemma_3-15 | bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as) | A User Theorem |
| weak-lemma_3-15 | weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), cexec(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), csl0.last = cs, cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as) ∧ aINV(as) | A User Theorem |
| weakbwsim-implies-bwsiminv | ≤wB(cioaut, aioaut) ⊦ ≤BI(cioaut, aioaut) | A User Theorem |
| weakbwsim-implies-bwsiminv-aux | weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ bwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, λ cs. ∃ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ csl.last = cs, λ as. aINV(as) ∧ (∃ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ asl.last = as)) | A User Theorem |