Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > efif1olem3 | Structured version Visualization version GIF version |
Description: Lemma for efif1o 25702. (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 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶) | |
2 | efif1o.2 | . . . . . . 7 ⊢ 𝐶 = (◡abs “ {1}) | |
3 | 1, 2 | eleqtrdi 2849 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ (◡abs “ {1})) |
4 | absf 15049 | . . . . . . 7 ⊢ abs:ℂ⟶ℝ | |
5 | ffn 6600 | . . . . . . 7 ⊢ (abs:ℂ⟶ℝ → abs Fn ℂ) | |
6 | fniniseg 6937 | . . . . . . 7 ⊢ (abs Fn ℂ → (𝑥 ∈ (◡abs “ {1}) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) = 1))) | |
7 | 4, 5, 6 | mp2b 10 | . . . . . 6 ⊢ (𝑥 ∈ (◡abs “ {1}) ↔ (𝑥 ∈ ℂ ∧ (abs‘𝑥) = 1)) |
8 | 3, 7 | sylib 217 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ ℂ ∧ (abs‘𝑥) = 1)) |
9 | 8 | simpld 495 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ ℂ) |
10 | 9 | sqrtcld 15149 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (√‘𝑥) ∈ ℂ) |
11 | 10 | imcld 14906 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ∈ ℝ) |
12 | absimle 15021 | . . . . . 6 ⊢ ((√‘𝑥) ∈ ℂ → (abs‘(ℑ‘(√‘𝑥))) ≤ (abs‘(√‘𝑥))) | |
13 | 10, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(ℑ‘(√‘𝑥))) ≤ (abs‘(√‘𝑥))) |
14 | 9 | sqsqrtd 15151 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((√‘𝑥)↑2) = 𝑥) |
15 | 14 | fveq2d 6778 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘((√‘𝑥)↑2)) = (abs‘𝑥)) |
16 | 2nn0 12250 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
17 | absexp 15016 | . . . . . . . . 9 ⊢ (((√‘𝑥) ∈ ℂ ∧ 2 ∈ ℕ0) → (abs‘((√‘𝑥)↑2)) = ((abs‘(√‘𝑥))↑2)) | |
18 | 10, 16, 17 | sylancl 586 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘((√‘𝑥)↑2)) = ((abs‘(√‘𝑥))↑2)) |
19 | 8 | simprd 496 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘𝑥) = 1) |
20 | 15, 18, 19 | 3eqtr3d 2786 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((abs‘(√‘𝑥))↑2) = 1) |
21 | sq1 13912 | . . . . . . 7 ⊢ (1↑2) = 1 | |
22 | 20, 21 | eqtr4di 2796 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((abs‘(√‘𝑥))↑2) = (1↑2)) |
23 | 10 | abscld 15148 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(√‘𝑥)) ∈ ℝ) |
24 | 10 | absge0d 15156 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 0 ≤ (abs‘(√‘𝑥))) |
25 | 1re 10975 | . . . . . . . 8 ⊢ 1 ∈ ℝ | |
26 | 0le1 11498 | . . . . . . . 8 ⊢ 0 ≤ 1 | |
27 | sq11 13850 | . . . . . . . 8 ⊢ ((((abs‘(√‘𝑥)) ∈ ℝ ∧ 0 ≤ (abs‘(√‘𝑥))) ∧ (1 ∈ ℝ ∧ 0 ≤ 1)) → (((abs‘(√‘𝑥))↑2) = (1↑2) ↔ (abs‘(√‘𝑥)) = 1)) | |
28 | 25, 26, 27 | mpanr12 702 | . . . . . . 7 ⊢ (((abs‘(√‘𝑥)) ∈ ℝ ∧ 0 ≤ (abs‘(√‘𝑥))) → (((abs‘(√‘𝑥))↑2) = (1↑2) ↔ (abs‘(√‘𝑥)) = 1)) |
29 | 23, 24, 28 | syl2anc 584 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (((abs‘(√‘𝑥))↑2) = (1↑2) ↔ (abs‘(√‘𝑥)) = 1)) |
30 | 22, 29 | mpbid 231 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(√‘𝑥)) = 1) |
31 | 13, 30 | breqtrd 5100 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (abs‘(ℑ‘(√‘𝑥))) ≤ 1) |
32 | absle 15027 | . . . . 5 ⊢ (((ℑ‘(√‘𝑥)) ∈ ℝ ∧ 1 ∈ ℝ) → ((abs‘(ℑ‘(√‘𝑥))) ≤ 1 ↔ (-1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1))) | |
33 | 11, 25, 32 | sylancl 586 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((abs‘(ℑ‘(√‘𝑥))) ≤ 1 ↔ (-1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1))) |
34 | 31, 33 | mpbid 231 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (-1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1)) |
35 | 34 | simpld 495 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → -1 ≤ (ℑ‘(√‘𝑥))) |
36 | 34 | simprd 496 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ≤ 1) |
37 | neg1rr 12088 | . . 3 ⊢ -1 ∈ ℝ | |
38 | 37, 25 | elicc2i 13145 | . 2 ⊢ ((ℑ‘(√‘𝑥)) ∈ (-1[,]1) ↔ ((ℑ‘(√‘𝑥)) ∈ ℝ ∧ -1 ≤ (ℑ‘(√‘𝑥)) ∧ (ℑ‘(√‘𝑥)) ≤ 1)) |
39 | 11, 35, 36, 38 | syl3anbrc 1342 | 1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (ℑ‘(√‘𝑥)) ∈ (-1[,]1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {csn 4561 class class class wbr 5074 ↦ cmpt 5157 ◡ccnv 5588 “ cima 5592 Fn wfn 6428 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 ℂcc 10869 ℝcr 10870 0cc0 10871 1c1 10872 ici 10873 · cmul 10876 ≤ cle 11010 -cneg 11206 2c2 12028 ℕ0cn0 12233 [,]cicc 13082 ↑cexp 13782 ℑcim 14809 √csqrt 14944 abscabs 14945 expce 15771 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-icc 13086 df-seq 13722 df-exp 13783 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 |
This theorem is referenced by: efif1olem4 25701 |
Copyright terms: Public domain | W3C validator |