| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efif1olem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for efif1o 26611. (Contributed by Mario Carneiro, 8-May-2015.) |
| Ref | Expression |
|---|---|
| efif1o.1 | ⊢ 𝐹 = (𝑤 ∈ 𝐷 ↦ (exp‘(i · 𝑤))) |
| efif1o.2 | ⊢ 𝐶 = (◡abs “ {1}) |
| Ref | Expression |
|---|---|
| efif1olem3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ∈ (-1[,]1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 488 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶) | |
| 2 | efif1o.2 | . . . . . . 7 ⊢ 𝐶 = (◡abs “ {1}) | |
| 3 | 1, 2 | eleqtrdi 2872 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ (◡abs “ {1})) |
| 4 | absf 15365 | . . . . . . 7 ⊢ abs:ℂ⟶ℝ | |
| 5 | ffn 6691 | . . . . . . 7 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ) | |
| 6 | fniniseg 7041 | . . . . . . 7 ⊢ (abs Fn ℂ → (𝑥 ∈ (◡abs “ {1}) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) = 1))) | |
| 7 | 4, 5, 6 | mp2b 10 | . . . . . 6 ⊢ (𝑥 ∈ (◡abs “ {1}) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) = 1)) |
| 8 | 3, 7 | sylib 220 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ ℂ ∧ (abs‘𝑥) = 1)) |
| 9 | 8 | simpld 498 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ ℂ) |
| 10 | 9 | sqrtcld 15467 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (√‘𝑥) ∈ ℂ) |
| 11 | 10 | imcld 15222 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ∈ ℝ) |
| 12 | absimle 15336 | . . . . . 6 ⊢ ((√‘𝑥) ∈ ℂ → (abs‘(ℑ‘(√‘𝑥))) ≤ (abs‘(√‘𝑥))) | |
| 13 | 10, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(ℑ‘(√‘𝑥))) ≤ (abs‘(√‘𝑥))) |
| 14 | 9 | sqsqrtd 15469 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((√‘𝑥)↑2) = 𝑥) |
| 15 | 14 | fveq2d 6871 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘((√‘𝑥)↑2)) = (abs‘𝑥)) |
| 16 | 2nn0 12498 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
| 17 | absexp 15331 | . . . . . . . . 9 ⊢ (((√‘𝑥) ∈ ℂ ∧ 2 ∈ ℕ0) → (abs‘((√‘𝑥)↑2)) = ((abs‘(√‘𝑥))↑2)) | |
| 18 | 10, 16, 17 | sylancl 595 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘((√‘𝑥)↑2)) = ((abs‘(√‘𝑥))↑2)) |
| 19 | 8 | simprd 499 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘𝑥) = 1) |
| 20 | 15, 18, 19 | 3eqtr3d 2805 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((abs‘(√‘𝑥))↑2) = 1) |
| 21 | sq1 14208 | . . . . . . 7 ⊢ (1↑2) = 1 | |
| 22 | 20, 21 | eqtr4di 2815 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((abs‘(√‘𝑥))↑2) = (1↑2)) |
| 23 | 10 | abscld 15466 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(√‘𝑥)) ∈ ℝ) |
| 24 | 10 | absge0d 15474 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 0 ≤ (abs‘(√‘𝑥))) |
| 25 | 1re 11181 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
| 26 | 0le1 11710 | . . . . . . . 8 ⊢ 0 ≤ 1 | |
| 27 | sq11 14144 | . . . . . . . 8 ⊢ ((((abs‘(√‘𝑥)) ∈ ℝ ∧ 0 ≤ (abs‘(√‘𝑥))) ∧ (1 ∈ ℝ ∧ 0 ≤ 1)) → (((abs‘(√‘𝑥))↑2) = (1↑2) ↔ (abs‘(√‘𝑥)) = 1)) | |
| 28 | 25, 26, 27 | mpanr12 715 | . . . . . . 7 ⊢ (((abs‘(√‘𝑥)) ∈ ℝ ∧ 0 ≤ (abs‘(√‘𝑥))) → (((abs‘(√‘𝑥))↑2) = (1↑2) ↔ (abs‘(√‘𝑥)) = 1)) |
| 29 | 23, 24, 28 | syl2anc 593 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (((abs‘(√‘𝑥))↑2) = (1↑2) ↔ (abs‘(√‘𝑥)) = 1)) |
| 30 | 22, 29 | mpbid 234 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(√‘𝑥)) = 1) |
| 31 | 13, 30 | breqtrd 5126 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(ℑ‘(√‘𝑥))) ≤ 1) |
| 32 | absle 15343 | . . . . 5 ⊢ (((ℑ‘(√‘𝑥)) ∈ ℝ ∧ 1 ∈ ℝ) → ((abs‘(ℑ‘(√‘𝑥))) ≤ 1 ↔ (-1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1))) | |
| 33 | 11, 25, 32 | sylancl 595 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((abs‘(ℑ‘(√‘𝑥))) ≤ 1 ↔ (-1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1))) |
| 34 | 31, 33 | mpbid 234 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (-1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1)) |
| 35 | 34 | simpld 498 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → -1 ≤ (ℑ‘(√‘𝑥))) |
| 36 | 34 | simprd 499 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ≤ 1) |
| 37 | neg1rr 12181 | . . 3 ⊢ -1 ∈ ℝ | |
| 38 | 37, 25 | elicc2i 13416 | . 2 ⊢ ((ℑ‘(√‘𝑥)) ∈ (-1[,]1) ↔ ((ℑ‘(√‘𝑥)) ∈ ℝ ∧ -1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1)) |
| 39 | 11, 35, 36, 38 | syl3anbrc 1357 | 1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ∈ (-1[,]1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 {csn 4582 class class class wbr 5100 ↦ cmpt 5181 ◡ccnv 5646 “ cima 5650 Fn wfn 6516 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 ℂcc 11071 ℝcr 11072 0cc0 11073 1c1 11074 ici 11075 · cmul 11078 ≤ cle 11217 -cneg 11415 2c2 12272 ℕ0cn0 12481 [,]cicc 13352 ↑cexp 14074 ℑcim 15125 √csqrt 15260 abscabs 15261 expce 16091 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 ax-pre-sup 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9388 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-3 12281 df-n0 12482 df-z 12569 df-uz 12840 df-rp 12994 df-icc 13356 df-seq 14015 df-exp 14075 df-cj 15126 df-re 15127 df-im 15128 df-sqrt 15262 df-abs 15263 |
| This theorem is referenced by: efif1olem4 26610 |
| Copyright terms: Public domain | W3C validator |