Theorem r1filimi 35259

Description: If all elements in a finite set appear in the cumulative hierarchy prior to a limit ordinal, then that set also appears in the cumulative hierarchy prior to the limit ordinal. (Contributed by BTernaryTau, 19-Jan-2026.)

Assertion

Ref	Expression
r1filimi	⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem r1filimi

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

Step	Hyp	Ref	Expression
1		raleq 3293	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵)))
2		eleq1 2824	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑎 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ∈ ∪ (𝑅1 “ On)))
3	1, 2	imbi12d 344	. . . . . 6 ⊢ (𝑎 = 𝐴 → ((∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝑎 ∈ ∪ (𝑅1 “ On)) ↔ (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))))
4	3	imbi2d 340	. . . . 5 ⊢ (𝑎 = 𝐴 → ((Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝑎 ∈ ∪ (𝑅1 “ On))) ↔ (Lim 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)))))
5		r1funlim 9678	. . . . . . . . . 10 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1)
6	5	simpli 483	. . . . . . . . 9 ⊢ Fun 𝑅1
7		eluniima 7196	. . . . . . . . 9 ⊢ (Fun 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦)))
8	6, 7	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦))
9		limord 6378	. . . . . . . . . . . 12 ⊢ (Lim 𝐵 → Ord 𝐵)
10		ordsson 7728	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → 𝐵 ⊆ On)
11	9, 10	syl 17	. . . . . . . . . . 11 ⊢ (Lim 𝐵 → 𝐵 ⊆ On)
12	11	sseld 3932	. . . . . . . . . 10 ⊢ (Lim 𝐵 → (𝑦 ∈ 𝐵 → 𝑦 ∈ On))
13	12	anim1d 611	. . . . . . . . 9 ⊢ (Lim 𝐵 → ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑦)) → (𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1‘𝑦))))
14	13	reximdv2 3146	. . . . . . . 8 ⊢ (Lim 𝐵 → (∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
15	8, 14	biimtrid 242	. . . . . . 7 ⊢ (Lim 𝐵 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
16	15	ralimdv 3150	. . . . . 6 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
17		vex 3444	. . . . . . . 8 ⊢ 𝑎 ∈ V
18	17	tz9.12 9702	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦) → ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦))
19		eluniima 7196	. . . . . . . 8 ⊢ (Fun 𝑅1 → (𝑎 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦)))
20	6, 19	ax-mp 5	. . . . . . 7 ⊢ (𝑎 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦))
21	18, 20	sylibr 234	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦) → 𝑎 ∈ ∪ (𝑅1 “ On))
22	16, 21	syl6 35	. . . . 5 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝑎 ∈ ∪ (𝑅1 “ On)))
23	4, 22	vtoclg 3511	. . . 4 ⊢ (𝐴 ∈ Fin → (Lim 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))))
24	23	impcomd 411	. . 3 ⊢ (𝐴 ∈ Fin → ((∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)))
25	24	3impib 1116	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
26		simp3 1138	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → Lim 𝐵)
27		simp1 1136	. . 3 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ Fin)
28		eluniima 7196	. . . . . . . . 9 ⊢ (Fun 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧)))
29	6, 28	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧))
30		df-rex 3061	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧) ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)))
31		rankr1ai 9710	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑅1‘𝑧) → (rank‘𝑥) ∈ 𝑧)
32		ordtr1 6361	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → (((rank‘𝑥) ∈ 𝑧 ∧ 𝑧 ∈ 𝐵) → (rank‘𝑥) ∈ 𝐵))
33	31, 32	sylani 604	. . . . . . . . . . 11 ⊢ (Ord 𝐵 → ((𝑥 ∈ (𝑅1‘𝑧) ∧ 𝑧 ∈ 𝐵) → (rank‘𝑥) ∈ 𝐵))
34	33	ancomsd 465	. . . . . . . . . 10 ⊢ (Ord 𝐵 → ((𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝐵))
35	34	exlimdv 1934	. . . . . . . . 9 ⊢ (Ord 𝐵 → (∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝐵))
36	30, 35	biimtrid 242	. . . . . . . 8 ⊢ (Ord 𝐵 → (∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧) → (rank‘𝑥) ∈ 𝐵))
37	29, 36	biimtrid 242	. . . . . . 7 ⊢ (Ord 𝐵 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) → (rank‘𝑥) ∈ 𝐵))
38	37	ralimdv 3150	. . . . . 6 ⊢ (Ord 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵))
39	9, 38	syl 17	. . . . 5 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵))
40	39	impcom 407	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵)
41	40	3adant1 1130	. . 3 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵)
42		rankfilimbi 35257	. . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ∈ ∪ (𝑅1 “ On)) ∧ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵 ∧ Lim 𝐵)) → (rank‘𝐴) ∈ 𝐵)
43	27, 25, 41, 26, 42	syl22anc 838	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → (rank‘𝐴) ∈ 𝐵)
44		fveq2 6834	. . . . 5 ⊢ (𝑤 = suc (rank‘𝐴) → (𝑅1‘𝑤) = (𝑅1‘suc (rank‘𝐴)))
45	44	eleq2d 2822	. . . 4 ⊢ (𝑤 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1‘𝑤) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
46		limsuc 7791	. . . . . 6 ⊢ (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
47	46	biimpa 476	. . . . 5 ⊢ ((Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
48	47	3adant1 1130	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
49		rankidb 9712	. . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
50	49	3ad2ant1 1133	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
51	45, 48, 50	rspcedvdw 3579	. . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤))
52		eluniima 7196	. . . 4 ⊢ (Fun 𝑅1 → (𝐴 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤)))
53	6, 52	ax-mp 5	. . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤))
54	51, 53	sylibr 234	. 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ 𝐵))
55	25, 26, 43, 54	syl3anc 1373	1 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541  ∃wex 1780   ∈ wcel 2113  ∀wral 3051  ∃wrex 3060   ⊆ wss 3901  ∪ cuni 4863  dom cdm 5624   “ cima 5627  Ord word 6316  Oncon0 6317  Lim wlim 6318  suc csuc 6319  Fun wfun 6486  ‘cfv 6492  Fincfn 8883  𝑅₁cr1 9674  rankcrnk 9675

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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

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-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 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-en 8884  df-dom 8885  df-fin 8887  df-r1 9676  df-rank 9677

This theorem is referenced by:  r1filim  35260  r1omhf  35262