| 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 15399 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘𝐵) ∈ ℝ) |
| 4 | elo1d.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 5 | elo1d.4 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) | |
| 6 | elo1d.5 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝐶 ≤ 𝑥)) → (abs‘𝐵) ≤ 𝑀) | |
| 7 | 1, 3, 4, 5, 6 | ello1d 15483 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ ≤𝑂(1)) |
| 8 | 2 | lo1o12 15493 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑂(1) ↔ (𝑥 ∈ 𝐴 ↦ (abs‘𝐵)) ∈ ≤𝑂(1))) |
| 9 | 7, 8 | mpbird 258 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝑂(1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2119 ⊆ wss 3890 class class class wbr 5079 ↦ cmpt 5160 ‘cfv 6492 ℂcc 11034 ℝcr 11035 ≤ cle 11178 abscabs 15194 𝑂(1)co1 15446 ≤𝑂(1)clo1 15447 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-pm 8773 df-en 8891 df-dom 8892 df-sdom 8893 df-sup 9352 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-n0 12436 df-z 12523 df-uz 12787 df-rp 12941 df-ico 13302 df-seq 13962 df-exp 14022 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-o1 15450 df-lo1 15451 |
| This theorem is referenced by: o1fsum 15774 flo1 15817 divsqrtsumo1 26972 chebbnd1 27460 chto1ub 27464 rpvmasumlem 27475 dchrmusum2 27482 dchrisum0lem2a 27505 dchrisum0lem2 27506 rplogsum 27515 mudivsum 27518 mulogsumlem 27519 selberg3lem1 27545 pntrsumo1 27553 |
| Copyright terms: Public domain | W3C validator |