| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elo1d | Structured version Visualization version GIF version | ||
| Description: Sufficient condition for elementhood in the set of eventually bounded functions. (Contributed by Mario Carneiro, 21-Sep-2014.) (Proof shortened by Mario Carneiro, 26-May-2016.) |
| Ref | Expression |
|---|---|
| elo1mpt.1 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| elo1mpt.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| elo1d.3 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| elo1d.4 | ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| elo1d.5 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝐶 ≤ 𝑥)) → (abs‘𝐵) ≤ 𝑀) |
| Ref | Expression |
|---|---|
| elo1d | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑂(1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elo1mpt.1 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 2 | elo1mpt.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 3 | 2 | abscld 15442 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ) |
| 4 | elo1d.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 5 | elo1d.4 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) | |
| 6 | elo1d.5 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝐶 ≤ 𝑥)) → (abs‘𝐵) ≤ 𝑀) | |
| 7 | 1, 3, 4, 5, 6 | ello1d 15526 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ ≤𝑂(1)) |
| 8 | 2 | lo1o12 15536 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑂(1) ↔ (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ ≤𝑂(1))) |
| 9 | 7, 8 | mpbird 259 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑂(1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2136 ⊆ wss 3899 class class class wbr 5094 ↦ cmpt 5175 ‘cfv 6510 ℂcc 11061 ℝcr 11062 ≤ cle 11207 abscabs 15237 𝑂(1)co1 15489 ≤𝑂(1)clo1 15490 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 ax-pre-sup 11141 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-er 8666 df-pm 8799 df-en 8917 df-dom 8918 df-sdom 8919 df-sup 9378 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-div 11835 df-nn 12201 df-2 12270 df-3 12271 df-n0 12472 df-z 12559 df-uz 12830 df-rp 12984 df-ico 13345 df-seq 14005 df-exp 14065 df-cj 15102 df-re 15103 df-im 15104 df-sqrt 15238 df-abs 15239 df-o1 15493 df-lo1 15494 |
| This theorem is referenced by: o1fsum 15817 flo1 15860 divsqrtsumo1 27018 chebbnd1 27506 chto1ub 27510 rpvmasumlem 27521 dchrmusum2 27528 dchrisum0lem2a 27551 dchrisum0lem2 27552 rplogsum 27561 mudivsum 27564 mulogsumlem 27565 selberg3lem1 27591 pntrsumo1 27599 |
| Copyright terms: Public domain | W3C validator |