MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cofon2 Structured version   Visualization version   GIF version

Theorem cofon2 8719
Description: Cofinality theorem for ordinals. If 𝐴 and 𝐵 are mutually cofinal, then their upper bounds agree. Compare cofcut2 28367 for surreals. (Contributed by Scott Fenton, 20-Jan-2025.)
Hypotheses
Ref Expression
cofon2.1 (𝜑 → 𝐴 ∈ 𝒫 On)
cofon2.2 (𝜑 → 𝐵 ∈ 𝒫 On)
cofon2.3 (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
cofon2.4 (𝜑 → ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)
Assertion
Ref Expression
cofon2 (𝜑 → ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎} = ∩ {𝑏 ∈ On ∣ 𝐵 ⊆ 𝑏})
Distinct variable groups:   𝐴,𝑎,𝑏   𝑤,𝐴,𝑧   𝑥,𝐴   𝐵,𝑎,𝑏   𝑥,𝐵,𝑦   𝑧,𝐵   𝜑,𝑎,𝑏   𝑤,𝑏,𝑧   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤)   𝐴(𝑦)   𝐵(𝑤)

Proof of Theorem cofon2
Dummy variable 𝑐 is distinct from all other variables.
StepHypRef Expression
1 cofon2.1 . 2 (𝜑 → 𝐴 ∈ 𝒫 On)
2 cofon2.3 . 2 (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
3 sseq1 3937 . . . . . . . 8 (𝑧 = 𝑏 → (𝑧 ⊆ 𝑤 ↔ 𝑏 ⊆ 𝑤))
43rexbidv 3193 . . . . . . 7 (𝑧 = 𝑏 → (∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤 ↔ ∃𝑤 ∈ 𝐴 𝑏 ⊆ 𝑤))
5 cofon2.4 . . . . . . . 8 (𝜑 → ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)
65adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑏 ∈ 𝐵) → ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ 𝐴 𝑧 ⊆ 𝑤)
7 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝐵)
84, 6, 7rspcdva 3580 . . . . . 6 ((𝜑 ∧ 𝑏 ∈ 𝐵) → ∃𝑤 ∈ 𝐴 𝑏 ⊆ 𝑤)
9 sseq2 3938 . . . . . . 7 (𝑤 = 𝑐 → (𝑏 ⊆ 𝑤 ↔ 𝑏 ⊆ 𝑐))
109cbvrexvw 3245 . . . . . 6 (∃𝑤 ∈ 𝐴 𝑏 ⊆ 𝑤 ↔ ∃𝑐 ∈ 𝐴 𝑏 ⊆ 𝑐)
118, 10sylib 221 . . . . 5 ((𝜑 ∧ 𝑏 ∈ 𝐵) → ∃𝑐 ∈ 𝐴 𝑏 ⊆ 𝑐)
12 ssintub 4930 . . . . . . . . 9 𝐴 ⊆ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}
1312a1i 11 . . . . . . . 8 ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝐴 ⊆ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎})
1413sselda 3912 . . . . . . 7 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → 𝑐 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎})
15 cofon2.2 . . . . . . . . . . 11 (𝜑 → 𝐵 ∈ 𝒫 On)
1615elpwid 4568 . . . . . . . . . 10 (𝜑 → 𝐵 ⊆ On)
1716ad2antrr 739 . . . . . . . . 9 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → 𝐵 ⊆ On)
18 simplr 781 . . . . . . . . 9 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → 𝑏 ∈ 𝐵)
1917, 18sseldd 3913 . . . . . . . 8 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → 𝑏 ∈ On)
201elpwid 4568 . . . . . . . . . . . . . 14 (𝜑 → 𝐴 ⊆ On)
21 ssorduni 7826 . . . . . . . . . . . . . 14 (𝐴 ⊆ On → Ord ∪ 𝐴)
2220, 21syl 18 . . . . . . . . . . . . 13 (𝜑 → Ord ∪ 𝐴)
23 ordsuc 7858 . . . . . . . . . . . . 13 (Ord ∪ 𝐴 ↔ Ord suc ∪ 𝐴)
2422, 23sylib 221 . . . . . . . . . . . 12 (𝜑 → Ord suc ∪ 𝐴)
251uniexd 7790 . . . . . . . . . . . . 13 (𝜑 → ∪ 𝐴 ∈ V)
26 sucexg 7852 . . . . . . . . . . . . 13 (∪ 𝐴 ∈ V → suc ∪ 𝐴 ∈ V)
27 elong 6395 . . . . . . . . . . . . 13 (suc ∪ 𝐴 ∈ V → (suc ∪ 𝐴 ∈ On ↔ Ord suc ∪ 𝐴))
2825, 26, 273syl 19 . . . . . . . . . . . 12 (𝜑 → (suc ∪ 𝐴 ∈ On ↔ Ord suc ∪ 𝐴))
2924, 28mpbird 260 . . . . . . . . . . 11 (𝜑 → suc ∪ 𝐴 ∈ On)
30 onsucuni 7872 . . . . . . . . . . . 12 (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴)
3120, 30syl 18 . . . . . . . . . . 11 (𝜑 → 𝐴 ⊆ suc ∪ 𝐴)
32 sseq2 3938 . . . . . . . . . . . 12 (𝑎 = suc ∪ 𝐴 → (𝐴 ⊆ 𝑎 ↔ 𝐴 ⊆ suc ∪ 𝐴))
3332rspcev 3579 . . . . . . . . . . 11 ((suc ∪ 𝐴 ∈ On ∧ 𝐴 ⊆ suc ∪ 𝐴) → ∃𝑎 ∈ On 𝐴 ⊆ 𝑎)
3429, 31, 33syl2anc 596 . . . . . . . . . 10 (𝜑 → ∃𝑎 ∈ On 𝐴 ⊆ 𝑎)
35 onintrab2 7844 . . . . . . . . . 10 (∃𝑎 ∈ On 𝐴 ⊆ 𝑎 ↔ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎} ∈ On)
3634, 35sylib 221 . . . . . . . . 9 (𝜑 → ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎} ∈ On)
3736ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎} ∈ On)
38 ontr2 6436 . . . . . . . 8 ((𝑏 ∈ On ∧ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎} ∈ On) → ((𝑏 ⊆ 𝑐 ∧ 𝑐 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}) → 𝑏 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}))
3919, 37, 38syl2anc 596 . . . . . . 7 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → ((𝑏 ⊆ 𝑐 ∧ 𝑐 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}) → 𝑏 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}))
4014, 39mpan2d 707 . . . . . 6 (((𝜑 ∧ 𝑏 ∈ 𝐵) ∧ 𝑐 ∈ 𝐴) → (𝑏 ⊆ 𝑐 → 𝑏 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}))
4140rexlimdva 3170 . . . . 5 ((𝜑 ∧ 𝑏 ∈ 𝐵) → (∃𝑐 ∈ 𝐴 𝑏 ⊆ 𝑐 → 𝑏 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}))
4211, 41mpd 16 . . . 4 ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎})
4342ex 418 . . 3 (𝜑 → (𝑏 ∈ 𝐵 → 𝑏 ∈ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎}))
4443ssrdv 3918 . 2 (𝜑 → 𝐵 ⊆ ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎})
451, 2, 44cofon1 8718 1 (𝜑 → ∩ {𝑎 ∈ On ∣ 𝐴 ⊆ 𝑎} = ∩ {𝑏 ∈ On ∣ 𝐵 ⊆ 𝑏})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∃wrex 3093  {crab 3415  Vcvv 3453   ⊆ wss 3899  𝒫 cpw 4559  ∪ cuni 4871  ∩ cint 4911  Ord word 6386  Oncon0 6387  suc csuc 6389
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-sep 5254  ax-pr 5397  ax-un 7782
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-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  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-int 4912  df-br 5108  df-opab 5173  df-tr 5218  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-ord 6390  df-on 6391  df-suc 6393
This theorem is used by:  naddunif  8740
  Copyright terms: Public domain W3C validator