[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
,
Theorem leq-def
⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
equiv-both-leq
,
Used by units in proved state:
restricted-refine-implies-forward
,
weakfin-startfin-IObackward-INV-is-leqrefine
,
IOrefine-equiv-behrefine
,
IOrefine-implies-Cinfguess-fw-A
,
imfinIObackward-is-refine
,
IOforward-is-leqrefine
,
Proof exists?: No