![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > constr01 | Structured version Visualization version GIF version |
Description: 0 and 1 are in all steps of the construction of constructible points. (Contributed by Thierry Arnoux, 25-Jun-2025.) |
Ref | Expression |
---|---|
constr0.1 | ⊢ 𝐶 = rec((𝑠 ∈ V ↦ {𝑥 ∈ ℂ ∣ (∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑥 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 ∃𝑡 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑥 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 (𝑎 ≠ 𝑑 ∧ (abs‘(𝑥 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑥 − 𝑑)) = (abs‘(𝑒 − 𝑓))))}), {0, 1}) |
constrsscn.1 | ⊢ (𝜑 → 𝑁 ∈ On) |
Ref | Expression |
---|---|
constr01 | ⊢ (𝜑 → {0, 1} ⊆ (𝐶‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | constrsscn.1 | . 2 ⊢ (𝜑 → 𝑁 ∈ On) | |
2 | fveq2 6919 | . . . 4 ⊢ (𝑚 = ∅ → (𝐶‘𝑚) = (𝐶‘∅)) | |
3 | 2 | sseq2d 4035 | . . 3 ⊢ (𝑚 = ∅ → ({0, 1} ⊆ (𝐶‘𝑚) ↔ {0, 1} ⊆ (𝐶‘∅))) |
4 | fveq2 6919 | . . . 4 ⊢ (𝑚 = 𝑛 → (𝐶‘𝑚) = (𝐶‘𝑛)) | |
5 | 4 | sseq2d 4035 | . . 3 ⊢ (𝑚 = 𝑛 → ({0, 1} ⊆ (𝐶‘𝑚) ↔ {0, 1} ⊆ (𝐶‘𝑛))) |
6 | fveq2 6919 | . . . 4 ⊢ (𝑚 = suc 𝑛 → (𝐶‘𝑚) = (𝐶‘suc 𝑛)) | |
7 | 6 | sseq2d 4035 | . . 3 ⊢ (𝑚 = suc 𝑛 → ({0, 1} ⊆ (𝐶‘𝑚) ↔ {0, 1} ⊆ (𝐶‘suc 𝑛))) |
8 | fveq2 6919 | . . . 4 ⊢ (𝑚 = 𝑁 → (𝐶‘𝑚) = (𝐶‘𝑁)) | |
9 | 8 | sseq2d 4035 | . . 3 ⊢ (𝑚 = 𝑁 → ({0, 1} ⊆ (𝐶‘𝑚) ↔ {0, 1} ⊆ (𝐶‘𝑁))) |
10 | constr0.1 | . . . . 5 ⊢ 𝐶 = rec((𝑠 ∈ V ↦ {𝑥 ∈ ℂ ∣ (∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑡 ∈ ℝ ∃𝑟 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ 𝑥 = (𝑐 + (𝑟 · (𝑑 − 𝑐))) ∧ (ℑ‘((∗‘(𝑏 − 𝑎)) · (𝑑 − 𝑐))) ≠ 0) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 ∃𝑡 ∈ ℝ (𝑥 = (𝑎 + (𝑡 · (𝑏 − 𝑎))) ∧ (abs‘(𝑥 − 𝑐)) = (abs‘(𝑒 − 𝑓))) ∨ ∃𝑎 ∈ 𝑠 ∃𝑏 ∈ 𝑠 ∃𝑐 ∈ 𝑠 ∃𝑑 ∈ 𝑠 ∃𝑒 ∈ 𝑠 ∃𝑓 ∈ 𝑠 (𝑎 ≠ 𝑑 ∧ (abs‘(𝑥 − 𝑎)) = (abs‘(𝑏 − 𝑐)) ∧ (abs‘(𝑥 − 𝑑)) = (abs‘(𝑒 − 𝑓))))}), {0, 1}) | |
11 | 10 | constr0 33719 | . . . 4 ⊢ (𝐶‘∅) = {0, 1} |
12 | 11 | eqimss2i 4064 | . . 3 ⊢ {0, 1} ⊆ (𝐶‘∅) |
13 | simpr 484 | . . . . 5 ⊢ ((𝑛 ∈ On ∧ {0, 1} ⊆ (𝐶‘𝑛)) → {0, 1} ⊆ (𝐶‘𝑛)) | |
14 | simpl 482 | . . . . . 6 ⊢ ((𝑛 ∈ On ∧ {0, 1} ⊆ (𝐶‘𝑛)) → 𝑛 ∈ On) | |
15 | c0ex 11280 | . . . . . . . . 9 ⊢ 0 ∈ V | |
16 | 15 | prid1 4787 | . . . . . . . 8 ⊢ 0 ∈ {0, 1} |
17 | 16 | a1i 11 | . . . . . . 7 ⊢ ((𝑛 ∈ On ∧ {0, 1} ⊆ (𝐶‘𝑛)) → 0 ∈ {0, 1}) |
18 | 13, 17 | sseldd 4003 | . . . . . 6 ⊢ ((𝑛 ∈ On ∧ {0, 1} ⊆ (𝐶‘𝑛)) → 0 ∈ (𝐶‘𝑛)) |
19 | 10, 14, 18 | constrsslem 33723 | . . . . 5 ⊢ ((𝑛 ∈ On ∧ {0, 1} ⊆ (𝐶‘𝑛)) → (𝐶‘𝑛) ⊆ (𝐶‘suc 𝑛)) |
20 | 13, 19 | sstrd 4013 | . . . 4 ⊢ ((𝑛 ∈ On ∧ {0, 1} ⊆ (𝐶‘𝑛)) → {0, 1} ⊆ (𝐶‘suc 𝑛)) |
21 | 20 | ex 412 | . . 3 ⊢ (𝑛 ∈ On → ({0, 1} ⊆ (𝐶‘𝑛) → {0, 1} ⊆ (𝐶‘suc 𝑛))) |
22 | 0ellim 6457 | . . . . . 6 ⊢ (Lim 𝑚 → ∅ ∈ 𝑚) | |
23 | fveq2 6919 | . . . . . . . 8 ⊢ (𝑜 = ∅ → (𝐶‘𝑜) = (𝐶‘∅)) | |
24 | 23, 11 | eqtrdi 2790 | . . . . . . 7 ⊢ (𝑜 = ∅ → (𝐶‘𝑜) = {0, 1}) |
25 | 24 | ssiun2s 5074 | . . . . . 6 ⊢ (∅ ∈ 𝑚 → {0, 1} ⊆ ∪ 𝑜 ∈ 𝑚 (𝐶‘𝑜)) |
26 | 22, 25 | syl 17 | . . . . 5 ⊢ (Lim 𝑚 → {0, 1} ⊆ ∪ 𝑜 ∈ 𝑚 (𝐶‘𝑜)) |
27 | vex 3486 | . . . . . . 7 ⊢ 𝑚 ∈ V | |
28 | 27 | a1i 11 | . . . . . 6 ⊢ (Lim 𝑚 → 𝑚 ∈ V) |
29 | id 22 | . . . . . 6 ⊢ (Lim 𝑚 → Lim 𝑚) | |
30 | 10, 28, 29 | constrlim 33721 | . . . . 5 ⊢ (Lim 𝑚 → (𝐶‘𝑚) = ∪ 𝑜 ∈ 𝑚 (𝐶‘𝑜)) |
31 | 26, 30 | sseqtrrd 4044 | . . . 4 ⊢ (Lim 𝑚 → {0, 1} ⊆ (𝐶‘𝑚)) |
32 | 31 | a1d 25 | . . 3 ⊢ (Lim 𝑚 → (∀𝑛 ∈ 𝑚 {0, 1} ⊆ (𝐶‘𝑛) → {0, 1} ⊆ (𝐶‘𝑚))) |
33 | 3, 5, 7, 9, 12, 21, 32 | tfinds 7893 | . 2 ⊢ (𝑁 ∈ On → {0, 1} ⊆ (𝐶‘𝑁)) |
34 | 1, 33 | syl 17 | 1 ⊢ (𝜑 → {0, 1} ⊆ (𝐶‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∨ w3o 1086 ∧ w3a 1087 = wceq 1537 ∈ wcel 2103 ≠ wne 2942 ∀wral 3063 ∃wrex 3072 {crab 3438 Vcvv 3482 ⊆ wss 3970 ∅c0 4347 {cpr 4650 ∪ ciun 5019 ↦ cmpt 5252 Oncon0 6394 Lim wlim 6395 suc csuc 6396 ‘cfv 6572 (class class class)co 7445 reccrdg 8461 ℂcc 11178 ℝcr 11179 0cc0 11180 1c1 11181 + caddc 11183 · cmul 11185 − cmin 11516 ∗ccj 15141 ℑcim 15143 abscabs 15279 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2105 ax-9 2113 ax-10 2136 ax-11 2153 ax-12 2173 ax-ext 2705 ax-rep 5306 ax-sep 5320 ax-nul 5327 ax-pow 5386 ax-pr 5450 ax-un 7766 ax-cnex 11236 ax-resscn 11237 ax-1cn 11238 ax-icn 11239 ax-addcl 11240 ax-addrcl 11241 ax-mulcl 11242 ax-mulrcl 11243 ax-mulcom 11244 ax-addass 11245 ax-mulass 11246 ax-distr 11247 ax-i2m1 11248 ax-1ne0 11249 ax-1rid 11250 ax-rnegex 11251 ax-rrecex 11252 ax-cnre 11253 ax-pre-lttri 11254 ax-pre-lttrn 11255 ax-pre-ltadd 11256 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2890 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-reu 3384 df-rab 3439 df-v 3484 df-sbc 3799 df-csb 3916 df-dif 3973 df-un 3975 df-in 3977 df-ss 3987 df-pss 3990 df-nul 4348 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5021 df-br 5170 df-opab 5232 df-mpt 5253 df-tr 5287 df-id 5597 df-eprel 5603 df-po 5611 df-so 5612 df-fr 5654 df-we 5656 df-xp 5705 df-rel 5706 df-cnv 5707 df-co 5708 df-dm 5709 df-rn 5710 df-res 5711 df-ima 5712 df-pred 6331 df-ord 6397 df-on 6398 df-lim 6399 df-suc 6400 df-iota 6524 df-fun 6574 df-fn 6575 df-f 6576 df-f1 6577 df-fo 6578 df-f1o 6579 df-fv 6580 df-riota 7401 df-ov 7448 df-oprab 7449 df-mpo 7450 df-om 7900 df-2nd 8027 df-frecs 8318 df-wrecs 8349 df-recs 8423 df-rdg 8462 df-er 8759 df-en 9000 df-dom 9001 df-sdom 9002 df-pnf 11322 df-mnf 11323 df-ltxr 11325 df-sub 11518 |
This theorem is referenced by: constrss 33725 constrelextdg2 33729 |
Copyright terms: Public domain | W3C validator |