| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > constrllcl | Structured version Visualization version GIF version | ||
| Description: Constructible numbers are closed under line-line intersections. (Contributed by Thierry Arnoux, 2-Nov-2025.) |
| Ref | Expression |
|---|---|
| constrllcl.a | ⊢ (𝜑 → 𝐴 ∈ Constr) |
| constrllcl.b | ⊢ (𝜑 → 𝐵 ∈ Constr) |
| constrllcl.c | ⊢ (𝜑 → 𝐺 ∈ Constr) |
| constrllcl.e | ⊢ (𝜑 → 𝐷 ∈ Constr) |
| constrllcl.t | ⊢ (𝜑 → 𝑇 ∈ ℝ) |
| constrllcl.r | ⊢ (𝜑 → 𝑅 ∈ ℝ) |
| constrllcl.x | ⊢ (𝜑 → 𝑋 ∈ ℂ) |
| constrllcl.1 | ⊢ (𝜑 → 𝑋 = (𝐴 + (𝑇 · (𝐵 − 𝐴)))) |
| constrllcl.2 | ⊢ (𝜑 → 𝑋 = (𝐺 + (𝑅 · (𝐷 − 𝐺)))) |
| constrllcl.3 | ⊢ (𝜑 → (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐷 − 𝐺))) ≠ 0) |
| Ref | Expression |
|---|---|
| constrllcl | ⊢ (𝜑 → 𝑋 ∈ Constr) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | constrcbvlem 34499 | . 2 ⊢ rec((𝑧 ∈ V ↦ {𝑦 ∈ ℂ ∣ (∃𝑖 ∈ 𝑧 ∃𝑗 ∈ 𝑧 ∃𝑘 ∈ 𝑧 ∃𝑙 ∈ 𝑧 ∃𝑜 ∈ ℝ ∃𝑝 ∈ ℝ (𝑦 = (𝑖 + (𝑜 · (𝑗 − 𝑖))) ∧ 𝑦 = (𝑘 + (𝑝 · (𝑙 − 𝑘))) ∧ (ℑ‘((∗‘(𝑗 − 𝑖)) · (𝑙 − 𝑘))) ≠ 0) ∨ ∃𝑖 ∈ 𝑧 ∃𝑗 ∈ 𝑧 ∃𝑘 ∈ 𝑧 ∃𝑚 ∈ 𝑧 ∃𝑞 ∈ 𝑧 ∃𝑜 ∈ ℝ (𝑦 = (𝑖 + (𝑜 · (𝑗 − 𝑖))) ∧ (abs‘(𝑦 − 𝑘)) = (abs‘(𝑚 − 𝑞))) ∨ ∃𝑖 ∈ 𝑧 ∃𝑗 ∈ 𝑧 ∃𝑘 ∈ 𝑧 ∃𝑙 ∈ 𝑧 ∃𝑚 ∈ 𝑧 ∃𝑞 ∈ 𝑧 (𝑖 ≠ 𝑙 ∧ (abs‘(𝑦 − 𝑖)) = (abs‘(𝑗 − 𝑘)) ∧ (abs‘(𝑦 − 𝑙)) = (abs‘(𝑚 − 𝑞))))}), {0, 1}) = rec((𝑠 ∈ V ↦ {𝑥 ∈ ℂ ∣ (∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑥 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 ∃𝑡 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑥 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 (𝑎 ≠ 𝑑 ∧ (abs‘(𝑥 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑥 − 𝑑)) = (abs‘(𝑒 − 𝑓))))}), {0, 1}) | |
| 2 | constrllcl.a | . 2 ⊢ (𝜑 → 𝐴 ∈ Constr) | |
| 3 | constrllcl.b | . 2 ⊢ (𝜑 → 𝐵 ∈ Constr) | |
| 4 | constrllcl.c | . 2 ⊢ (𝜑 → 𝐺 ∈ Constr) | |
| 5 | constrllcl.e | . 2 ⊢ (𝜑 → 𝐷 ∈ Constr) | |
| 6 | constrllcl.t | . 2 ⊢ (𝜑 → 𝑇 ∈ ℝ) | |
| 7 | constrllcl.r | . 2 ⊢ (𝜑 → 𝑅 ∈ ℝ) | |
| 8 | constrllcl.x | . 2 ⊢ (𝜑 → 𝑋 ∈ ℂ) | |
| 9 | constrllcl.1 | . 2 ⊢ (𝜑 → 𝑋 = (𝐴 + (𝑇 · (𝐵 − 𝐴)))) | |
| 10 | constrllcl.2 | . 2 ⊢ (𝜑 → 𝑋 = (𝐺 + (𝑅 · (𝐷 − 𝐺)))) | |
| 11 | constrllcl.3 | . 2 ⊢ (𝜑 → (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐷 − 𝐺))) ≠ 0) | |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | constrllcllem 34496 | 1 ⊢ (𝜑 → 𝑋 ∈ Constr) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ w3o 1103 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ∃wrex 3093 {crab 3415 Vcvv 3453 {cpr 4589 ↦ cmpt 5191 ‘cfv 6565 (class class class)co 7450 reccrdg 8454 ℂcc 11236 ℝcr 11237 0cc0 11238 1c1 11239 + caddc 11241 · cmul 11243 − cmin 11579 ∗ccj 15305 ℑcim 15307 abscabs 15443 Constrcconstr 34473 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-pnf 11383 df-mnf 11384 df-ltxr 11386 df-sub 11581 df-constr 34474 |
| This theorem is used by: constrremulcl 34511 constrrecl 34513 constrreinvcl 34516 |
| Copyright terms: Public domain | W3C validator |