[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 monl-equiv
⊦ mon(lf) ↔ (∀ af. mon(⌜λ n. ⌜lf(af.take(n))⌝ ⌝ ))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
lift-cont
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 24
Used lemmas:
monl-def
,
Used spec theorems:
streamseq-mon-lim
/
mon-def
stream
/
to-unwind-end-inf
list-last
/
prefix
streamseq-mon-lim
/
mon-lem
stream
/
prefix-def
list-getput
/
extension
Used simplifier rules:
stream
/
sel-inf
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
disj-rqui-infty
nat-inf
/
addeqinf-cancel
nat-inf
/
inf-less
stream
/
size-inf
nat-basic
/
a
nat-basic
/
c
list
/
a
list-last
/
prefix-app-size-eq
stream
/
append-finfin
stream
/
leq-append-right
stream
/
append-assoc
nat-inf
/
less-inf2
nat
/
le-def
list-last
/
prefix-longer-01
list
/
len
stream
/
neq-fin-inf-01
stream
/
eq-stream-to-list-2-1
stream
/
size-inf-to
nat
/
ls-le-simp
stream
/
get-infto
list-del
/
get-append-less
nat-basic
/
f
list-data
/
l
nat
/
lels
nat
/
fle-01
nat-basic
/
l-02
nat-basic
/
eq-01