Theorem fineqvnttrclselem1 35265

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

Assertion

Ref	Expression
fineqvnttrclselem1	⊢ (𝐵 ∈ (ω ∖ 1o) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)

Distinct variable groups:   𝐴,𝑑   𝐵,𝑑

Proof of Theorem fineqvnttrclselem1

Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifi 4071	. . 3 ⊢ (𝐵 ∈ (ω ∖ 1o) → 𝐵 ∈ ω)
2		eleq1 2824	. . . . . . . . . . . 12 ⊢ ((𝐴 +o 𝑑) = 𝐵 → ((𝐴 +o 𝑑) ∈ ω ↔ 𝐵 ∈ ω))
3	2	biimparc 479	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ω ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 +o 𝑑) ∈ ω)
4	3	adantll 715	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 +o 𝑑) ∈ ω)
5	4	3adant2 1132	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 +o 𝑑) ∈ ω)
6		nnarcl 8552	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑑 ∈ On) → ((𝐴 +o 𝑑) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝑑 ∈ ω)))
7	6	adantlr 716	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On) → ((𝐴 +o 𝑑) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝑑 ∈ ω)))
8	7	3adant3 1133	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → ((𝐴 +o 𝑑) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝑑 ∈ ω)))
9	5, 8	mpbid 232	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 ∈ ω ∧ 𝑑 ∈ ω))
10	9	simprd 495	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → 𝑑 ∈ ω)
11	10	rabssdv 4014	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ⊆ ω)
12		nnon 7823	. . . . . . 7 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On)
13		oawordeu 8490	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
14		reusn 4671	. . . . . . . . 9 ⊢ (∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 ↔ ∃𝑤{𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤})
15		snfi 8990	. . . . . . . . . . 11 ⊢ {𝑤} ∈ Fin
16		eleq1 2824	. . . . . . . . . . 11 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤} → ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin ↔ {𝑤} ∈ Fin))
17	15, 16	mpbiri 258	. . . . . . . . . 10 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤} → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
18	17	exlimiv 1932	. . . . . . . . 9 ⊢ (∃𝑤{𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤} → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
19	14, 18	sylbi 217	. . . . . . . 8 ⊢ (∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
20	13, 19	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
21	12, 20	sylanl2 682	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝐴 ⊆ 𝐵) → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
22		nnunifi 9201	. . . . . 6 ⊢ (({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ⊆ ω ∧ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
23	11, 21, 22	syl2an2r 686	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝐴 ⊆ 𝐵) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
24		oawordex 8492	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵))
25	12, 24	sylan2 594	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵))
26	25	notbid 318	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (¬ 𝐴 ⊆ 𝐵 ↔ ¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵))
27	26	biimpa 476	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
28		ralnex 3063	. . . . . . 7 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 ↔ ¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
29		rabeq0 4328	. . . . . . . . . . 11 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∅ ↔ ∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵)
30	29	biimpri 228	. . . . . . . . . 10 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∅)
31	30	unieqd 4863	. . . . . . . . 9 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∪ ∅)
32		uni0 4878	. . . . . . . . 9 ⊢ ∪ ∅ = ∅
33	31, 32	eqtrdi 2787	. . . . . . . 8 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∅)
34		peano1 7840	. . . . . . . 8 ⊢ ∅ ∈ ω
35	33, 34	eqeltrdi 2844	. . . . . . 7 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
36	28, 35	sylbir 235	. . . . . 6 ⊢ (¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
37	27, 36	syl 17	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ ¬ 𝐴 ⊆ 𝐵) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
38	23, 37	pm2.61dan 813	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
39	38	expcom 413	. . 3 ⊢ (𝐵 ∈ ω → (𝐴 ∈ On → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω))
40	1, 39	syl 17	. 2 ⊢ (𝐵 ∈ (ω ∖ 1o) → (𝐴 ∈ On → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω))
41		simpl 482	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝑑 ∈ On) → 𝐴 ∈ On)
42		df-oadd 8409	. . . . . . . 8 ⊢ +o = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦))
43	42	mpondm0 7607	. . . . . . 7 ⊢ (¬ (𝐴 ∈ On ∧ 𝑑 ∈ On) → (𝐴 +o 𝑑) = ∅)
44	41, 43	nsyl5 159	. . . . . 6 ⊢ (¬ 𝐴 ∈ On → (𝐴 +o 𝑑) = ∅)
45		eldifsnneq 4736	. . . . . . 7 ⊢ (𝐵 ∈ (ω ∖ {∅}) → ¬ 𝐵 = ∅)
46		df1o2 8412	. . . . . . . 8 ⊢ 1o = {∅}
47	46	difeq2i 4063	. . . . . . 7 ⊢ (ω ∖ 1o) = (ω ∖ {∅})
48	45, 47	eleq2s 2854	. . . . . 6 ⊢ (𝐵 ∈ (ω ∖ 1o) → ¬ 𝐵 = ∅)
49		eqtr2 2757	. . . . . . 7 ⊢ (((𝐴 +o 𝑑) = 𝐵 ∧ (𝐴 +o 𝑑) = ∅) → 𝐵 = ∅)
50	49	stoic1b 1775	. . . . . 6 ⊢ (((𝐴 +o 𝑑) = ∅ ∧ ¬ 𝐵 = ∅) → ¬ (𝐴 +o 𝑑) = 𝐵)
51	44, 48, 50	syl2anr 598	. . . . 5 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ ¬ 𝐴 ∈ On) → ¬ (𝐴 +o 𝑑) = 𝐵)
52	51	ralrimivw 3133	. . . 4 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ ¬ 𝐴 ∈ On) → ∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵)
53	52, 35	syl 17	. . 3 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ ¬ 𝐴 ∈ On) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
54	53	ex 412	. 2 ⊢ (𝐵 ∈ (ω ∖ 1o) → (¬ 𝐴 ∈ On → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω))
55	40, 54	pm2.61d 179	1 ⊢ (𝐵 ∈ (ω ∖ 1o) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3051  ∃wrex 3061  ∃!wreu 3340  {crab 3389  Vcvv 3429   ∖ cdif 3886   ⊆ wss 3889  ∅c0 4273  {csn 4567  ∪ cuni 4850   ↦ cmpt 5166  Oncon0 6323  suc csuc 6325  ‘cfv 6498  (class class class)co 7367  ωcom 7817  reccrdg 8348  1_oc1o 8398   +_o coa 8402  Fincfn 8893

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:  fineqvnttrclselem2  35266  fineqvnttrclselem3  35267  fineqvnttrclse  35268