[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 infguessAut-def
⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
infguess-deterministic
,
infguess-is-IOAut
,
Used by units in proved state:
IOrefine-implies-Cinfguess-fw-A
,
infguess-forwardrefines-orig
,
Proof exists?: No