[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 monls-mon-implies-monls
⊦ (∀ n. mon<(nσf(n))) ∧ mon(nσf) → (mon<(lim(λ n. nσf(n))) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
rem-preserves-monls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 24
Used lemmas:
monls-def
,
Used spec theorems:
mon-lim-filter-count
/natstream/
lim-def
mon-lim-filter-count
/natstream/
prefix-def
stream
/natstream/
get-append-ls
Used simplifier rules:
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
inj-rqui
nat-inf
/
onels-neqzero
nat-inf
/
add-ls-cancel-01
nat-inf
/
ls-trans
nat-inf
/
ls-natinf-to-nat-1-2
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic
/
lf
nat-basic
/
trans-nat
nat-basic
/
f
nat
/
add-num-03
nat-basic
/
succ
nat-basic
/
l
nat-basic
/
refl-nat
nat-inf
/
less-inf1
nat-inf
/
lels-trans
stream
/natstream/
size-append
stream
/natstream/
size-to
stream
/natstream/
append-assoc
nat-inf
/
add-cancel-num-02
stream
/natstream/
get-append-notls
nat-inf
/
disj-rqui-infty
nat-inf
/
prime-add-fin
nat-inf
/
sel-rqui-dotn
nat
/
cancel-01
nat
/
fle
stream
/natstream/
get-to
nat-basic
/
l-01
nat
/
le-ls-simp
nat
/
le-add