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

Theorem cofon2 8671
Description: Cofinality theorem for ordinals. If 𝐴 and 𝐵 are mutually cofinal, then their upper bounds agree. Compare cofcut2 27793 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 4002 . . . . . . . 8 (𝑧 = 𝑏 → (𝑧𝑤𝑏𝑤))
43rexbidv 3172 . . . . . . 7 (𝑧 = 𝑏 → (∃𝑤𝐴 𝑧𝑤 ↔ ∃𝑤𝐴 𝑏𝑤))
5 cofon2.4 . . . . . . . 8 (𝜑 → ∀𝑧𝐵𝑤𝐴 𝑧𝑤)
65adantr 480 . . . . . . 7 ((𝜑𝑏𝐵) → ∀𝑧𝐵𝑤𝐴 𝑧𝑤)
7 simpr 484 . . . . . . 7 ((𝜑𝑏𝐵) → 𝑏𝐵)
84, 6, 7rspcdva 3607 . . . . . 6 ((𝜑𝑏𝐵) → ∃𝑤𝐴 𝑏𝑤)
9 sseq2 4003 . . . . . . 7 (𝑤 = 𝑐 → (𝑏𝑤𝑏𝑐))
109cbvrexvw 3229 . . . . . 6 (∃𝑤𝐴 𝑏𝑤 ↔ ∃𝑐𝐴 𝑏𝑐)
118, 10sylib 217 . . . . 5 ((𝜑𝑏𝐵) → ∃𝑐𝐴 𝑏𝑐)
12 ssintub 4963 . . . . . . . . 9 𝐴 {𝑎 ∈ On ∣ 𝐴𝑎}
1312a1i 11 . . . . . . . 8 ((𝜑𝑏𝐵) → 𝐴 {𝑎 ∈ On ∣ 𝐴𝑎})
1413sselda 3977 . . . . . . 7 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → 𝑐 {𝑎 ∈ On ∣ 𝐴𝑎})
15 cofon2.2 . . . . . . . . . . 11 (𝜑𝐵 ∈ 𝒫 On)
1615elpwid 4606 . . . . . . . . . 10 (𝜑𝐵 ⊆ On)
1716ad2antrr 723 . . . . . . . . 9 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → 𝐵 ⊆ On)
18 simplr 766 . . . . . . . . 9 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → 𝑏𝐵)
1917, 18sseldd 3978 . . . . . . . 8 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → 𝑏 ∈ On)
201elpwid 4606 . . . . . . . . . . . . . 14 (𝜑𝐴 ⊆ On)
21 ssorduni 7762 . . . . . . . . . . . . . 14 (𝐴 ⊆ On → Ord 𝐴)
2220, 21syl 17 . . . . . . . . . . . . 13 (𝜑 → Ord 𝐴)
23 ordsuc 7797 . . . . . . . . . . . . 13 (Ord 𝐴 ↔ Ord suc 𝐴)
2422, 23sylib 217 . . . . . . . . . . . 12 (𝜑 → Ord suc 𝐴)
251uniexd 7728 . . . . . . . . . . . . 13 (𝜑 𝐴 ∈ V)
26 sucexg 7789 . . . . . . . . . . . . 13 ( 𝐴 ∈ V → suc 𝐴 ∈ V)
27 elong 6365 . . . . . . . . . . . . 13 (suc 𝐴 ∈ V → (suc 𝐴 ∈ On ↔ Ord suc 𝐴))
2825, 26, 273syl 18 . . . . . . . . . . . 12 (𝜑 → (suc 𝐴 ∈ On ↔ Ord suc 𝐴))
2924, 28mpbird 257 . . . . . . . . . . 11 (𝜑 → suc 𝐴 ∈ On)
30 onsucuni 7812 . . . . . . . . . . . 12 (𝐴 ⊆ On → 𝐴 ⊆ suc 𝐴)
3120, 30syl 17 . . . . . . . . . . 11 (𝜑𝐴 ⊆ suc 𝐴)
32 sseq2 4003 . . . . . . . . . . . 12 (𝑎 = suc 𝐴 → (𝐴𝑎𝐴 ⊆ suc 𝐴))
3332rspcev 3606 . . . . . . . . . . 11 ((suc 𝐴 ∈ On ∧ 𝐴 ⊆ suc 𝐴) → ∃𝑎 ∈ On 𝐴𝑎)
3429, 31, 33syl2anc 583 . . . . . . . . . 10 (𝜑 → ∃𝑎 ∈ On 𝐴𝑎)
35 onintrab2 7781 . . . . . . . . . 10 (∃𝑎 ∈ On 𝐴𝑎 {𝑎 ∈ On ∣ 𝐴𝑎} ∈ On)
3634, 35sylib 217 . . . . . . . . 9 (𝜑 {𝑎 ∈ On ∣ 𝐴𝑎} ∈ On)
3736ad2antrr 723 . . . . . . . 8 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → {𝑎 ∈ On ∣ 𝐴𝑎} ∈ On)
38 ontr2 6404 . . . . . . . 8 ((𝑏 ∈ On ∧ {𝑎 ∈ On ∣ 𝐴𝑎} ∈ On) → ((𝑏𝑐𝑐 {𝑎 ∈ On ∣ 𝐴𝑎}) → 𝑏 {𝑎 ∈ On ∣ 𝐴𝑎}))
3919, 37, 38syl2anc 583 . . . . . . 7 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → ((𝑏𝑐𝑐 {𝑎 ∈ On ∣ 𝐴𝑎}) → 𝑏 {𝑎 ∈ On ∣ 𝐴𝑎}))
4014, 39mpan2d 691 . . . . . 6 (((𝜑𝑏𝐵) ∧ 𝑐𝐴) → (𝑏𝑐𝑏 {𝑎 ∈ On ∣ 𝐴𝑎}))
4140rexlimdva 3149 . . . . 5 ((𝜑𝑏𝐵) → (∃𝑐𝐴 𝑏𝑐𝑏 {𝑎 ∈ On ∣ 𝐴𝑎}))
4211, 41mpd 15 . . . 4 ((𝜑𝑏𝐵) → 𝑏 {𝑎 ∈ On ∣ 𝐴𝑎})
4342ex 412 . . 3 (𝜑 → (𝑏𝐵𝑏 {𝑎 ∈ On ∣ 𝐴𝑎}))
4443ssrdv 3983 . 2 (𝜑𝐵 {𝑎 ∈ On ∣ 𝐴𝑎})
451, 2, 44cofon1 8670 1 (𝜑 {𝑎 ∈ On ∣ 𝐴𝑎} = {𝑏 ∈ On ∣ 𝐵𝑏})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1533  wcel 2098  wral 3055  wrex 3064  {crab 3426  Vcvv 3468  wss 3943  𝒫 cpw 4597   cuni 4902   cint 4943  Ord word 6356  Oncon0 6357  suc csuc 6359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-int 4944  df-br 5142  df-opab 5204  df-tr 5259  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-ord 6360  df-on 6361  df-suc 6363
This theorem is referenced by:  naddunif  8691
  Copyright terms: Public domain W3C validator