| Mathbox for Jim Kingdon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > redcwlpo | GIF version | ||
| Description: Decidability of real
number equality implies the Weak Limited Principle
of Omniscience (WLPO). We expect that we'd need some form of countable
choice to prove the converse.
Here's the outline of the proof. Given an infinite sequence F of zeroes and ones, we need to show the sequence is all ones or it is not. Construct a real number A whose representation in base two consists of a zero, a decimal point, and then the numbers of the sequence. This real number will equal one if and only if the sequence is all ones (redcwlpolemeq1 16679). Therefore decidability of real number equality would imply decidability of whether the sequence is all ones. Because of this theorem, decidability of real number equality is sometimes called "analytic WLPO". WLPO is known to not be provable in IZF (and most constructive foundations), so this theorem establishes that we will be unable to prove an analogue to qdceq 10505 for real numbers. (Contributed by Jim Kingdon, 20-Jun-2024.) |
| Ref | Expression |
|---|---|
| redcwlpo | ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 → ω ∈ WOmni) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . . . . 6 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦) | |
| 2 | elmapi 6839 | . . . . . . . . 9 ⊢ (𝑓 ∈ ({0, 1} ↑𝑚 ℕ) → 𝑓:ℕ⟶{0, 1}) | |
| 3 | 2 | adantl 277 | . . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → 𝑓:ℕ⟶{0, 1}) |
| 4 | oveq2 6026 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝑗 → (2↑𝑖) = (2↑𝑗)) | |
| 5 | 4 | oveq2d 6034 | . . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (1 / (2↑𝑖)) = (1 / (2↑𝑗))) |
| 6 | fveq2 5639 | . . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (𝑓‘𝑖) = (𝑓‘𝑗)) | |
| 7 | 5, 6 | oveq12d 6036 | . . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = ((1 / (2↑𝑗)) · (𝑓‘𝑗))) |
| 8 | 7 | cbvsumv 11923 | . . . . . . . 8 ⊢ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = Σ𝑗 ∈ ℕ ((1 / (2↑𝑗)) · (𝑓‘𝑗)) |
| 9 | 3, 8 | trilpolemcl 16662 | . . . . . . 7 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) ∈ ℝ) |
| 10 | 1red 8194 | . . . . . . 7 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → 1 ∈ ℝ) | |
| 11 | eqeq1 2238 | . . . . . . . . 9 ⊢ (𝑥 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) → (𝑥 = 𝑦 ↔ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦)) | |
| 12 | 11 | dcbid 845 | . . . . . . . 8 ⊢ (𝑥 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) → (DECID 𝑥 = 𝑦 ↔ DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦)) |
| 13 | eqeq2 2241 | . . . . . . . . 9 ⊢ (𝑦 = 1 → (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦 ↔ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1)) | |
| 14 | 13 | dcbid 845 | . . . . . . . 8 ⊢ (𝑦 = 1 → (DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦 ↔ DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1)) |
| 15 | 12, 14 | rspc2v 2923 | . . . . . . 7 ⊢ ((Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) ∈ ℝ ∧ 1 ∈ ℝ) → (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 → DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1)) |
| 16 | 9, 10, 15 | syl2anc 411 | . . . . . 6 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 → DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1)) |
| 17 | 1, 16 | mpd 13 | . . . . 5 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1) |
| 18 | 3, 8 | redcwlpolemeq1 16679 | . . . . . 6 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1 ↔ ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1)) |
| 19 | 18 | dcbid 845 | . . . . 5 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → (DECID Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1 ↔ DECID ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1)) |
| 20 | 17, 19 | mpbid 147 | . . . 4 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → DECID ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1) |
| 21 | 20 | ralrimiva 2605 | . . 3 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 → ∀𝑓 ∈ ({0, 1} ↑𝑚 ℕ)DECID ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1) |
| 22 | nnex 9149 | . . . 4 ⊢ ℕ ∈ V | |
| 23 | iswomninn 16675 | . . . 4 ⊢ (ℕ ∈ V → (ℕ ∈ WOmni ↔ ∀𝑓 ∈ ({0, 1} ↑𝑚 ℕ)DECID ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1)) | |
| 24 | 22, 23 | ax-mp 5 | . . 3 ⊢ (ℕ ∈ WOmni ↔ ∀𝑓 ∈ ({0, 1} ↑𝑚 ℕ)DECID ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1) |
| 25 | 21, 24 | sylibr 134 | . 2 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 → ℕ ∈ WOmni) |
| 26 | nnenom 10697 | . . 3 ⊢ ℕ ≈ ω | |
| 27 | enwomni 7369 | . . 3 ⊢ (ℕ ≈ ω → (ℕ ∈ WOmni ↔ ω ∈ WOmni)) | |
| 28 | 26, 27 | ax-mp 5 | . 2 ⊢ (ℕ ∈ WOmni ↔ ω ∈ WOmni) |
| 29 | 25, 28 | sylib 122 | 1 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ DECID 𝑥 = 𝑦 → ω ∈ WOmni) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 841 = wceq 1397 ∈ wcel 2202 ∀wral 2510 Vcvv 2802 {cpr 3670 class class class wbr 4088 ωcom 4688 ⟶wf 5322 ‘cfv 5326 (class class class)co 6018 ↑𝑚 cmap 6817 ≈ cen 6907 WOmnicwomni 7362 ℝcr 8031 0cc0 8032 1c1 8033 · cmul 8037 / cdiv 8852 ℕcn 9143 2c2 9194 ↑cexp 10801 Σcsu 11915 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 ax-caucvg 8152 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-isom 5335 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-irdg 6536 df-frec 6557 df-1o 6582 df-2o 6583 df-oadd 6586 df-er 6702 df-map 6819 df-en 6910 df-dom 6911 df-fin 6912 df-womni 7363 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-q 9854 df-rp 9889 df-ico 10129 df-fz 10244 df-fzo 10378 df-seqfrec 10711 df-exp 10802 df-ihash 11039 df-cj 11404 df-re 11405 df-im 11406 df-rsqrt 11560 df-abs 11561 df-clim 11841 df-sumdc 11916 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |