| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lo1o1 | Structured version Visualization version GIF version | ||
| Description: A function is eventually bounded iff its absolute value is eventually upper bounded. (Contributed by Mario Carneiro, 26-May-2016.) |
| Ref | Expression |
|---|---|
| lo1o1 | ⊢ (𝐹:𝐴⟶ℂ → (𝐹 ∈ 𝑂(1) ↔ (abs ∘ 𝐹) ∈ ≤𝑂(1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | o1dm 15483 | . . 3 ⊢ (𝐹 ∈ 𝑂(1) → dom 𝐹 ⊆ ℝ) | |
| 2 | fdm 6664 | . . . 4 ⊢ (𝐹:𝐴⟶ℂ → dom 𝐹 = 𝐴) | |
| 3 | 2 | sseq1d 3946 | . . 3 ⊢ (𝐹:𝐴⟶ℂ → (dom 𝐹 ⊆ ℝ ↔ 𝐴 ⊆ ℝ)) |
| 4 | 1, 3 | imbitrid 245 | . 2 ⊢ (𝐹:𝐴⟶ℂ → (𝐹 ∈ 𝑂(1) → 𝐴 ⊆ ℝ)) |
| 5 | lo1dm 15472 | . . 3 ⊢ ((abs ∘ 𝐹) ∈ ≤𝑂(1) → dom (abs ∘ 𝐹) ⊆ ℝ) | |
| 6 | absf 15291 | . . . . . 6 ⊢ abs:ℂ⟶ℝ | |
| 7 | fco 6679 | . . . . . 6 ⊢ ((abs:ℂ⟶ℝ ∧ 𝐹:𝐴⟶ℂ) → (abs ∘ 𝐹):𝐴⟶ℝ) | |
| 8 | 6, 7 | mpan 696 | . . . . 5 ⊢ (𝐹:𝐴⟶ℂ → (abs ∘ 𝐹):𝐴⟶ℝ) |
| 9 | 8 | fdmd 6665 | . . . 4 ⊢ (𝐹:𝐴⟶ℂ → dom (abs ∘ 𝐹) = 𝐴) |
| 10 | 9 | sseq1d 3946 | . . 3 ⊢ (𝐹:𝐴⟶ℂ → (dom (abs ∘ 𝐹) ⊆ ℝ ↔ 𝐴 ⊆ ℝ)) |
| 11 | 5, 10 | imbitrid 245 | . 2 ⊢ (𝐹:𝐴⟶ℂ → ((abs ∘ 𝐹) ∈ ≤𝑂(1) → 𝐴 ⊆ ℝ)) |
| 12 | fvco3 6927 | . . . . . . . . 9 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝑦 ∈ 𝐴) → ((abs ∘ 𝐹)‘𝑦) = (abs‘(𝐹‘𝑦))) | |
| 13 | 12 | adantlr 721 | . . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) ∧ 𝑦 ∈ 𝐴) → ((abs ∘ 𝐹)‘𝑦) = (abs‘(𝐹‘𝑦))) |
| 14 | 13 | breq1d 5082 | . . . . . . 7 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) ∧ 𝑦 ∈ 𝐴) → (((abs ∘ 𝐹)‘𝑦) ≤ 𝑚 ↔ (abs‘(𝐹‘𝑦)) ≤ 𝑚)) |
| 15 | 14 | imbi2d 341 | . . . . . 6 ⊢ (((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) ∧ 𝑦 ∈ 𝐴) → ((𝑥 ≤ 𝑦 → ((abs ∘ 𝐹)‘𝑦) ≤ 𝑚) ↔ (𝑥 ≤ 𝑦 → (abs‘(𝐹‘𝑦)) ≤ 𝑚))) |
| 16 | 15 | ralbidva 3160 | . . . . 5 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → (∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → ((abs ∘ 𝐹)‘𝑦) ≤ 𝑚) ↔ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (abs‘(𝐹‘𝑦)) ≤ 𝑚))) |
| 17 | 16 | 2rexbidv 3204 | . . . 4 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → (∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → ((abs ∘ 𝐹)‘𝑦) ≤ 𝑚) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (abs‘(𝐹‘𝑦)) ≤ 𝑚))) |
| 18 | ello12 15469 | . . . . 5 ⊢ (((abs ∘ 𝐹):𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((abs ∘ 𝐹) ∈ ≤𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → ((abs ∘ 𝐹)‘𝑦) ≤ 𝑚))) | |
| 19 | 8, 18 | sylan 586 | . . . 4 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → ((abs ∘ 𝐹) ∈ ≤𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → ((abs ∘ 𝐹)‘𝑦) ≤ 𝑚))) |
| 20 | elo12 15480 | . . . 4 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → (𝐹 ∈ 𝑂(1) ↔ ∃𝑥 ∈ ℝ ∃𝑚 ∈ ℝ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (abs‘(𝐹‘𝑦)) ≤ 𝑚))) | |
| 21 | 17, 19, 20 | 3bitr4rd 313 | . . 3 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → (𝐹 ∈ 𝑂(1) ↔ (abs ∘ 𝐹) ∈ ≤𝑂(1))) |
| 22 | 21 | ex 413 | . 2 ⊢ (𝐹:𝐴⟶ℂ → (𝐴 ⊆ ℝ → (𝐹 ∈ 𝑂(1) ↔ (abs ∘ 𝐹) ∈ ≤𝑂(1)))) |
| 23 | 4, 11, 22 | pm5.21ndd 380 | 1 ⊢ (𝐹:𝐴⟶ℂ → (𝐹 ∈ 𝑂(1) ↔ (abs ∘ 𝐹) ∈ ≤𝑂(1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ∃wrex 3063 ⊆ wss 3883 class class class wbr 5072 dom cdm 5618 ∘ ccom 5622 ⟶wf 6481 ‘cfv 6485 ℂcc 11027 ℝcr 11028 ≤ cle 11171 abscabs 15187 𝑂(1)co1 15439 ≤𝑂(1)clo1 15440 |
| 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 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| 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 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-ico 13295 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-o1 15443 df-lo1 15444 |
| This theorem is referenced by: lo1o12 15486 o1res 15513 |
| Copyright terms: Public domain | W3C validator |