Theorem cofonr 8669

Description: Inverse cofinality law for ordinals. Contrast with cofcutr 28221 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

Step	Hyp	Ref	Expression
1		cofonr.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ On)
2		onss 7790	. . . . . . . 8 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
3	1, 2	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ On)
4	3	sselda 3931	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
5		eloni 6369	. . . . . 6 ⊢ (𝑦 ∈ On → Ord 𝑦)
6		ordirr 6377	. . . . . 6 ⊢ (Ord 𝑦 → ¬ 𝑦 ∈ 𝑦)
7	4, 5, 6	3syl 19	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑦 ∈ 𝑦)
8		cofonr.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
9	8	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐴 = ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
10	9	adantr 486	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝐴 = ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
11	4	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ On)
12		simpr 490	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑋 ⊆ 𝑦)
13		sseq2 3957	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑋 ⊆ 𝑥 ↔ 𝑋 ⊆ 𝑦))
14	13	elrab 3645	. . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ↔ (𝑦 ∈ On ∧ 𝑋 ⊆ 𝑦))
15	11, 12, 14	sylanbrc 595	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
16		intss1 4923	. . . . . . . 8 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} → ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ⊆ 𝑦)
17	15, 16	syl 18	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ⊆ 𝑦)
18	10, 17	eqsstrd 3965	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝐴 ⊆ 𝑦)
19		simplr 781	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ 𝐴)
20	18, 19	sseldd 3932	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ 𝑦)
21	7, 20	mtand 828	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑋 ⊆ 𝑦)
22		dfss3 3920	. . . 4 ⊢ (𝑋 ⊆ 𝑦 ↔ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦)
23	21, 22	sylnib 331	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦)
24	8, 1	eqeltrrd 2861	. . . . . . . . . 10 ⊢ (𝜑 → ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ∈ On)
25		onintrab2 7802	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ On 𝑋 ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ∈ On)
26	24, 25	sylibr 237	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑥 ∈ On 𝑋 ⊆ 𝑥)
27	26	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ On 𝑋 ⊆ 𝑥)
28		onss 7790	. . . . . . . . . . 11 ⊢ (𝑥 ∈ On → 𝑥 ⊆ On)
29	28	adantl 487	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ On) → 𝑥 ⊆ On)
30		sstr 3939	. . . . . . . . . . 11 ⊢ ((𝑋 ⊆ 𝑥 ∧ 𝑥 ⊆ On) → 𝑋 ⊆ On)
31	30	expcom 419	. . . . . . . . . 10 ⊢ (𝑥 ⊆ On → (𝑋 ⊆ 𝑥 → 𝑋 ⊆ On))
32	29, 31	syl 18	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ On) → (𝑋 ⊆ 𝑥 → 𝑋 ⊆ On))
33	32	rexlimdva 3163	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∃𝑥 ∈ On 𝑋 ⊆ 𝑥 → 𝑋 ⊆ On))
34	27, 33	mpd 16	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑋 ⊆ On)
35	34	sselda 3931	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ On)
36		ontri1 6394	. . . . . 6 ⊢ ((𝑦 ∈ On ∧ 𝑧 ∈ On) → (𝑦 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑦))
37	4, 35, 36	syl2an2r 698	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ 𝑋) → (𝑦 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑦))
38	37	rexbidva 3184	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧 ↔ ∃𝑧 ∈ 𝑋 ¬ 𝑧 ∈ 𝑦))
39		rexnal 3114	. . . 4 ⊢ (∃𝑧 ∈ 𝑋 ¬ 𝑧 ∈ 𝑦 ↔ ¬ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦)
40	38, 39	bitrdi 290	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧 ↔ ¬ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦))
41	23, 40	mpbird 260	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧)
42	41	ralrimiva 3154	1 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  {crab 3412   ⊆ wss 3899  ∩ cint 4907  Ord word 6358  Oncon0 6359

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6362  df-on 6363

This theorem is used by:  naddunif  8689