[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 infguess-deterministic
infguess(IOAut(startf, stepf)) = EXIOAut(exstartf, exstepf), exstepf(σα, a0, σα0) ∧ exstepf(σα, a1, σα1) ⊦ a0 = a1 ∧ σα0 = σα1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
infguessAut-def
,
Used spec theorems:
Used simplifier rules:
IOtrace
/
exec
pair-statestream-actionstream
/
sel-02
IO-Aut-data
/infguess/
inj