| 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 12543 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ ℕ0) |
| 3 | 2 | nn0constr 34271 | . 2 ⊢ (𝜑 → 0 ∈ Constr) |
| 4 | constrdircl.x | . 2 ⊢ (𝜑 → 𝑋 ∈ Constr) | |
| 5 | 1nn0 12544 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 1 ∈ ℕ0) |
| 7 | 6 | nn0constr 34271 | . 2 ⊢ (𝜑 → 1 ∈ Constr) |
| 8 | 4 | constrcn 34270 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ ℂ) |
| 9 | 8 | abscld 15526 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℝ) |
| 10 | constrdircl.1 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
| 11 | 8, 10 | absne0d 15537 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ≠ 0) |
| 12 | 9, 11 | rereccld 12066 | . 2 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℝ) |
| 13 | 9 | recnd 11261 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℂ) |
| 14 | 8, 13, 11 | divcld 12015 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ ℂ) |
| 15 | 8 | subid1d 11582 | . . . 4 ⊢ (𝜑 → (𝑋 − 0) = 𝑋) |
| 16 | 15 | oveq2d 7429 | . . 3 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 17 | 12 | recnd 11261 | . . . . 5 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℂ) |
| 18 | 15, 8 | eqeltrd 2860 | . . . . 5 ⊢ (𝜑 → (𝑋 − 0) ∈ ℂ) |
| 19 | 17, 18 | mulcld 11253 | . . . 4 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) ∈ ℂ) |
| 20 | 19 | addlidd 11435 | . . 3 ⊢ (𝜑 → (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0))) = ((1 / (abs‘𝑋)) · (𝑋 − 0))) |
| 21 | 8, 13, 11 | divrec2d 12019 | . . 3 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 22 | 16, 20, 21 | 3eqtr4rd 2806 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0)))) |
| 23 | 1red 11233 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 24 | 6 | nn0ge0d 12592 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 25 | 23, 24 | absidd 15510 | . . 3 ⊢ (𝜑 → (abs‘1) = 1) |
| 26 | 1m0e1 12384 | . . . . 5 ⊢ (1 − 0) = 1 | |
| 27 | 26 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 − 0) = 1) |
| 28 | 27 | fveq2d 6882 | . . 3 ⊢ (𝜑 → (abs‘(1 − 0)) = (abs‘1)) |
| 29 | 14 | subid1d 11582 | . . . . 5 ⊢ (𝜑 → ((𝑋 / (abs‘𝑋)) − 0) = (𝑋 / (abs‘𝑋))) |
| 30 | 29 | fveq2d 6882 | . . . 4 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(𝑋 / (abs‘𝑋)))) |
| 31 | 8, 13, 11 | absdivd 15545 | . . . 4 ⊢ (𝜑 → (abs‘(𝑋 / (abs‘𝑋))) = ((abs‘𝑋) / (abs‘(abs‘𝑋)))) |
| 32 | absidm 15411 | . . . . . . 7 ⊢ (𝑋 ∈ ℂ → (abs‘(abs‘𝑋)) = (abs‘𝑋)) | |
| 33 | 8, 32 | syl 18 | . . . . . 6 ⊢ (𝜑 → (abs‘(abs‘𝑋)) = (abs‘𝑋)) |
| 34 | 33 | oveq2d 7429 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = ((abs‘𝑋) / (abs‘𝑋))) |
| 35 | 13, 11 | dividd 12013 | . . . . 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 34267 | 1 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ Constr) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ‘cfv 6533 (class class class)co 7413 ℂcc 11122 0cc0 11124 1c1 11125 + caddc 11127 · cmul 11129 − cmin 11465 / cdiv 11895 ℕ0cn0 12528 abscabs 15321 Constrcconstr 34239 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| 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 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 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-seq 14066 df-exp 14126 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-constr 34240 |
| This theorem is used by: iconstr 34276 constrinvcl 34283 constrsqrtcl 34289 |
| Copyright terms: Public domain | W3C validator |