Theorem fineqvnttrclselem2 35266

Description: Lemma for fineqvnttrclse 35268. (Contributed by BTernaryTau, 12-Jan-2026.)

Hypothesis

Ref	Expression
fineqvnttrclselem2.1	⊢ 𝐹 = (𝑣 ∈ suc suc 𝑁 ↦ ∪ {𝑑 ∈ On ∣ (𝑣 +o 𝑑) = 𝐵})

Assertion

Ref	Expression
fineqvnttrclselem2	⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → (𝐴 +o (𝐹‘𝐴)) = 𝐵)

Distinct variable groups:   𝑣,𝐵   𝐹,𝑑   𝑣,𝑁   𝐴,𝑑,𝑣   𝐵,𝑑

Allowed substitution hints:   𝐹(𝑣)   𝑁(𝑑)

Proof of Theorem fineqvnttrclselem2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifi 4071	. . . . . . 7 ⊢ (𝐵 ∈ (ω ∖ 1o) → 𝐵 ∈ ω)
2		elnn 7828	. . . . . . . 8 ⊢ ((𝑁 ∈ 𝐵 ∧ 𝐵 ∈ ω) → 𝑁 ∈ ω)
3	2	ancoms 458	. . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝑁 ∈ 𝐵) → 𝑁 ∈ ω)
4	1, 3	sylan 581	. . . . . 6 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵) → 𝑁 ∈ ω)
5	4	3adant3 1133	. . . . 5 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → 𝑁 ∈ ω)
6		fineqvnttrclselem2.1	. . . . . 6 ⊢ 𝐹 = (𝑣 ∈ suc suc 𝑁 ↦ ∪ {𝑑 ∈ On ∣ (𝑣 +o 𝑑) = 𝐵})
7		oveq1 7374	. . . . . . . . 9 ⊢ (𝑣 = 𝐴 → (𝑣 +o 𝑑) = (𝐴 +o 𝑑))
8	7	eqeq1d 2738	. . . . . . . 8 ⊢ (𝑣 = 𝐴 → ((𝑣 +o 𝑑) = 𝐵 ↔ (𝐴 +o 𝑑) = 𝐵))
9	8	rabbidv 3396	. . . . . . 7 ⊢ (𝑣 = 𝐴 → {𝑑 ∈ On ∣ (𝑣 +o 𝑑) = 𝐵} = {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
10	9	unieqd 4863	. . . . . 6 ⊢ (𝑣 = 𝐴 → ∪ {𝑑 ∈ On ∣ (𝑣 +o 𝑑) = 𝐵} = ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
11		simp3 1139	. . . . . 6 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ ω ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ∈ suc suc 𝑁)
12		fineqvnttrclselem1 35265	. . . . . . 7 ⊢ (𝐵 ∈ (ω ∖ 1o) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
13	12	3ad2ant1 1134	. . . . . 6 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ ω ∧ 𝐴 ∈ suc suc 𝑁) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
14	6, 10, 11, 13	fvmptd3 6971	. . . . 5 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ ω ∧ 𝐴 ∈ suc suc 𝑁) → (𝐹‘𝐴) = ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
15	5, 14	syld3an2 1414	. . . 4 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → (𝐹‘𝐴) = ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
16		nnon 7823	. . . . . . . . 9 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On)
17	1, 16	syl 17	. . . . . . . 8 ⊢ (𝐵 ∈ (ω ∖ 1o) → 𝐵 ∈ On)
18		onelon 6348	. . . . . . . . 9 ⊢ ((𝐵 ∈ On ∧ 𝑁 ∈ 𝐵) → 𝑁 ∈ On)
19		onsuc 7764	. . . . . . . . 9 ⊢ (𝑁 ∈ On → suc 𝑁 ∈ On)
20	18, 19	syl 17	. . . . . . . 8 ⊢ ((𝐵 ∈ On ∧ 𝑁 ∈ 𝐵) → suc 𝑁 ∈ On)
21	17, 20	sylan 581	. . . . . . 7 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵) → suc 𝑁 ∈ On)
22		onsuc 7764	. . . . . . . 8 ⊢ (suc 𝑁 ∈ On → suc suc 𝑁 ∈ On)
23		onelon 6348	. . . . . . . 8 ⊢ ((suc suc 𝑁 ∈ On ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ∈ On)
24	22, 23	sylan 581	. . . . . . 7 ⊢ ((suc 𝑁 ∈ On ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ∈ On)
25	21, 24	stoic3 1778	. . . . . 6 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ∈ On)
26	17	3ad2ant1 1134	. . . . . 6 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → 𝐵 ∈ On)
27		simp3 1139	. . . . . . . 8 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ∈ suc suc 𝑁)
28		simpl 482	. . . . . . . . . . 11 ⊢ ((suc 𝑁 ∈ On ∧ 𝐴 ∈ suc suc 𝑁) → suc 𝑁 ∈ On)
29	24, 28	jca 511	. . . . . . . . . 10 ⊢ ((suc 𝑁 ∈ On ∧ 𝐴 ∈ suc suc 𝑁) → (𝐴 ∈ On ∧ suc 𝑁 ∈ On))
30	21, 29	stoic3 1778	. . . . . . . . 9 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → (𝐴 ∈ On ∧ suc 𝑁 ∈ On))
31		onsssuc 6415	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ suc 𝑁 ∈ On) → (𝐴 ⊆ suc 𝑁 ↔ 𝐴 ∈ suc suc 𝑁))
32	30, 31	syl 17	. . . . . . . 8 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → (𝐴 ⊆ suc 𝑁 ↔ 𝐴 ∈ suc suc 𝑁))
33	27, 32	mpbird 257	. . . . . . 7 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ⊆ suc 𝑁)
34		nnord 7825	. . . . . . . . . 10 ⊢ (𝐵 ∈ ω → Ord 𝐵)
35		ordsucss 7769	. . . . . . . . . 10 ⊢ (Ord 𝐵 → (𝑁 ∈ 𝐵 → suc 𝑁 ⊆ 𝐵))
36	1, 34, 35	3syl 18	. . . . . . . . 9 ⊢ (𝐵 ∈ (ω ∖ 1o) → (𝑁 ∈ 𝐵 → suc 𝑁 ⊆ 𝐵))
37	36	imp 406	. . . . . . . 8 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵) → suc 𝑁 ⊆ 𝐵)
38	37	3adant3 1133	. . . . . . 7 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → suc 𝑁 ⊆ 𝐵)
39	33, 38	sstrd 3932	. . . . . 6 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → 𝐴 ⊆ 𝐵)
40		oawordeu 8490	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
41	25, 26, 39, 40	syl21anc 838	. . . . 5 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → ∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
42		reusn 4671	. . . . . 6 ⊢ (∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 ↔ ∃𝑥{𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥})
43		unieq 4861	. . . . . . . . 9 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥} → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∪ {𝑥})
44		unisnv 4870	. . . . . . . . 9 ⊢ ∪ {𝑥} = 𝑥
45	43, 44	eqtrdi 2787	. . . . . . . 8 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥} → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = 𝑥)
46		vsnid 4607	. . . . . . . . 9 ⊢ 𝑥 ∈ {𝑥}
47		eleq2 2825	. . . . . . . . 9 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥} → (𝑥 ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ↔ 𝑥 ∈ {𝑥}))
48	46, 47	mpbiri 258	. . . . . . . 8 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥} → 𝑥 ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
49	45, 48	eqeltrd 2836	. . . . . . 7 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥} → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
50	49	exlimiv 1932	. . . . . 6 ⊢ (∃𝑥{𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑥} → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
51	42, 50	sylbi 217	. . . . 5 ⊢ (∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
52	41, 51	syl 17	. . . 4 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
53	15, 52	eqeltrd 2836	. . 3 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → (𝐹‘𝐴) ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵})
54		oveq2 7375	. . . . 5 ⊢ (𝑑 = (𝐹‘𝐴) → (𝐴 +o 𝑑) = (𝐴 +o (𝐹‘𝐴)))
55	54	eqeq1d 2738	. . . 4 ⊢ (𝑑 = (𝐹‘𝐴) → ((𝐴 +o 𝑑) = 𝐵 ↔ (𝐴 +o (𝐹‘𝐴)) = 𝐵))
56	55	elrab 3634	. . 3 ⊢ ((𝐹‘𝐴) ∈ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ↔ ((𝐹‘𝐴) ∈ On ∧ (𝐴 +o (𝐹‘𝐴)) = 𝐵))
57	53, 56	sylib 218	. 2 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → ((𝐹‘𝐴) ∈ On ∧ (𝐴 +o (𝐹‘𝐴)) = 𝐵))
58	57	simprd 495	1 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ 𝑁 ∈ 𝐵 ∧ 𝐴 ∈ suc suc 𝑁) → (𝐴 +o (𝐹‘𝐴)) = 𝐵)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∃!wreu 3340  {crab 3389   ∖ cdif 3886   ⊆ wss 3889  {csn 4567  ∪ cuni 4850   ↦ cmpt 5166  Ord word 6322  Oncon0 6323  suc csuc 6325  ‘cfv 6498  (class class class)co 7367  ωcom 7817  1_oc1o 8398   +_o coa 8402

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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689

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-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-en 8894  df-fin 8897

This theorem is referenced by:  fineqvnttrclselem3  35267