| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > constrimcl | Structured version Visualization version GIF version | ||
| Description: Constructible numbers are closed under taking the imaginary part. (Contributed by Thierry Arnoux, 5-Nov-2025.) |
| Ref | Expression |
|---|---|
| constrcjcl.1 | ⊢ (𝜑 → 𝑋 ∈ Constr) |
| Ref | Expression |
|---|---|
| constrimcl | ⊢ (𝜑 → (ℑ‘𝑋) ∈ Constr) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0zd 12710 | . . 3 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 2 | 1 | zconstr 34444 | . 2 ⊢ (𝜑 → 0 ∈ Constr) |
| 3 | 1zzd 12732 | . . 3 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 4 | 3 | zconstr 34444 | . 2 ⊢ (𝜑 → 1 ∈ Constr) |
| 5 | constrcjcl.1 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ Constr) | |
| 6 | 5 | constrcn 34440 | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ ℂ) |
| 7 | 6 | recld 15368 | . . . . 5 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℝ) |
| 8 | 7 | recnd 11342 | . . . 4 ⊢ (𝜑 → (ℜ‘𝑋) ∈ ℂ) |
| 9 | ax-icn 11264 | . . . . . 6 ⊢ i ∈ ℂ | |
| 10 | 9 | a1i 11 | . . . . 5 ⊢ (𝜑 → i ∈ ℂ) |
| 11 | 6 | imcld 15369 | . . . . . 6 ⊢ (𝜑 → (ℑ‘𝑋) ∈ ℝ) |
| 12 | 11 | recnd 11342 | . . . . 5 ⊢ (𝜑 → (ℑ‘𝑋) ∈ ℂ) |
| 13 | 10, 12 | mulcld 11334 | . . . 4 ⊢ (𝜑 → (i · (ℑ‘𝑋)) ∈ ℂ) |
| 14 | 6 | replimd 15371 | . . . 4 ⊢ (𝜑 → 𝑋 = ((ℜ‘𝑋) + (i · (ℑ‘𝑋)))) |
| 15 | 8, 13, 14 | mvrladdd 11733 | . . 3 ⊢ (𝜑 → (𝑋 − (ℜ‘𝑋)) = (i · (ℑ‘𝑋))) |
| 16 | 6, 8 | negsubd 11680 | . . . 4 ⊢ (𝜑 → (𝑋 + -(ℜ‘𝑋)) = (𝑋 − (ℜ‘𝑋))) |
| 17 | 5 | constrrecl 34449 | . . . . . 6 ⊢ (𝜑 → (ℜ‘𝑋) ∈ Constr) |
| 18 | 17 | constrnegcl 34443 | . . . . 5 ⊢ (𝜑 → -(ℜ‘𝑋) ∈ Constr) |
| 19 | 5, 18 | constraddcl 34442 | . . . 4 ⊢ (𝜑 → (𝑋 + -(ℜ‘𝑋)) ∈ Constr) |
| 20 | 16, 19 | eqeltrrd 2861 | . . 3 ⊢ (𝜑 → (𝑋 − (ℜ‘𝑋)) ∈ Constr) |
| 21 | 15, 20 | eqeltrrd 2861 | . 2 ⊢ (𝜑 → (i · (ℑ‘𝑋)) ∈ Constr) |
| 22 | 1m0e1 12467 | . . . . . 6 ⊢ (1 − 0) = 1 | |
| 23 | 1cnd 11307 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 24 | 22, 23 | eqeltrid 2864 | . . . . 5 ⊢ (𝜑 → (1 − 0) ∈ ℂ) |
| 25 | 12, 24 | mulcld 11334 | . . . 4 ⊢ (𝜑 → ((ℑ‘𝑋) · (1 − 0)) ∈ ℂ) |
| 26 | 25 | addlidd 11516 | . . 3 ⊢ (𝜑 → (0 + ((ℑ‘𝑋) · (1 − 0))) = ((ℑ‘𝑋) · (1 − 0))) |
| 27 | 22 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 − 0) = 1) |
| 28 | 27 | oveq2d 7438 | . . 3 ⊢ (𝜑 → ((ℑ‘𝑋) · (1 − 0)) = ((ℑ‘𝑋) · 1)) |
| 29 | 12 | mulridd 11331 | . . 3 ⊢ (𝜑 → ((ℑ‘𝑋) · 1) = (ℑ‘𝑋)) |
| 30 | 26, 28, 29 | 3eqtrrd 2800 | . 2 ⊢ (𝜑 → (ℑ‘𝑋) = (0 + ((ℑ‘𝑋) · (1 − 0)))) |
| 31 | 10, 12 | absmuld 15631 | . . . 4 ⊢ (𝜑 → (abs‘(i · (ℑ‘𝑋))) = ((abs‘i) · (abs‘(ℑ‘𝑋)))) |
| 32 | absi 15460 | . . . . . 6 ⊢ (abs‘i) = 1 | |
| 33 | 32 | a1i 11 | . . . . 5 ⊢ (𝜑 → (abs‘i) = 1) |
| 34 | 33 | oveq1d 7437 | . . . 4 ⊢ (𝜑 → ((abs‘i) · (abs‘(ℑ‘𝑋))) = (1 · (abs‘(ℑ‘𝑋)))) |
| 35 | 12 | abscld 15613 | . . . . . 6 ⊢ (𝜑 → (abs‘(ℑ‘𝑋)) ∈ ℝ) |
| 36 | 35 | recnd 11342 | . . . . 5 ⊢ (𝜑 → (abs‘(ℑ‘𝑋)) ∈ ℂ) |
| 37 | 36 | mullidd 11332 | . . . 4 ⊢ (𝜑 → (1 · (abs‘(ℑ‘𝑋))) = (abs‘(ℑ‘𝑋))) |
| 38 | 31, 34, 37 | 3eqtrd 2799 | . . 3 ⊢ (𝜑 → (abs‘(i · (ℑ‘𝑋))) = (abs‘(ℑ‘𝑋))) |
| 39 | 13 | subid1d 11663 | . . . 4 ⊢ (𝜑 → ((i · (ℑ‘𝑋)) − 0) = (i · (ℑ‘𝑋))) |
| 40 | 39 | fveq2d 6892 | . . 3 ⊢ (𝜑 → (abs‘((i · (ℑ‘𝑋)) − 0)) = (abs‘(i · (ℑ‘𝑋)))) |
| 41 | 12 | subid1d 11663 | . . . 4 ⊢ (𝜑 → ((ℑ‘𝑋) − 0) = (ℑ‘𝑋)) |
| 42 | 41 | fveq2d 6892 | . . 3 ⊢ (𝜑 → (abs‘((ℑ‘𝑋) − 0)) = (abs‘(ℑ‘𝑋))) |
| 43 | 38, 40, 42 | 3eqtr4rd 2806 | . 2 ⊢ (𝜑 → (abs‘((ℑ‘𝑋) − 0)) = (abs‘((i · (ℑ‘𝑋)) − 0))) |
| 44 | 2, 4, 2, 21, 2, 11, 12, 30, 43 | constrlccl 34437 | 1 ⊢ (𝜑 → (ℑ‘𝑋) ∈ Constr) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ‘cfv 6541 (class class class)co 7422 ℂcc 11203 0cc0 11205 1c1 11206 ici 11207 + caddc 11208 · cmul 11210 − cmin 11546 -cneg 11547 ℜcre 15271 ℑcim 15272 abscabs 15408 Constrcconstr 34409 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-1o 8481 df-2o 8482 df-er 8722 df-en 8979 df-dom 8980 df-sdom 8981 df-fin 8982 df-sup 9439 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-2 12410 df-3 12411 df-n0 12612 df-z 12699 df-uz 12971 df-rp 13126 df-seq 14150 df-exp 14210 df-cj 15273 df-re 15274 df-im 15275 df-sqrt 15409 df-abs 15410 df-constr 34410 |
| This theorem is used by: constrmulcl 34451 |
| Copyright terms: Public domain | W3C validator |