[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 forward-implies-leqrefine
≤F(cioaut, aioaut) ⊦ C_≤T_A(cioaut, aioaut)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
simpleforward-is-leqrefine
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 45
Proof steps: 86
Used lemmas:
forward-lem
,
Used spec theorems:
IOrefine-conds
/
forwardsim-def
IOrefine-def
/
leq-def
IOtrace
/
trace
infinite-append
/
nextl-lemma-butlast
IOtrace
/
fintrace
IOtrace
/
infappend-moves-gen
IOtrace
/
fraginf
IOtrace
/
move
list-getput
/
get-zero-01
IOrefine-conds
/
proofobls-forwardsim
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstart
IOtrace
/
exec
stream-basic
/
inj-rqui
remtau
/
finremtau-one
remtau
/
finremtau-def
stream
/
sel-fin
IOtrace
/
tracestar-def
stream-basic
/
sel-rqui-dotl
stream-basic
/
elim-finp-ant
IOtrace
/
frag-finite-sl
IOtrace
/
finexec
stream
/
sel-inf
stream-basic
/
sel-rqui0-dotf
stream-basic
/
elim-finp-suc
IOtrace
/
frag-inf-sl
list-last
/
last-one
nat-basic
/
c
nat-basic
/
a
IO-Aut-data
/
sel-IOAut-dotstep
nat-basic
/
succ
IO-Aut-data
/
sel-IOAut-dotext
list-data
/
size-nil
nat-basic
/
z-01
list-data
/
l
IOtrace
/
fragfin-size
IOtrace
/
frag-step-inf-inf
list
/
e
list
/
c
list-del
/
get-zero
list
/
a
IOtrace
/
not-finfrag-empty
list-data
/
elim-list-c