Theorem coflton 8669

Description: Cofinality theorem for ordinals. If 𝐴 is cofinal with 𝐵 and 𝐵 precedes 𝐶, then 𝐴 precedes 𝐶. Compare cofsslt 27402 for surreals. (Contributed by Scott Fenton, 20-Jan-2025.)

Hypotheses

Ref	Expression
coflton.1	⊢ (𝜑 → 𝐴 ⊆ On)
coflton.2	⊢ (𝜑 → 𝐵 ⊆ On)
coflton.3	⊢ (𝜑 → 𝐶 ⊆ On)
coflton.4	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
coflton.5	⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝑧 ∈ 𝑤)

Assertion

Ref	Expression
coflton	⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 𝑎 ∈ 𝑐)

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

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝐴(𝑦,𝑧,𝑤,𝑎)   𝐵(𝑤,𝑎,𝑐)   𝐶(𝑥,𝑦,𝑎,𝑐)

Proof of Theorem coflton

Dummy variable 𝑏 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq1 4007	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (𝑥 ⊆ 𝑦 ↔ 𝑎 ⊆ 𝑦))
2	1	rexbidv 3178	. . . . . 6 ⊢ (𝑥 = 𝑎 → (∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 ↔ ∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦))
3		coflton.4	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
4	3	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
5		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
6	2, 4, 5	rspcdva 3613	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦)
7	6	adantrr 715	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) → ∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦)
8		sseq2 4008	. . . . 5 ⊢ (𝑦 = 𝑏 → (𝑎 ⊆ 𝑦 ↔ 𝑎 ⊆ 𝑏))
9	8	cbvrexvw 3235	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝑎 ⊆ 𝑦 ↔ ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏)
10	7, 9	sylib 217	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) → ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏)
11		simpr 485	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝐵)
12		simplrr 776	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → 𝑐 ∈ 𝐶)
13		coflton.5	. . . . . . 7 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝑧 ∈ 𝑤)
14	13	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝑧 ∈ 𝑤)
15		elequ1 2113	. . . . . . 7 ⊢ (𝑧 = 𝑏 → (𝑧 ∈ 𝑤 ↔ 𝑏 ∈ 𝑤))
16		elequ2 2121	. . . . . . 7 ⊢ (𝑤 = 𝑐 → (𝑏 ∈ 𝑤 ↔ 𝑏 ∈ 𝑐))
17	15, 16	rspc2va 3623	. . . . . 6 ⊢ (((𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶) ∧ ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐶 𝑧 ∈ 𝑤) → 𝑏 ∈ 𝑐)
18	11, 12, 14, 17	syl21anc 836	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝑐)
19		coflton.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ On)
20	19	sselda 3982	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ On)
21	20	adantrr 715	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) → 𝑎 ∈ On)
22		coflton.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ⊆ On)
23	22	sselda 3982	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐶) → 𝑐 ∈ On)
24	23	adantrl 714	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) → 𝑐 ∈ On)
25	24	adantr 481	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → 𝑐 ∈ On)
26		ontr2 6411	. . . . . 6 ⊢ ((𝑎 ∈ On ∧ 𝑐 ∈ On) → ((𝑎 ⊆ 𝑏 ∧ 𝑏 ∈ 𝑐) → 𝑎 ∈ 𝑐))
27	21, 25, 26	syl2an2r 683	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → ((𝑎 ⊆ 𝑏 ∧ 𝑏 ∈ 𝑐) → 𝑎 ∈ 𝑐))
28	18, 27	mpan2d 692	. . . 4 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ∧ 𝑏 ∈ 𝐵) → (𝑎 ⊆ 𝑏 → 𝑎 ∈ 𝑐))
29	28	rexlimdva 3155	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) → (∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏 → 𝑎 ∈ 𝑐))
30	10, 29	mpd 15	. 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) → 𝑎 ∈ 𝑐)
31	30	ralrimivva 3200	1 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 𝑎 ∈ 𝑐)

Syntax hints:   → wi 4   ∧ wa 396   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070   ⊆ wss 3948  Oncon0 6364

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-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

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-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 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6367  df-on 6368

This theorem is referenced by: (None)