[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 lemma_2-2-2-aux
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl0 ∧ frag*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) ↔ s ∈ sl
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma_2-2-2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 33
Used lemmas:
Used spec theorems:
IOtrace
/
move
Used simplifier rules:
IOtrace
/
fragstar
list
/IOstatestream/
in-empty
list
/IOstatestream/
a
list
/IOstatestream/
in-rec
list
/IOstatestream/
c
list
/IOstatestream/
in-append
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward
IOtrace
/
frag-fin1
stream
/IOstatestream/
sel-fin
stream-basic
/IOstatestream/
sel-02