Theorem fineqvnttrclselem1 35534

Description: Lemma for fineqvnttrclse 35537. (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 4085	. . 3 ⊢ (𝐵 ∈ (ω ∖ 1o) → 𝐵 ∈ ω)
2		eleq1 2851	. . . . . . . . . . . 12 ⊢ ((𝐴 +o 𝑑) = 𝐵 → ((𝐴 +o 𝑑) ∈ ω ↔ 𝐵 ∈ ω))
3	2	biimparc 484	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ω ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 +o 𝑑) ∈ ω)
4	3	adantll 726	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 +o 𝑑) ∈ ω)
5	4	3adant2 1149	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 +o 𝑑) ∈ ω)
6		nnarcl 8598	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑑 ∈ On) → ((𝐴 +o 𝑑) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝑑 ∈ ω)))
7	6	adantlr 727	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On) → ((𝐴 +o 𝑑) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝑑 ∈ ω)))
8	7	3adant3 1150	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → ((𝐴 +o 𝑑) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝑑 ∈ ω)))
9	5, 8	mpbid 235	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → (𝐴 ∈ ω ∧ 𝑑 ∈ ω))
10	9	simprd 500	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝑑 ∈ On ∧ (𝐴 +o 𝑑) = 𝐵) → 𝑑 ∈ ω)
11	10	rabssdv 4028	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ⊆ ω)
12		nnon 7864	. . . . . . 7 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On)
13		oawordeu 8536	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → ∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
14		reusn 4693	. . . . . . . . 9 ⊢ (∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 ↔ ∃𝑤{𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤})
15		snfi 9036	. . . . . . . . . . 11 ⊢ {𝑤} ∈ Fin
16		eleq1 2851	. . . . . . . . . . 11 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤} → ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin ↔ {𝑤} ∈ Fin))
17	15, 16	mpbiri 261	. . . . . . . . . 10 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤} → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
18	17	exlimiv 1960	. . . . . . . . 9 ⊢ (∃𝑤{𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = {𝑤} → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
19	14, 18	sylbi 220	. . . . . . . 8 ⊢ (∃!𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
20	13, 19	syl 18	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ⊆ 𝐵) → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
21	12, 20	sylanl2 693	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝐴 ⊆ 𝐵) → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin)
22		nnunifi 9247	. . . . . 6 ⊢ (({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ⊆ ω ∧ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ Fin) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
23	11, 21, 22	syl2an2r 697	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ 𝐴 ⊆ 𝐵) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
24		oawordex 8538	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵))
25	12, 24	sylan2 604	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵))
26	25	notbid 321	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (¬ 𝐴 ⊆ 𝐵 ↔ ¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵))
27	26	biimpa 481	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
28		ralnex 3091	. . . . . . 7 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 ↔ ¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵)
29		rabeq0 4345	. . . . . . . . . . 11 ⊢ ({𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∅ ↔ ∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵)
30	29	biimpri 231	. . . . . . . . . 10 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∅)
31	30	unieqd 4885	. . . . . . . . 9 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∪ ∅)
32		uni0 4901	. . . . . . . . 9 ⊢ ∪ ∅ = ∅
33	31, 32	eqtrdi 2814	. . . . . . . 8 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} = ∅)
34		peano1 7881	. . . . . . . 8 ⊢ ∅ ∈ ω
35	33, 34	eqeltrdi 2871	. . . . . . 7 ⊢ (∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
36	28, 35	sylbir 238	. . . . . 6 ⊢ (¬ ∃𝑑 ∈ On (𝐴 +o 𝑑) = 𝐵 → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
37	27, 36	syl 18	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ ω) ∧ ¬ 𝐴 ⊆ 𝐵) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
38	23, 37	pm2.61dan 824	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
39	38	expcom 418	. . 3 ⊢ (𝐵 ∈ ω → (𝐴 ∈ On → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω))
40	1, 39	syl 18	. 2 ⊢ (𝐵 ∈ (ω ∖ 1o) → (𝐴 ∈ On → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω))
41		simpl 487	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝑑 ∈ On) → 𝐴 ∈ On)
42		df-oadd 8453	. . . . . . . 8 ⊢ +o = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦))
43	42	mpondm0 7650	. . . . . . 7 ⊢ (¬ (𝐴 ∈ On ∧ 𝑑 ∈ On) → (𝐴 +o 𝑑) = ∅)
44	41, 43	nsyl5 160	. . . . . 6 ⊢ (¬ 𝐴 ∈ On → (𝐴 +o 𝑑) = ∅)
45		eldifsnneq 4759	. . . . . . 7 ⊢ (𝐵 ∈ (ω ∖ {∅}) → ¬ 𝐵 = ∅)
46		df1o2 8456	. . . . . . . 8 ⊢ 1o = {∅}
47	46	difeq2i 4078	. . . . . . 7 ⊢ (ω ∖ 1o) = (ω ∖ {∅})
48	45, 47	eleq2s 2881	. . . . . 6 ⊢ (𝐵 ∈ (ω ∖ 1o) → ¬ 𝐵 = ∅)
49		eqtr2 2784	. . . . . . 7 ⊢ (((𝐴 +o 𝑑) = 𝐵 ∧ (𝐴 +o 𝑑) = ∅) → 𝐵 = ∅)
50	49	stoic1b 1803	. . . . . 6 ⊢ (((𝐴 +o 𝑑) = ∅ ∧ ¬ 𝐵 = ∅) → ¬ (𝐴 +o 𝑑) = 𝐵)
51	44, 48, 50	syl2anr 608	. . . . 5 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ ¬ 𝐴 ∈ On) → ¬ (𝐴 +o 𝑑) = 𝐵)
52	51	ralrimivw 3161	. . . 4 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ ¬ 𝐴 ∈ On) → ∀𝑑 ∈ On ¬ (𝐴 +o 𝑑) = 𝐵)
53	52, 35	syl 18	. . 3 ⊢ ((𝐵 ∈ (ω ∖ 1o) ∧ ¬ 𝐴 ∈ On) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)
54	53	ex 417	. 2 ⊢ (𝐵 ∈ (ω ∖ 1o) → (¬ 𝐴 ∈ On → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω))
55	40, 54	pm2.61d 181	1 ⊢ (𝐵 ∈ (ω ∖ 1o) → ∪ {𝑑 ∈ On ∣ (𝐴 +o 𝑑) = 𝐵} ∈ ω)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570  ∃wex 1809   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089  ∃!wreu 3367  {crab 3416  Vcvv 3455   ∖ cdif 3902   ⊆ wss 3905  ∅c0 4286  {csn 4589  ∪ cuni 4872   ↦ cmpt 5192  Oncon0 6360  suc csuc 6362  ‘cfv 6536  (class class class)co 7410  ωcom 7858  reccrdg 8392  1_oc1o 8442   +_o coa 8446  Fincfn 8939

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-oadd 8453  df-en 8940  df-fin 8943

This theorem is referenced by:  fineqvnttrclselem2  35535  fineqvnttrclselem3  35536  fineqvnttrclse  35537