| Mathbox for Stanislas Polu |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > imo72b2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for imo72b2 44413. (Contributed by Stanislas Polu, 9-Mar-2020.) |
| Ref | Expression |
|---|---|
| imo72b2lem1.1 | ⊢ (𝜑 → 𝐹:ℝ⟶ℝ) |
| imo72b2lem1.7 | ⊢ (𝜑 → ∃𝑥 ∈ ℝ (𝐹‘𝑥) ≠ 0) |
| imo72b2lem1.6 | ⊢ (𝜑 → ∀𝑦 ∈ ℝ (abs‘(𝐹‘𝑦)) ≤ 1) |
| Ref | Expression |
|---|---|
| imo72b2lem1 | ⊢ (𝜑 → 0 < sup((abs “ (𝐹 “ ℝ)), ℝ, < )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imaco 6209 | . . 3 ⊢ ((abs ∘ 𝐹) “ ℝ) = (abs “ (𝐹 “ ℝ)) | |
| 2 | imassrn 6030 | . . . 4 ⊢ ((abs ∘ 𝐹) “ ℝ) ⊆ ran (abs ∘ 𝐹) | |
| 3 | imo72b2lem1.1 | . . . . . 6 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ) | |
| 4 | absf 15261 | . . . . . . . 8 ⊢ abs:ℂ⟶ℝ | |
| 5 | 4 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → abs:ℂ⟶ℝ) |
| 6 | ax-resscn 11083 | . . . . . . . 8 ⊢ ℝ ⊆ ℂ | |
| 7 | 6 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℂ) |
| 8 | 5, 7 | fssresd 6701 | . . . . . 6 ⊢ (𝜑 → (abs ↾ ℝ):ℝ⟶ℝ) |
| 9 | 3, 8 | fco2d 44403 | . . . . 5 ⊢ (𝜑 → (abs ∘ 𝐹):ℝ⟶ℝ) |
| 10 | 9 | frnd 6670 | . . . 4 ⊢ (𝜑 → ran (abs ∘ 𝐹) ⊆ ℝ) |
| 11 | 2, 10 | sstrid 3945 | . . 3 ⊢ (𝜑 → ((abs ∘ 𝐹) “ ℝ) ⊆ ℝ) |
| 12 | 1, 11 | eqsstrrid 3973 | . 2 ⊢ (𝜑 → (abs “ (𝐹 “ ℝ)) ⊆ ℝ) |
| 13 | 0re 11134 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 14 | 13 | ne0ii 4296 | . . . . 5 ⊢ ℝ ≠ ∅ |
| 15 | 14 | a1i 11 | . . . 4 ⊢ (𝜑 → ℝ ≠ ∅) |
| 16 | 15, 9 | wnefimgd 44402 | . . 3 ⊢ (𝜑 → ((abs ∘ 𝐹) “ ℝ) ≠ ∅) |
| 17 | 1, 16 | eqnetrrid 3007 | . 2 ⊢ (𝜑 → (abs “ (𝐹 “ ℝ)) ≠ ∅) |
| 18 | 1red 11133 | . . 3 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 19 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑐 = 1) → 𝑐 = 1) | |
| 20 | 19 | breq2d 5110 | . . . 4 ⊢ ((𝜑 ∧ 𝑐 = 1) → (𝑡 ≤ 𝑐 ↔ 𝑡 ≤ 1)) |
| 21 | 20 | ralbidv 3159 | . . 3 ⊢ ((𝜑 ∧ 𝑐 = 1) → (∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 𝑐 ↔ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1)) |
| 22 | imo72b2lem1.6 | . . . 4 ⊢ (𝜑 → ∀𝑦 ∈ ℝ (abs‘(𝐹‘𝑦)) ≤ 1) | |
| 23 | 3, 22 | extoimad 44405 | . . 3 ⊢ (𝜑 → ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 1) |
| 24 | 18, 21, 23 | rspcedvd 3578 | . 2 ⊢ (𝜑 → ∃𝑐 ∈ ℝ ∀𝑡 ∈ (abs “ (𝐹 “ ℝ))𝑡 ≤ 𝑐) |
| 25 | 0red 11135 | . 2 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 26 | imo72b2lem1.7 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ (𝐹‘𝑥) ≠ 0) | |
| 27 | 3 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → 𝐹:ℝ⟶ℝ) |
| 28 | simprl 770 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → 𝑥 ∈ ℝ) | |
| 29 | 27, 28 | fvco3d 6934 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → ((abs ∘ 𝐹)‘𝑥) = (abs‘(𝐹‘𝑥))) |
| 30 | 9 | funfvima2d 7178 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ((abs ∘ 𝐹)‘𝑥) ∈ ((abs ∘ 𝐹) “ ℝ)) |
| 31 | 30 | adantrr 717 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → ((abs ∘ 𝐹)‘𝑥) ∈ ((abs ∘ 𝐹) “ ℝ)) |
| 32 | 31, 1 | eleqtrdi 2846 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → ((abs ∘ 𝐹)‘𝑥) ∈ (abs “ (𝐹 “ ℝ))) |
| 33 | 29, 32 | eqeltrrd 2837 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → (abs‘(𝐹‘𝑥)) ∈ (abs “ (𝐹 “ ℝ))) |
| 34 | simpr 484 | . . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) ∧ 𝑧 = (abs‘(𝐹‘𝑥))) → 𝑧 = (abs‘(𝐹‘𝑥))) | |
| 35 | 34 | breq2d 5110 | . . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) ∧ 𝑧 = (abs‘(𝐹‘𝑥))) → (0 < 𝑧 ↔ 0 < (abs‘(𝐹‘𝑥)))) |
| 36 | 3 | ffvelcdmda 7029 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ ℝ) |
| 37 | 36 | adantrr 717 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → (𝐹‘𝑥) ∈ ℝ) |
| 38 | 37 | recnd 11160 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → (𝐹‘𝑥) ∈ ℂ) |
| 39 | simprr 772 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → (𝐹‘𝑥) ≠ 0) | |
| 40 | 38, 39 | absrpcld 15374 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → (abs‘(𝐹‘𝑥)) ∈ ℝ+) |
| 41 | 40 | rpgt0d 12952 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → 0 < (abs‘(𝐹‘𝑥))) |
| 42 | 33, 35, 41 | rspcedvd 3578 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℝ ∧ (𝐹‘𝑥) ≠ 0)) → ∃𝑧 ∈ (abs “ (𝐹 “ ℝ))0 < 𝑧) |
| 43 | 26, 42 | rexlimddv 3143 | . 2 ⊢ (𝜑 → ∃𝑧 ∈ (abs “ (𝐹 “ ℝ))0 < 𝑧) |
| 44 | 12, 17, 24, 25, 43 | suprlubrd 44409 | 1 ⊢ (𝜑 → 0 < sup((abs “ (𝐹 “ ℝ)), ℝ, < )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∀wral 3051 ∃wrex 3060 ⊆ wss 3901 ∅c0 4285 class class class wbr 5098 ran crn 5625 “ cima 5627 ∘ ccom 5628 ⟶wf 6488 ‘cfv 6492 supcsup 9343 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 < clt 11166 ≤ cle 11167 abscabs 15157 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 |
| This theorem is referenced by: imo72b2 44413 |
| Copyright terms: Public domain | W3C validator |