[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 wbw-leqstar
≤wB(cioaut, aioaut) ⊦ C_≤*T_A(cioaut, aioaut)
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: 13
Proof steps: 31
Used lemmas:
Used spec theorems:
IOrefine-def
/
leqstar-def
IOtrace
/
fintrace
IOrefine-conds
/
weakbackwardsim-def
IOrefine-conds
/
weak-lemma_3-15
IOtrace
/
move
IOrefine-conds
/
proofobls-weakbackwardsim
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstart
IOtrace
/
finexec
list-last
/
last-one
list-del
/
one-03
IOtrace
/
finfrag-one
IO-Aut-data
/
sel-IOAut-dotext
remtau
/
finremtau-one