[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_3-15
bwsim(IOAut(cstart, cstep, cext), IOAut(astart, astep, aext), t, cINV, aINV), cINV(cs), move(IOAut(cstart, cstep, cext))(cs, el, cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. aINV(as) ∧ move(IOAut(astart, astep, aext))(as, el, as0) ∧ t(cs, as)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
IObackward-INV-is-leqstarrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 26
Used lemmas:
proofobls-backwardsiminv
,
Used spec theorems:
IOtrace
/
move
IOtrace
/
finfrag-rec
IOtrace
/
move-trans
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotext
remtau
/
finremtau-empty
list-last
/
l-06
IOtrace
/
finfrag-onlyone
list
/
e
list-data
/
elim-list-c
list
/
a
list-del
/
get-zero
list
/
c
list
/
app-02
list
/
c-03
IOtrace
/
move-empty
remtau
/
finremtau-one
remtau
/
finremtau-append
IOtrace
/
not-finfrag-empty
list
/
app
list-last
/
last-one
list-last
/
last-rec