| 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 12530 | . . . 4 ⊢ 0 ∈ ℕ0 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝜑 → 0 ∈ ℕ0) |
| 3 | 2 | nn0constr 34174 | . 2 ⊢ (𝜑 → 0 ∈ Constr) |
| 4 | constrdircl.x | . 2 ⊢ (𝜑 → 𝑋 ∈ Constr) | |
| 5 | 1nn0 12531 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → 1 ∈ ℕ0) |
| 7 | 6 | nn0constr 34174 | . 2 ⊢ (𝜑 → 1 ∈ Constr) |
| 8 | 4 | constrcn 34173 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ ℂ) |
| 9 | 8 | abscld 15509 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℝ) |
| 10 | constrdircl.1 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 0) | |
| 11 | 8, 10 | absne0d 15520 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ≠ 0) |
| 12 | 9, 11 | rereccld 12053 | . 2 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℝ) |
| 13 | 9 | recnd 11248 | . . 3 ⊢ (𝜑 → (abs‘𝑋) ∈ ℂ) |
| 14 | 8, 13, 11 | divcld 12002 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ ℂ) |
| 15 | 8 | subid1d 11569 | . . . 4 ⊢ (𝜑 → (𝑋 − 0) = 𝑋) |
| 16 | 15 | oveq2d 7432 | . . 3 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 17 | 12 | recnd 11248 | . . . . 5 ⊢ (𝜑 → (1 / (abs‘𝑋)) ∈ ℂ) |
| 18 | 15, 8 | eqeltrd 2865 | . . . . 5 ⊢ (𝜑 → (𝑋 − 0) ∈ ℂ) |
| 19 | 17, 18 | mulcld 11240 | . . . 4 ⊢ (𝜑 → ((1 / (abs‘𝑋)) · (𝑋 − 0)) ∈ ℂ) |
| 20 | 19 | addlidd 11422 | . . 3 ⊢ (𝜑 → (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0))) = ((1 / (abs‘𝑋)) · (𝑋 − 0))) |
| 21 | 8, 13, 11 | divrec2d 12006 | . . 3 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = ((1 / (abs‘𝑋)) · 𝑋)) |
| 22 | 16, 20, 21 | 3eqtr4rd 2811 | . 2 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) = (0 + ((1 / (abs‘𝑋)) · (𝑋 − 0)))) |
| 23 | 1red 11220 | . . . 4 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 24 | 6 | nn0ge0d 12579 | . . . 4 ⊢ (𝜑 → 0 ≤ 1) |
| 25 | 23, 24 | absidd 15493 | . . 3 ⊢ (𝜑 → (abs‘1) = 1) |
| 26 | 1m0e1 12371 | . . . . 5 ⊢ (1 − 0) = 1 | |
| 27 | 26 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 − 0) = 1) |
| 28 | 27 | fveq2d 6889 | . . 3 ⊢ (𝜑 → (abs‘(1 − 0)) = (abs‘1)) |
| 29 | 14 | subid1d 11569 | . . . . 5 ⊢ (𝜑 → ((𝑋 / (abs‘𝑋)) − 0) = (𝑋 / (abs‘𝑋))) |
| 30 | 29 | fveq2d 6889 | . . . 4 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(𝑋 / (abs‘𝑋)))) |
| 31 | 8, 13, 11 | absdivd 15528 | . . . 4 ⊢ (𝜑 → (abs‘(𝑋 / (abs‘𝑋))) = ((abs‘𝑋) / (abs‘(abs‘𝑋)))) |
| 32 | absidm 15394 | . . . . . . 7 ⊢ (𝑋 ∈ ℂ → (abs‘(abs‘𝑋)) = (abs‘𝑋)) | |
| 33 | 8, 32 | syl 18 | . . . . . 6 ⊢ (𝜑 → (abs‘(abs‘𝑋)) = (abs‘𝑋)) |
| 34 | 33 | oveq2d 7432 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = ((abs‘𝑋) / (abs‘𝑋))) |
| 35 | 13, 11 | dividd 12000 | . . . . 5 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘𝑋)) = 1) |
| 36 | 34, 35 | eqtrd 2800 | . . . 4 ⊢ (𝜑 → ((abs‘𝑋) / (abs‘(abs‘𝑋))) = 1) |
| 37 | 30, 31, 36 | 3eqtrd 2804 | . . 3 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = 1) |
| 38 | 25, 28, 37 | 3eqtr4rd 2811 | . 2 ⊢ (𝜑 → (abs‘((𝑋 / (abs‘𝑋)) − 0)) = (abs‘(1 − 0))) |
| 39 | 3, 4, 3, 7, 3, 12, 14, 22, 38 | constrlccl 34170 | 1 ⊢ (𝜑 → (𝑋 / (abs‘𝑋)) ∈ Constr) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ‘cfv 6540 (class class class)co 7416 ℂcc 11109 0cc0 11111 1c1 11112 + caddc 11114 · cmul 11116 − cmin 11452 / cdiv 11882 ℕ0cn0 12515 abscabs 15304 Constrcconstr 34142 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-sup 9405 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-n0 12516 df-z 12603 df-uz 12874 df-rp 13028 df-seq 14051 df-exp 14111 df-cj 15169 df-re 15170 df-im 15171 df-sqrt 15305 df-abs 15306 df-constr 34143 |
| This theorem is used by: iconstr 34179 constrinvcl 34186 constrsqrtcl 34192 |
| Copyright terms: Public domain | W3C validator |