[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 deterministic
⊦ det(IOAut(startf, stepf)) ↔ (∃ s. ∀ s0. startf(s0) ↔ s = s0) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0) ∧ (∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma_2-2-1
,
Used by units in proved state:
can
,
Proof exists?: No