[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 monle-converges-sup
mon≤(f), bounded≤(f, r) ⊦ converges(f, sup(λ r. ∃ n. r = f(n)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
monge-converges-inf
,
monle-boundedle-converges
,
monle-limit-sup
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 36
Proof steps: 52
Used lemmas:
monle-def
,
boundedle-def
,
convergesto-def
,
Used spec theorems:
real-supinf
/
sup-lowest-upperbound
real-supinf
/
upperbound-def
real-supinf
/
sup-upperbound
real-abs
/
Abs-neg
real-abs
/
antr
real-abs
/
Abs-pos
real-abs
/
lels
real-basic
/
add-comm
real-abs
/
forward-lels
real-supinf
/
boundedle-def
Used simplifier rules:
real-abs
/
sub-def
nat
/
ge
real-abs
/
gr-def
real-abs
/
le-def
real-abs
/
lels-03
real-basic
/
add-comm
real-basic
/
add-assoc
real-multdiv
/
commutativity
real-multdiv
/
mult-ass
real-abs
/
le-num
real-multdiv
/
zero-left
real-multdiv
/
inv-le-pos
real-basic
/
ls-num
real-multdiv
/
zero-le
real-abs
/
lep-01
real-abs
/
sub-le-01
real-abs
/
lels
real-basic
/
neg-08
real-abs
/
ler
real-basic
/
double-neg
real-basic
/
neg-add
real-basic
/
less-add-cancel-l
real-multdiv
/
invmult-gr-pos
real-multdiv
/
ls-same
real-multdiv
/
le-same
real-multdiv
/
mult-one
real-abs
/
lep-02
real-abs
/
lenls