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

Theorem cofonr 8612
Description: Inverse cofinality law for ordinals. Contrast with cofcutr 27935 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 7740 . . . . . . . 8 (𝐴 ∈ On → 𝐴 ⊆ On)
31, 2syl 17 . . . . . . 7 (𝜑𝐴 ⊆ On)
43sselda 3935 . . . . . 6 ((𝜑𝑦𝐴) → 𝑦 ∈ On)
5 eloni 6335 . . . . . 6 (𝑦 ∈ On → Ord 𝑦)
6 ordirr 6343 . . . . . 6 (Ord 𝑦 → ¬ 𝑦𝑦)
74, 5, 63syl 18 . . . . 5 ((𝜑𝑦𝐴) → ¬ 𝑦𝑦)
8 cofonr.2 . . . . . . . . 9 (𝜑𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
98adantr 480 . . . . . . . 8 ((𝜑𝑦𝐴) → 𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
109adantr 480 . . . . . . 7 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝐴 = {𝑥 ∈ On ∣ 𝑋𝑥})
114adantr 480 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦 ∈ On)
12 simpr 484 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑋𝑦)
13 sseq2 3962 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝑋𝑥𝑋𝑦))
1413elrab 3648 . . . . . . . . 9 (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋𝑥} ↔ (𝑦 ∈ On ∧ 𝑋𝑦))
1511, 12, 14sylanbrc 584 . . . . . . . 8 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦 ∈ {𝑥 ∈ On ∣ 𝑋𝑥})
16 intss1 4920 . . . . . . . 8 (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋𝑥} → {𝑥 ∈ On ∣ 𝑋𝑥} ⊆ 𝑦)
1715, 16syl 17 . . . . . . 7 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → {𝑥 ∈ On ∣ 𝑋𝑥} ⊆ 𝑦)
1810, 17eqsstrd 3970 . . . . . 6 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝐴𝑦)
19 simplr 769 . . . . . 6 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦𝐴)
2018, 19sseldd 3936 . . . . 5 (((𝜑𝑦𝐴) ∧ 𝑋𝑦) → 𝑦𝑦)
217, 20mtand 816 . . . 4 ((𝜑𝑦𝐴) → ¬ 𝑋𝑦)
22 dfss3 3924 . . . 4 (𝑋𝑦 ↔ ∀𝑧𝑋 𝑧𝑦)
2321, 22sylnib 328 . . 3 ((𝜑𝑦𝐴) → ¬ ∀𝑧𝑋 𝑧𝑦)
248, 1eqeltrrd 2838 . . . . . . . . . 10 (𝜑 {𝑥 ∈ On ∣ 𝑋𝑥} ∈ On)
25 onintrab2 7752 . . . . . . . . . 10 (∃𝑥 ∈ On 𝑋𝑥 {𝑥 ∈ On ∣ 𝑋𝑥} ∈ On)
2624, 25sylibr 234 . . . . . . . . 9 (𝜑 → ∃𝑥 ∈ On 𝑋𝑥)
2726adantr 480 . . . . . . . 8 ((𝜑𝑦𝐴) → ∃𝑥 ∈ On 𝑋𝑥)
28 onss 7740 . . . . . . . . . . 11 (𝑥 ∈ On → 𝑥 ⊆ On)
2928adantl 481 . . . . . . . . . 10 (((𝜑𝑦𝐴) ∧ 𝑥 ∈ On) → 𝑥 ⊆ On)
30 sstr 3944 . . . . . . . . . . 11 ((𝑋𝑥𝑥 ⊆ On) → 𝑋 ⊆ On)
3130expcom 413 . . . . . . . . . 10 (𝑥 ⊆ On → (𝑋𝑥𝑋 ⊆ On))
3229, 31syl 17 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑥 ∈ On) → (𝑋𝑥𝑋 ⊆ On))
3332rexlimdva 3139 . . . . . . . 8 ((𝜑𝑦𝐴) → (∃𝑥 ∈ On 𝑋𝑥𝑋 ⊆ On))
3427, 33mpd 15 . . . . . . 7 ((𝜑𝑦𝐴) → 𝑋 ⊆ On)
3534sselda 3935 . . . . . 6 (((𝜑𝑦𝐴) ∧ 𝑧𝑋) → 𝑧 ∈ On)
36 ontri1 6359 . . . . . 6 ((𝑦 ∈ On ∧ 𝑧 ∈ On) → (𝑦𝑧 ↔ ¬ 𝑧𝑦))
374, 35, 36syl2an2r 686 . . . . 5 (((𝜑𝑦𝐴) ∧ 𝑧𝑋) → (𝑦𝑧 ↔ ¬ 𝑧𝑦))
3837rexbidva 3160 . . . 4 ((𝜑𝑦𝐴) → (∃𝑧𝑋 𝑦𝑧 ↔ ∃𝑧𝑋 ¬ 𝑧𝑦))
39 rexnal 3090 . . . 4 (∃𝑧𝑋 ¬ 𝑧𝑦 ↔ ¬ ∀𝑧𝑋 𝑧𝑦)
4038, 39bitrdi 287 . . 3 ((𝜑𝑦𝐴) → (∃𝑧𝑋 𝑦𝑧 ↔ ¬ ∀𝑧𝑋 𝑧𝑦))
4123, 40mpbird 257 . 2 ((𝜑𝑦𝐴) → ∃𝑧𝑋 𝑦𝑧)
4241ralrimiva 3130 1 (𝜑 → ∀𝑦𝐴𝑧𝑋 𝑦𝑧)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062  {crab 3401  wss 3903   cint 4904  Ord word 6324  Oncon0 6325
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-tr 5208  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-ord 6328  df-on 6329
This theorem is referenced by:  naddunif  8631
  Copyright terms: Public domain W3C validator