| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > constrdircl | Structured version Visualization version GIF version | ||
| Description: Constructible numbers are closed under taking the point on the unit circle having the same argument. (Contributed by Thierry Arnoux, 2-Nov-2025.) |
| Ref | Expression |
|---|---|
| constrdircl.x | ⊢ (𝜑 → 𝑋 ∈ Constr) |
| constrdircl.1 | ⊢ (𝜑 → 𝑋 ≠ 0) |
| Ref | Expression |
|---|---|
| constrdircl | ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ Constr) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0nn0 12625 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ ℕ0) |
| 3 | 2 | nn0constr 34440 | . 2 ⊢ (𝜑 → 0 ∈ Constr) |
| 4 | constrdircl.x | . 2 ⊢ (𝜑 → 𝑋 ∈ Constr) | |
| 5 | 1nn0 12626 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 1 ∈ ℕ0) |
| 7 | 6 | nn0constr 34440 | . 2 ⊢ (𝜑 → 1 ∈ Constr) |
| 8 | 4 | constrcn 34439 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ ℂ) |
| 9 | 8 | abscld 15612 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℝ) |
| 10 | constrdircl.1 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
| 11 | 8, 10 | absne0d 15623 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ≠ 0) |
| 12 | 9, 11 | rereccld 12148 | . 2 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℝ) |
| 13 | 9 | recnd 11341 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℂ) |
| 14 | 8, 13, 11 | divcld 12097 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ ℂ) |
| 15 | 8 | subid1d 11662 | . . . 4 ⊢ (𝜑 → (𝑋 − 0) = 𝑋) |
| 16 | 15 | oveq2d 7437 | . . 3 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 17 | 12 | recnd 11341 | . . . . 5 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℂ) |
| 18 | 15, 8 | eqeltrd 2860 | . . . . 5 ⊢ (𝜑 → (𝑋 − 0) ∈ ℂ) |
| 19 | 17, 18 | mulcld 11333 | . . . 4 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) ∈ ℂ) |
| 20 | 19 | addlidd 11515 | . . 3 ⊢ (𝜑 → (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0))) = ((1 / (abs‘𝑋)) · (𝑋 − 0))) |
| 21 | 8, 13, 11 | divrec2d 12101 | . . 3 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 22 | 16, 20, 21 | 3eqtr4rd 2806 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0)))) |
| 23 | 1red 11313 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 24 | 6 | nn0ge0d 12674 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 25 | 23, 24 | absidd 15596 | . . 3 ⊢ (𝜑 → (abs‘1) = 1) |
| 26 | 1m0e1 12466 | . . . . 5 ⊢ (1 − 0) = 1 | |
| 27 | 26 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 − 0) = 1) |
| 28 | 27 | fveq2d 6890 | . . 3 ⊢ (𝜑 → (abs‘(1 − 0)) = (abs‘1)) |
| 29 | 14 | subid1d 11662 | . . . . 5 ⊢ (𝜑 → ((𝑋 / (abs‘𝑋)) − 0) = (𝑋 / (abs‘𝑋))) |
| 30 | 29 | fveq2d 6890 | . . . 4 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(𝑋 / (abs‘𝑋)))) |
| 31 | 8, 13, 11 | absdivd 15631 | . . . 4 ⊢ (𝜑 → (abs‘(𝑋 / (abs‘𝑋))) = ((abs‘𝑋) / (abs‘(abs‘𝑋)))) |
| 32 | absidm 15497 | . . . . . . 7 ⊢ (𝑋 ∈ ℂ → (abs‘(abs‘𝑋)) = (abs‘𝑋)) | |
| 33 | 8, 32 | syl 18 | . . . . . 6 ⊢ (𝜑 → (abs‘(abs‘𝑋)) = (abs‘𝑋)) |
| 34 | 33 | oveq2d 7437 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = ((abs‘𝑋) / (abs‘𝑋))) |
| 35 | 13, 11 | dividd 12095 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘𝑋)) = 1) |
| 36 | 34, 35 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = 1) |
| 37 | 30, 31, 36 | 3eqtrd 2799 | . . 3 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = 1) |
| 38 | 25, 28, 37 | 3eqtr4rd 2806 | . 2 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(1 − 0))) |
| 39 | 3, 4, 3, 7, 3, 12, 14, 22, 38 | constrlccl 34436 | 1 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ Constr) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ‘cfv 6539 (class class class)co 7421 ℂcc 11202 0cc0 11204 1c1 11205 + caddc 11207 · cmul 11209 − cmin 11545 / cdiv 11977 ℕ0cn0 12610 abscabs 15407 Constrcconstr 34408 |
| 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 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 ax-pre-sup 11282 |
| 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 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 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 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-2o 8481 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-sup 9438 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-div 11978 df-nn 12340 df-2 12409 df-3 12410 df-n0 12611 df-z 12698 df-uz 12970 df-rp 13125 df-seq 14149 df-exp 14209 df-cj 15272 df-re 15273 df-im 15274 df-sqrt 15408 df-abs 15409 df-constr 34409 |
| This theorem is used by: iconstr 34445 constrinvcl 34452 constrsqrtcl 34458 |
| Copyright terms: Public domain | W3C validator |