ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nninfinfwlpo GIF version

Theorem nninfinfwlpo 7370
Description: The point at infinity in being isolated is equivalent to the Weak Limited Principle of Omniscience (WLPO). By isolated, we mean that the equality of that point with every other element of is decidable. From an online post by Martin Escardo. By contrast, elements of corresponding to natural numbers are isolated (nninfisol 7323). (Contributed by Jim Kingdon, 25-Nov-2025.)
Assertion
Ref Expression
nninfinfwlpo (∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ↔ ω ∈ WOmni)
Distinct variable group:   𝑥,𝑖

Proof of Theorem nninfinfwlpo
Dummy variables 𝑓 𝑘 𝑛 𝑧 𝑗 𝑞 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elmapi 6834 . . . . . 6 (𝑓 ∈ (2o𝑚 ω) → 𝑓:ω⟶2o)
21adantl 277 . . . . 5 ((∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ∧ 𝑓 ∈ (2o𝑚 ω)) → 𝑓:ω⟶2o)
3 fveqeq2 5644 . . . . . . . . 9 (𝑞 = 𝑧 → ((𝑓𝑞) = ∅ ↔ (𝑓𝑧) = ∅))
43cbvrexv 2766 . . . . . . . 8 (∃𝑞 ∈ suc 𝑗(𝑓𝑞) = ∅ ↔ ∃𝑧 ∈ suc 𝑗(𝑓𝑧) = ∅)
5 suceq 4497 . . . . . . . . 9 (𝑗 = 𝑘 → suc 𝑗 = suc 𝑘)
65rexeqdv 2735 . . . . . . . 8 (𝑗 = 𝑘 → (∃𝑧 ∈ suc 𝑗(𝑓𝑧) = ∅ ↔ ∃𝑧 ∈ suc 𝑘(𝑓𝑧) = ∅))
74, 6bitrid 192 . . . . . . 7 (𝑗 = 𝑘 → (∃𝑞 ∈ suc 𝑗(𝑓𝑞) = ∅ ↔ ∃𝑧 ∈ suc 𝑘(𝑓𝑧) = ∅))
87ifbid 3625 . . . . . 6 (𝑗 = 𝑘 → if(∃𝑞 ∈ suc 𝑗(𝑓𝑞) = ∅, ∅, 1o) = if(∃𝑧 ∈ suc 𝑘(𝑓𝑧) = ∅, ∅, 1o))
98cbvmptv 4183 . . . . 5 (𝑗 ∈ ω ↦ if(∃𝑞 ∈ suc 𝑗(𝑓𝑞) = ∅, ∅, 1o)) = (𝑘 ∈ ω ↦ if(∃𝑧 ∈ suc 𝑘(𝑓𝑧) = ∅, ∅, 1o))
10 simpl 109 . . . . . 6 ((∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ∧ 𝑓 ∈ (2o𝑚 ω)) → ∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o))
11 id 19 . . . . . . . . 9 (𝑥 = 𝑧𝑥 = 𝑧)
12 eqidd 2230 . . . . . . . . . . 11 (𝑖 = 𝑘 → 1o = 1o)
1312cbvmptv 4183 . . . . . . . . . 10 (𝑖 ∈ ω ↦ 1o) = (𝑘 ∈ ω ↦ 1o)
1413a1i 9 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑖 ∈ ω ↦ 1o) = (𝑘 ∈ ω ↦ 1o))
1511, 14eqeq12d 2244 . . . . . . . 8 (𝑥 = 𝑧 → (𝑥 = (𝑖 ∈ ω ↦ 1o) ↔ 𝑧 = (𝑘 ∈ ω ↦ 1o)))
1615dcbid 843 . . . . . . 7 (𝑥 = 𝑧 → (DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ↔ DECID 𝑧 = (𝑘 ∈ ω ↦ 1o)))
1716cbvralv 2765 . . . . . 6 (∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ↔ ∀𝑧 ∈ ℕ DECID 𝑧 = (𝑘 ∈ ω ↦ 1o))
1810, 17sylib 122 . . . . 5 ((∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ∧ 𝑓 ∈ (2o𝑚 ω)) → ∀𝑧 ∈ ℕ DECID 𝑧 = (𝑘 ∈ ω ↦ 1o))
192, 9, 18nninfinfwlpolem 7368 . . . 4 ((∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ∧ 𝑓 ∈ (2o𝑚 ω)) → DECID𝑛 ∈ ω (𝑓𝑛) = 1o)
2019ralrimiva 2603 . . 3 (∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) → ∀𝑓 ∈ (2o𝑚 ω)DECID𝑛 ∈ ω (𝑓𝑛) = 1o)
21 omex 4689 . . . 4 ω ∈ V
22 iswomnimap 7356 . . . 4 (ω ∈ V → (ω ∈ WOmni ↔ ∀𝑓 ∈ (2o𝑚 ω)DECID𝑛 ∈ ω (𝑓𝑛) = 1o))
2321, 22ax-mp 5 . . 3 (ω ∈ WOmni ↔ ∀𝑓 ∈ (2o𝑚 ω)DECID𝑛 ∈ ω (𝑓𝑛) = 1o)
2420, 23sylibr 134 . 2 (∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) → ω ∈ WOmni)
25 simpl 109 . . . 4 ((ω ∈ WOmni ∧ 𝑥 ∈ ℕ) → ω ∈ WOmni)
26 simpr 110 . . . 4 ((ω ∈ WOmni ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℕ)
2725, 26nninfdcinf 7361 . . 3 ((ω ∈ WOmni ∧ 𝑥 ∈ ℕ) → DECID 𝑥 = (𝑖 ∈ ω ↦ 1o))
2827ralrimiva 2603 . 2 (ω ∈ WOmni → ∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o))
2924, 28impbii 126 1 (∀𝑥 ∈ ℕ DECID 𝑥 = (𝑖 ∈ ω ↦ 1o) ↔ ω ∈ WOmni)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105  DECID wdc 839   = wceq 1395  wcel 2200  wral 2508  wrex 2509  Vcvv 2800  c0 3492  ifcif 3603  cmpt 4148  suc csuc 4460  ωcom 4686  wf 5320  cfv 5324  (class class class)co 6013  1oc1o 6570  2oc2o 6571  𝑚 cmap 6812  xnninf 7309  WOmnicwomni 7353
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1o 6577  df-2o 6578  df-er 6697  df-map 6814  df-en 6905  df-fin 6907  df-nninf 7310  df-womni 7354
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator