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

Theorem cofonr 8660
Description: Inverse cofinality law for ordinals. Contrast with cofcutr 28083 for surreals. (Contributed by Scott Fenton, 20-Jan-2025.)
Hypotheses
Ref Expression
cofonr.1 (𝜑𝐴 ∈ On)
cofonr.2 (𝜑𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
Assertion
Ref Expression
cofonr (𝜑 → ∀𝑦𝐴𝑧𝑋 𝑦𝑧)
Distinct variable groups:   𝑥,𝐴   𝑧,𝐴   𝑥,𝑋   𝑧,𝑋   𝜑,𝑥,𝑦   𝜑,𝑧,𝑦
Allowed substitution hints:   𝐴(𝑦)   𝑋(𝑦)

Proof of Theorem cofonr
StepHypRef Expression
1 cofonr.1 . . . . . . . 8 (𝜑𝐴 ∈ On)
2 onss 7784 . . . . . . . 8 (𝐴 ∈ On → 𝐴 ⊆ On)
31, 2syl 18 . . . . . . 7 (𝜑𝐴 ⊆ On)
43sselda 3945 . . . . . 6 ((𝜑𝑦𝐴) → 𝑦 ∈ On)
5 eloni 6371 . . . . . 6 (𝑦 ∈ On → Ord 𝑦)
6 ordirr 6379 . . . . . 6 (Ord 𝑦 → ¬ 𝑦𝑦)
74, 5, 63syl 19 . . . . 5 ((𝜑𝑦𝐴) → ¬ 𝑦𝑦)
8 cofonr.2 . . . . . . . . 9 (𝜑𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
98adantr 485 . . . . . . . 8 ((𝜑𝑦𝐴) → 𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
109adantr 485 . . . . . . 7 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
114adantr 485 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦 ∈ On)
12 simpr 489 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑋𝑦)
13 sseq2 3971 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝑋𝑥𝑋𝑦))
1413elrab 3659 . . . . . . . . 9 (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋𝑥} ↔ (𝑦 ∈ On ∧ 𝑋𝑦))
1511, 12, 14sylanbrc 594 . . . . . . . 8 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦 ∈ {𝑥 ∈ On ∣ 𝑋𝑥})
16 intss1 4932 . . . . . . . 8 (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋𝑥} → {𝑥 ∈ On ∣ 𝑋𝑥} ⊆ 𝑦)
1715, 16syl 18 . . . . . . 7 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → {𝑥 ∈ On ∣ 𝑋𝑥} ⊆ 𝑦)
1810, 17eqsstrd 3979 . . . . . 6 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝐴𝑦)
19 simplr 780 . . . . . 6 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦𝐴)
2018, 19sseldd 3946 . . . . 5 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦𝑦)
217, 20mtand 827 . . . 4 ((𝜑𝑦𝐴) → ¬ 𝑋𝑦)
22 dfss3 3934 . . . 4 (𝑋𝑦 ↔ ∀𝑧𝑋 𝑧𝑦)
2321, 22sylnib 331 . . 3 ((𝜑𝑦𝐴) → ¬ ∀𝑧𝑋 𝑧𝑦)
248, 1eqeltrrd 2870 . . . . . . . . . 10 (𝜑 {𝑥 ∈ On ∣ 𝑋𝑥} ∈ On)
25 onintrab2 7796 . . . . . . . . . 10 (∃𝑥 ∈ On 𝑋𝑥 {𝑥 ∈ On ∣ 𝑋𝑥} ∈ On)
2624, 25sylibr 237 . . . . . . . . 9 (𝜑 → ∃𝑥 ∈ On 𝑋𝑥)
2726adantr 485 . . . . . . . 8 ((𝜑𝑦𝐴) → ∃𝑥 ∈ On 𝑋𝑥)
28 onss 7784 . . . . . . . . . . 11 (𝑥 ∈ On → 𝑥 ⊆ On)
2928adantl 486 . . . . . . . . . 10 (((𝜑𝑦𝐴) ∧ 𝑥 ∈ On) → 𝑥 ⊆ On)
30 sstr 3953 . . . . . . . . . . 11 ((𝑋𝑥𝑥 ⊆ On) → 𝑋 ⊆ On)
3130expcom 418 . . . . . . . . . 10 (𝑥 ⊆ On → (𝑋𝑥𝑋 ⊆ On))
3229, 31syl 18 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑥 ∈ On) → (𝑋𝑥𝑋 ⊆ On))
3332rexlimdva 3172 . . . . . . . 8 ((𝜑𝑦𝐴) → (∃𝑥 ∈ On 𝑋𝑥𝑋 ⊆ On))
3427, 33mpd 16 . . . . . . 7 ((𝜑𝑦𝐴) → 𝑋 ⊆ On)
3534sselda 3945 . . . . . 6 (((𝜑𝑦𝐴) ∧ 𝑧𝑋) → 𝑧 ∈ On)
36 ontri1 6396 . . . . . 6 ((𝑦 ∈ On ∧ 𝑧 ∈ On) → (𝑦𝑧 ↔ ¬ 𝑧𝑦))
374, 35, 36syl2an2r 697 . . . . 5 (((𝜑𝑦𝐴) ∧ 𝑧𝑋) → (𝑦𝑧 ↔ ¬ 𝑧𝑦))
3837rexbidva 3193 . . . 4 ((𝜑𝑦𝐴) → (∃𝑧𝑋 𝑦𝑧 ↔ ∃𝑧𝑋 ¬ 𝑧𝑦))
39 rexnal 3123 . . . 4 (∃𝑧𝑋 ¬ 𝑧𝑦 ↔ ¬ ∀𝑧𝑋 𝑧𝑦)
4038, 39bitrdi 290 . . 3 ((𝜑𝑦𝐴) → (∃𝑧𝑋 𝑦𝑧 ↔ ¬ ∀𝑧𝑋 𝑧𝑦))
4123, 40mpbird 260 . 2 ((𝜑𝑦𝐴) → ∃𝑧𝑋 𝑦𝑧)
4241ralrimiva 3163 1 (𝜑 → ∀𝑦𝐴𝑧𝑋 𝑦𝑧)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wral 3085  wrex 3095  {crab 3423  wss 3913   cint 4916  Ord word 6360  Oncon0 6361
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-br 5114  df-opab 5178  df-tr 5223  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-ord 6364  df-on 6365
This theorem is referenced by:  naddunif  8680
  Copyright terms: Public domain W3C validator