Theorem trilpo 14830

Description: Real number trichotomy implies the Limited Principle of Omniscience (LPO). 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 contains a zero or it is all ones. Construct a real number A whose representation in base two consists of a zero, a decimal point, and then the numbers of the sequence. Compare it with one using trichotomy. The three cases from trichotomy are trilpolemlt1 14828 (which means the sequence contains a zero), trilpolemeq1 14827 (which means the sequence is all ones), and trilpolemgt1 14826 (which is not possible).

Equivalent ways to state real number trichotomy (sometimes called "analytic LPO") include decidability of real number apartness (see triap 14816) or that the real numbers are a discrete field (see trirec0 14831).

LPO 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 qtri3or 10245 for real numbers. (Contributed by Jim Kingdon, 23-Aug-2023.)

Assertion

Ref	Expression
trilpo	⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ω ∈ Omni)

Distinct variable group:   𝑥,𝑦

Proof of Theorem trilpo

Dummy variables 𝑓 𝑖 𝑗 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elmapi 6672	. . . . . 6 ⊢ (𝑓 ∈ ({0, 1} ↑𝑚 ℕ) → 𝑓:ℕ⟶{0, 1})
2	1	adantl 277	. . . . 5 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → 𝑓:ℕ⟶{0, 1})
3		oveq2 5885	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (2↑𝑖) = (2↑𝑗))
4	3	oveq2d 5893	. . . . . . 7 ⊢ (𝑖 = 𝑗 → (1 / (2↑𝑖)) = (1 / (2↑𝑗)))
5		fveq2 5517	. . . . . . 7 ⊢ (𝑖 = 𝑗 → (𝑓‘𝑖) = (𝑓‘𝑗))
6	4, 5	oveq12d 5895	. . . . . 6 ⊢ (𝑖 = 𝑗 → ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = ((1 / (2↑𝑗)) · (𝑓‘𝑗)))
7	6	cbvsumv 11371	. . . . 5 ⊢ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = Σ𝑗 ∈ ℕ ((1 / (2↑𝑗)) · (𝑓‘𝑗))
8	2, 7	trilpolemcl 14824	. . . . . 6 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) ∈ ℝ)
9		1red 7974	. . . . . 6 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → 1 ∈ ℝ)
10		simpl 109	. . . . . 6 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥))
11		breq1 4008	. . . . . . . 8 ⊢ (𝑥 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) → (𝑥 < 𝑦 ↔ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 𝑦))
12		eqeq1 2184	. . . . . . . 8 ⊢ (𝑥 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) → (𝑥 = 𝑦 ↔ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦))
13		breq2 4009	. . . . . . . 8 ⊢ (𝑥 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) → (𝑦 < 𝑥 ↔ 𝑦 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖))))
14	11, 12, 13	3orbi123d 1311	. . . . . . 7 ⊢ (𝑥 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) → ((𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ↔ (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 𝑦 ∨ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦 ∨ 𝑦 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)))))
15		breq2 4009	. . . . . . . 8 ⊢ (𝑦 = 1 → (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 𝑦 ↔ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 1))
16		eqeq2 2187	. . . . . . . 8 ⊢ (𝑦 = 1 → (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦 ↔ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1))
17		breq1 4008	. . . . . . . 8 ⊢ (𝑦 = 1 → (𝑦 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) ↔ 1 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖))))
18	15, 16, 17	3orbi123d 1311	. . . . . . 7 ⊢ (𝑦 = 1 → ((Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 𝑦 ∨ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 𝑦 ∨ 𝑦 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖))) ↔ (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 1 ∨ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1 ∨ 1 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)))))
19	14, 18	rspc2va 2857	. . . . . 6 ⊢ (((Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) ∈ ℝ ∧ 1 ∈ ℝ) ∧ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥)) → (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 1 ∨ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1 ∨ 1 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖))))
20	8, 9, 10, 19	syl21anc 1237	. . . . 5 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → (Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) < 1 ∨ Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖)) = 1 ∨ 1 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝑓‘𝑖))))
21	2, 7, 20	trilpolemres 14829	. . . 4 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) ∧ 𝑓 ∈ ({0, 1} ↑𝑚 ℕ)) → (∃𝑧 ∈ ℕ (𝑓‘𝑧) = 0 ∨ ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1))
22	21	ralrimiva 2550	. . 3 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ∀𝑓 ∈ ({0, 1} ↑𝑚 ℕ)(∃𝑧 ∈ ℕ (𝑓‘𝑧) = 0 ∨ ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1))
23		nnex 8927	. . . 4 ⊢ ℕ ∈ V
24		isomninn 14818	. . . 4 ⊢ (ℕ ∈ V → (ℕ ∈ Omni ↔ ∀𝑓 ∈ ({0, 1} ↑𝑚 ℕ)(∃𝑧 ∈ ℕ (𝑓‘𝑧) = 0 ∨ ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1)))
25	23, 24	ax-mp 5	. . 3 ⊢ (ℕ ∈ Omni ↔ ∀𝑓 ∈ ({0, 1} ↑𝑚 ℕ)(∃𝑧 ∈ ℕ (𝑓‘𝑧) = 0 ∨ ∀𝑧 ∈ ℕ (𝑓‘𝑧) = 1))
26	22, 25	sylibr 134	. 2 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ℕ ∈ Omni)
27		nnenom 10436	. . 3 ⊢ ℕ ≈ ω
28		enomni 7139	. . 3 ⊢ (ℕ ≈ ω → (ℕ ∈ Omni ↔ ω ∈ Omni))
29	27, 28	ax-mp 5	. 2 ⊢ (ℕ ∈ Omni ↔ ω ∈ Omni)
30	26, 29	sylib 122	1 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 < 𝑥) → ω ∈ Omni)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 708   ∨ w3o 977   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  Vcvv 2739  {cpr 3595   class class class wbr 4005  ωcom 4591  ⟶wf 5214  ‘cfv 5218  (class class class)co 5877   ↑_𝑚 cmap 6650   ≈ cen 6740  Omnicomni 7134  ℝcr 7812  0cc0 7813  1c1 7814   · cmul 7818   < clt 7994   / cdiv 8631  ℕcn 8921  2c2 8972  ↑cexp 10521  Σcsu 11363

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931  ax-arch 7932  ax-caucvg 7933

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-if 3537  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-po 4298  df-iso 4299  df-iord 4368  df-on 4370  df-ilim 4371  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-isom 5227  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-irdg 6373  df-frec 6394  df-1o 6419  df-2o 6420  df-oadd 6423  df-er 6537  df-map 6652  df-en 6743  df-dom 6744  df-fin 6745  df-omni 7135  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-div 8632  df-inn 8922  df-2 8980  df-3 8981  df-4 8982  df-n0 9179  df-z 9256  df-uz 9531  df-q 9622  df-rp 9656  df-ico 9896  df-fz 10011  df-fzo 10145  df-seqfrec 10448  df-exp 10522  df-ihash 10758  df-cj 10853  df-re 10854  df-im 10855  df-rsqrt 11009  df-abs 11010  df-clim 11289  df-sumdc 11364

This theorem is referenced by: (None)