Theorem cofon1 8598

Description: Cofinality theorem for ordinals. If 𝐴 is cofinal with 𝐵 and the upper bound of 𝐴 dominates 𝐵, then their upper bounds are equal. Compare with cofcut1 27891 for surreals. (Contributed by Scott Fenton, 20-Jan-2025.)

Hypotheses

Ref	Expression
cofon1.1	⊢ (𝜑 → 𝐴 ∈ 𝒫 On)
cofon1.2	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
cofon1.3	⊢ (𝜑 → 𝐵 ⊆ ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧})

Assertion

Ref	Expression
cofon1	⊢ (𝜑 → ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} = ∩ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤})

Distinct variable groups:   𝑤,𝐴   𝑥,𝐴   𝑧,𝐴   𝑤,𝐵   𝑥,𝐵,𝑦   𝑧,𝐵   𝜑,𝑧   𝑧,𝑤

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑤)   𝐴(𝑦)

Proof of Theorem cofon1

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq2 3958	. . . . 5 ⊢ (𝑤 = 𝑧 → (𝐵 ⊆ 𝑤 ↔ 𝐵 ⊆ 𝑧))
2	1	cbvrabv 3407	. . . 4 ⊢ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤} = {𝑧 ∈ On ∣ 𝐵 ⊆ 𝑧}
3		sseq1 3957	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (𝑥 ⊆ 𝑦 ↔ 𝑎 ⊆ 𝑦))
4	3	rexbidv 3158	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → (∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 ↔ ∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦))
5		cofon1.2	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
6	5	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
7		simprr 772	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → 𝑎 ∈ 𝐴)
8	4, 6, 7	rspcdva 3575	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → ∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦)
9		sseq2 3958	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑏 → (𝑎 ⊆ 𝑦 ↔ 𝑎 ⊆ 𝑏))
10	9	cbvrexvw 3213	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦 ↔ ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏)
11	8, 10	sylib 218	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏)
12		simprl 770	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → 𝐵 ⊆ 𝑧)
13	12	sselda 3931	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝑧)
14		cofon1.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐴 ∈ 𝒫 On)
15	14	elpwid 4561	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ⊆ On)
16	15	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → 𝐴 ⊆ On)
17		simplrr 777	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → 𝑎 ∈ 𝐴)
18	16, 17	sseldd 3932	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → 𝑎 ∈ On)
19		simpllr 775	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → 𝑧 ∈ On)
20		ontr2 6363	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ On ∧ 𝑧 ∈ On) → ((𝑎 ⊆ 𝑏 ∧ 𝑏 ∈ 𝑧) → 𝑎 ∈ 𝑧))
21	18, 19, 20	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → ((𝑎 ⊆ 𝑏 ∧ 𝑏 ∈ 𝑧) → 𝑎 ∈ 𝑧))
22	13, 21	mpan2d 694	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) ∧ 𝑏 ∈ 𝐵) → (𝑎 ⊆ 𝑏 → 𝑎 ∈ 𝑧))
23	22	rexlimdva 3135	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → (∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏 → 𝑎 ∈ 𝑧))
24	11, 23	mpd 15	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ (𝐵 ⊆ 𝑧 ∧ 𝑎 ∈ 𝐴)) → 𝑎 ∈ 𝑧)
25	24	expr 456	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ 𝐵 ⊆ 𝑧) → (𝑎 ∈ 𝐴 → 𝑎 ∈ 𝑧))
26	25	ssrdv 3937	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ On) ∧ 𝐵 ⊆ 𝑧) → 𝐴 ⊆ 𝑧)
27	26	ex 412	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ On) → (𝐵 ⊆ 𝑧 → 𝐴 ⊆ 𝑧))
28	27	ss2rabdv 4025	. . . 4 ⊢ (𝜑 → {𝑧 ∈ On ∣ 𝐵 ⊆ 𝑧} ⊆ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧})
29	2, 28	eqsstrid 3970	. . 3 ⊢ (𝜑 → {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤} ⊆ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧})
30		intss 4922	. . 3 ⊢ ({𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤} ⊆ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} → ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} ⊆ ∩ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤})
31	29, 30	syl 17	. 2 ⊢ (𝜑 → ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} ⊆ ∩ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤})
32		sseq2 3958	. . . 4 ⊢ (𝑤 = ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} → (𝐵 ⊆ 𝑤 ↔ 𝐵 ⊆ ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧}))
33		ssorduni 7722	. . . . . . . . 9 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)
34	15, 33	syl 17	. . . . . . . 8 ⊢ (𝜑 → Ord ∪ 𝐴)
35		ordsuc 7754	. . . . . . . 8 ⊢ (Ord ∪ 𝐴 ↔ Ord suc ∪ 𝐴)
36	34, 35	sylib 218	. . . . . . 7 ⊢ (𝜑 → Ord suc ∪ 𝐴)
37	14	uniexd 7685	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝐴 ∈ V)
38		sucexg 7748	. . . . . . . . 9 ⊢ (∪ 𝐴 ∈ V → suc ∪ 𝐴 ∈ V)
39	37, 38	syl 17	. . . . . . . 8 ⊢ (𝜑 → suc ∪ 𝐴 ∈ V)
40		elong 6323	. . . . . . . 8 ⊢ (suc ∪ 𝐴 ∈ V → (suc ∪ 𝐴 ∈ On ↔ Ord suc ∪ 𝐴))
41	39, 40	syl 17	. . . . . . 7 ⊢ (𝜑 → (suc ∪ 𝐴 ∈ On ↔ Ord suc ∪ 𝐴))
42	36, 41	mpbird 257	. . . . . 6 ⊢ (𝜑 → suc ∪ 𝐴 ∈ On)
43		onsucuni 7768	. . . . . . 7 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴)
44	15, 43	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ suc ∪ 𝐴)
45		sseq2 3958	. . . . . . 7 ⊢ (𝑧 = suc ∪ 𝐴 → (𝐴 ⊆ 𝑧 ↔ 𝐴 ⊆ suc ∪ 𝐴))
46	45	rspcev 3574	. . . . . 6 ⊢ ((suc ∪ 𝐴 ∈ On ∧ 𝐴 ⊆ suc ∪ 𝐴) → ∃𝑧 ∈ On 𝐴 ⊆ 𝑧)
47	42, 44, 46	syl2anc 584	. . . . 5 ⊢ (𝜑 → ∃𝑧 ∈ On 𝐴 ⊆ 𝑧)
48		onintrab2 7740	. . . . 5 ⊢ (∃𝑧 ∈ On 𝐴 ⊆ 𝑧 ↔ ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} ∈ On)
49	47, 48	sylib 218	. . . 4 ⊢ (𝜑 → ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} ∈ On)
50		cofon1.3	. . . 4 ⊢ (𝜑 → 𝐵 ⊆ ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧})
51	32, 49, 50	elrabd 3646	. . 3 ⊢ (𝜑 → ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} ∈ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤})
52		intss1 4916	. . 3 ⊢ (∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} ∈ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤} → ∩ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤} ⊆ ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧})
53	51, 52	syl 17	. 2 ⊢ (𝜑 → ∩ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤} ⊆ ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧})
54	31, 53	eqssd 3949	1 ⊢ (𝜑 → ∩ {𝑧 ∈ On ∣ 𝐴 ⊆ 𝑧} = ∩ {𝑤 ∈ On ∣ 𝐵 ⊆ 𝑤})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3049  ∃wrex 3058  {crab 3397  Vcvv 3438   ⊆ wss 3899  𝒫 cpw 4552  ∪ cuni 4861  ∩ cint 4900  Ord word 6314  Oncon0 6315  suc csuc 6317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-br 5097  df-opab 5159  df-tr 5204  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-ord 6318  df-on 6319  df-suc 6321

This theorem is referenced by:  cofon2  8599