Theorem cofonr 8669

Description: Inverse cofinality law for ordinals. Contrast with cofcutr 27400 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 7768	. . . . . . . 8 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
3	1, 2	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ On)
4	3	sselda 3981	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
5		eloni 6371	. . . . . 6 ⊢ (𝑦 ∈ On → Ord 𝑦)
6		ordirr 6379	. . . . . 6 ⊢ (Ord 𝑦 → ¬ 𝑦 ∈ 𝑦)
7	4, 5, 6	3syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑦 ∈ 𝑦)
8		cofonr.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
9	8	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐴 = ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
10	9	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝐴 = ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
11	4	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ On)
12		simpr 485	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑋 ⊆ 𝑦)
13		sseq2 4007	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑋 ⊆ 𝑥 ↔ 𝑋 ⊆ 𝑦))
14	13	elrab 3682	. . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ↔ (𝑦 ∈ On ∧ 𝑋 ⊆ 𝑦))
15	11, 12, 14	sylanbrc 583	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥})
16		intss1 4966	. . . . . . . 8 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} → ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ⊆ 𝑦)
17	15, 16	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ⊆ 𝑦)
18	10, 17	eqsstrd 4019	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝐴 ⊆ 𝑦)
19		simplr 767	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ 𝐴)
20	18, 19	sseldd 3982	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑋 ⊆ 𝑦) → 𝑦 ∈ 𝑦)
21	7, 20	mtand 814	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑋 ⊆ 𝑦)
22		dfss3 3969	. . . 4 ⊢ (𝑋 ⊆ 𝑦 ↔ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦)
23	21, 22	sylnib 327	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦)
24	8, 1	eqeltrrd 2834	. . . . . . . . . 10 ⊢ (𝜑 → ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ∈ On)
25		onintrab2 7781	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ On 𝑋 ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝑋 ⊆ 𝑥} ∈ On)
26	24, 25	sylibr 233	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑥 ∈ On 𝑋 ⊆ 𝑥)
27	26	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ On 𝑋 ⊆ 𝑥)
28		onss 7768	. . . . . . . . . . 11 ⊢ (𝑥 ∈ On → 𝑥 ⊆ On)
29	28	adantl 482	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ On) → 𝑥 ⊆ On)
30		sstr 3989	. . . . . . . . . . 11 ⊢ ((𝑋 ⊆ 𝑥 ∧ 𝑥 ⊆ On) → 𝑋 ⊆ On)
31	30	expcom 414	. . . . . . . . . 10 ⊢ (𝑥 ⊆ On → (𝑋 ⊆ 𝑥 → 𝑋 ⊆ On))
32	29, 31	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ On) → (𝑋 ⊆ 𝑥 → 𝑋 ⊆ On))
33	32	rexlimdva 3155	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∃𝑥 ∈ On 𝑋 ⊆ 𝑥 → 𝑋 ⊆ On))
34	27, 33	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑋 ⊆ On)
35	34	sselda 3981	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ On)
36		ontri1 6395	. . . . . 6 ⊢ ((𝑦 ∈ On ∧ 𝑧 ∈ On) → (𝑦 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑦))
37	4, 35, 36	syl2an2r 683	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑧 ∈ 𝑋) → (𝑦 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑦))
38	37	rexbidva 3176	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧 ↔ ∃𝑧 ∈ 𝑋 ¬ 𝑧 ∈ 𝑦))
39		rexnal 3100	. . . 4 ⊢ (∃𝑧 ∈ 𝑋 ¬ 𝑧 ∈ 𝑦 ↔ ¬ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦)
40	38, 39	bitrdi 286	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧 ↔ ¬ ∀𝑧 ∈ 𝑋 𝑧 ∈ 𝑦))
41	23, 40	mpbird 256	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧)
42	41	ralrimiva 3146	1 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝑋 𝑦 ⊆ 𝑧)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070  {crab 3432   ⊆ wss 3947  ∩ cint 4949  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 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-br 5148  df-opab 5210  df-tr 5265  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-ord 6364  df-on 6365

This theorem is referenced by:  naddunif  8688