| 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 12614 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ ℕ0) |
| 3 | 2 | nn0constr 34386 | . 2 ⊢ (𝜑 → 0 ∈ Constr) |
| 4 | constrdircl.x | . 2 ⊢ (𝜑 → 𝑋 ∈ Constr) | |
| 5 | 1nn0 12615 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 1 ∈ ℕ0) |
| 7 | 6 | nn0constr 34386 | . 2 ⊢ (𝜑 → 1 ∈ Constr) |
| 8 | 4 | constrcn 34385 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ ℂ) |
| 9 | 8 | abscld 15599 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℝ) |
| 10 | constrdircl.1 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
| 11 | 8, 10 | absne0d 15610 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ≠ 0) |
| 12 | 9, 11 | rereccld 12137 | . 2 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℝ) |
| 13 | 9 | recnd 11330 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℂ) |
| 14 | 8, 13, 11 | divcld 12086 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ ℂ) |
| 15 | 8 | subid1d 11651 | . . . 4 ⊢ (𝜑 → (𝑋 − 0) = 𝑋) |
| 16 | 15 | oveq2d 7434 | . . 3 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 17 | 12 | recnd 11330 | . . . . 5 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℂ) |
| 18 | 15, 8 | eqeltrd 2861 | . . . . 5 ⊢ (𝜑 → (𝑋 − 0) ∈ ℂ) |
| 19 | 17, 18 | mulcld 11322 | . . . 4 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) ∈ ℂ) |
| 20 | 19 | addlidd 11504 | . . 3 ⊢ (𝜑 → (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0))) = ((1 / (abs‘𝑋)) · (𝑋 − 0))) |
| 21 | 8, 13, 11 | divrec2d 12090 | . . 3 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 22 | 16, 20, 21 | 3eqtr4rd 2807 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0)))) |
| 23 | 1red 11302 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 24 | 6 | nn0ge0d 12663 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 25 | 23, 24 | absidd 15583 | . . 3 ⊢ (𝜑 → (abs‘1) = 1) |
| 26 | 1m0e1 12455 | . . . . 5 ⊢ (1 − 0) = 1 | |
| 27 | 26 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 − 0) = 1) |
| 28 | 27 | fveq2d 6887 | . . 3 ⊢ (𝜑 → (abs‘(1 − 0)) = (abs‘1)) |
| 29 | 14 | subid1d 11651 | . . . . 5 ⊢ (𝜑 → ((𝑋 / (abs‘𝑋)) − 0) = (𝑋 / (abs‘𝑋))) |
| 30 | 29 | fveq2d 6887 | . . . 4 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(𝑋 / (abs‘𝑋)))) |
| 31 | 8, 13, 11 | absdivd 15618 | . . . 4 ⊢ (𝜑 → (abs‘(𝑋 / (abs‘𝑋))) = ((abs‘𝑋) / (abs‘(abs‘𝑋)))) |
| 32 | absidm 15484 | . . . . . . 7 ⊢ (𝑋 ∈ ℂ → (abs‘(abs‘𝑋)) = (abs‘𝑋)) | |
| 33 | 8, 32 | syl 18 | . . . . . 6 ⊢ (𝜑 → (abs‘(abs‘𝑋)) = (abs‘𝑋)) |
| 34 | 33 | oveq2d 7434 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = ((abs‘𝑋) / (abs‘𝑋))) |
| 35 | 13, 11 | dividd 12084 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘𝑋)) = 1) |
| 36 | 34, 35 | eqtrd 2796 | . . . 4 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = 1) |
| 37 | 30, 31, 36 | 3eqtrd 2800 | . . 3 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = 1) |
| 38 | 25, 28, 37 | 3eqtr4rd 2807 | . 2 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(1 − 0))) |
| 39 | 3, 4, 3, 7, 3, 12, 14, 22, 38 | constrlccl 34382 | 1 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ Constr) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ‘cfv 6537 (class class class)co 7418 ℂcc 11191 0cc0 11193 1c1 11194 + caddc 11196 · cmul 11198 − cmin 11534 / cdiv 11966 ℕ0cn0 12599 abscabs 15394 Constrcconstr 34354 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-2o 8470 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-constr 34355 |
| This theorem is used by: iconstr 34391 constrinvcl 34398 constrsqrtcl 34404 |
| Copyright terms: Public domain | W3C validator |