[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 lift-cont
⊦ mon(lf) → cont(lift(lf))
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: 23
Proof steps: 45
Used lemmas:
pbd-def
,
monl-equiv
,
lift-inf
,
monl-def
,
lift-fin
,
mon-def
,
cont-def
,
Used spec theorems:
streamseq-mon-lim
/
lim-def
stream
/
prefix-def
list-last
/
prefix
list-getput
/
extension
Used simplifier rules:
stream
/
not-prefix-inf-fin
stream
/
prefix-bothfin-listprefix
stream
/
prefix-inf-inf-equal
stream
/
leq-refl
stream
/
sel-inf
nat-inf
/
less-inf2
stream
/
size-inf
stream
/
fun-nonempty
stream
/
elim-fromto-inf
stream
/
append-assoc
stream
/
appinf-sel
stream
/
infapp-embed
stream
/
append-split-fin
stream
/
to-fin
nat-inf
/
less-fin
stream
/
size-fin
stream
/
fin-finlen-tolen
nat-basic
/
refl-Nat
list-last
/
prefix-trans
stream
/
to-inf
nat-inf
/
less-inf1
list
/
len
stream
/
size-inf-to
list
/
a
nat-basic
/
eq-02
nat-basic
/
z-01
nat-basic
/
a
nat-basic
/
c
stream
/
leq-trans