[Imprint][Data Privacy Statement][E-Mail]

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,

Theorem base for Specification IOrefine-def

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:
leqstar-def ⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) → atrace*(AIOAut(astartf, astepf))(α)) An Axiom
leq-def ⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α)) An Axiom
leqomega-def ⊦ C_≤ωT_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctraceω(CIOAut(cstartf, cstepf))(α) → atraceω(AIOAut(astartf, astepf))(α)) An Axiom
equivstar-def ⊦ C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace*(CIOAut(cstartf, cstepf))(α) ↔ atrace*(AIOAut(astartf, astepf))(α)) An Axiom
equiv-def ⊦ C_≡T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) ↔ atrace(AIOAut(astartf, astepf))(α)) An Axiom
equivomega-def ⊦ C_≡ωT_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctraceω(CIOAut(cstartf, cstepf))(α) ↔ atraceω(AIOAut(astartf, astepf))(α)) An Axiom
leqomega-def-rev ⊦ A_≤ωT_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) ↔ (∀ α. atraceω(AIOAut(astartf, astepf))(α) → ctraceω(CIOAut(cstartf, cstepf))(α)) An Axiom
leq-def-rev ⊦ A_≤T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) ↔ (∀ α. atrace(AIOAut(astartf, astepf))(α) → ctrace(CIOAut(cstartf, cstepf))(α)) An Axiom
leqstar-def-rev ⊦ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) ↔ (∀ α. atrace*(AIOAut(astartf, astepf))(α) → ctrace*(CIOAut(cstartf, cstepf))(α)) An Axiom
equiv-both-leq⊦ C_≡T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) A User Theorem
equivomega-both-leqomega⊦ C_≡ωT_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤ωT_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤ωT_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) A User Theorem
equivstar-both-leqstar⊦ C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf)) A User Theorem
leqstar-alt-defAIOAut?(AIOAut(astartf, astepf)) ⊦ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ asl, al0. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^)) A User Theorem