Theorem r1filimi 9884

Description: If all elements of 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 3317	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵)))
2		eleq1 2849	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑎 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ∈ ∪ (𝑅1 “ On)))
3	1, 2	imbi12d 347	. . . . . 6 ⊢ (𝑎 = 𝐴 → ((∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝑎 ∈ ∪ (𝑅1 “ On)) ↔ (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))))
4	3	imbi2d 343	. . . . 5 ⊢ (𝑎 = 𝐴 → ((Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝑎 ∈ ∪ (𝑅1 “ On))) ↔ (Lim 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)))))
5		r1fun 9755	. . . . . . . . 9 ⊢ Fun 𝑅1
6		eluniima 7246	. . . . . . . . 9 ⊢ (Fun 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦)))
7	5, 6	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦))
8		limord 6417	. . . . . . . . . . . 12 ⊢ (Lim 𝐵 → Ord 𝐵)
9		ordsson 7786	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → 𝐵 ⊆ On)
10	8, 9	syl 18	. . . . . . . . . . 11 ⊢ (Lim 𝐵 → 𝐵 ⊆ On)
11	10	sseld 3930	. . . . . . . . . 10 ⊢ (Lim 𝐵 → (𝑦 ∈ 𝐵 → 𝑦 ∈ On))
12	11	anim1d 623	. . . . . . . . 9 ⊢ (Lim 𝐵 → ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑦)) → (𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1‘𝑦))))
13	12	reximdv2 3173	. . . . . . . 8 ⊢ (Lim 𝐵 → (∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
14	7, 13	biimtrid 245	. . . . . . 7 ⊢ (Lim 𝐵 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
15	14	ralimdv 3177	. . . . . 6 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
16		vex 3455	. . . . . . . 8 ⊢ 𝑎 ∈ V
17	16	tz9.12 9780	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦) → ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦))
18		eluniima 7246	. . . . . . . 8 ⊢ (Fun 𝑅1 → (𝑎 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦)))
19	5, 18	ax-mp 5	. . . . . . 7 ⊢ (𝑎 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦))
20	17, 19	sylibr 237	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦) → 𝑎 ∈ ∪ (𝑅1 “ On))
21	15, 20	syl6 36	. . . . 5 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝑎 ∈ ∪ (𝑅1 “ On)))
22	4, 21	vtoclg 3518	. . . 4 ⊢ (𝐴 ∈ Fin → (Lim 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))))
23	22	impcomd 417	. . 3 ⊢ (𝐴 ∈ Fin → ((∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On)))
24	23	3impib 1134	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
25		simp3 1156	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → Lim 𝐵)
26		simp1 1154	. . 3 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ Fin)
27		eluniima 7246	. . . . . . . . 9 ⊢ (Fun 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧)))
28	5, 27	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧))
29		df-rex 3088	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧) ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)))
30		rankr1ai 9788	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑅1‘𝑧) → (rank‘𝑥) ∈ 𝑧)
31		ordtr1 6400	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → (((rank‘𝑥) ∈ 𝑧 ∧ 𝑧 ∈ 𝐵) → (rank‘𝑥) ∈ 𝐵))
32	30, 31	sylani 616	. . . . . . . . . . 11 ⊢ (Ord 𝐵 → ((𝑥 ∈ (𝑅1‘𝑧) ∧ 𝑧 ∈ 𝐵) → (rank‘𝑥) ∈ 𝐵))
33	32	ancomsd 471	. . . . . . . . . 10 ⊢ (Ord 𝐵 → ((𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝐵))
34	33	exlimdv 1966	. . . . . . . . 9 ⊢ (Ord 𝐵 → (∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝐵))
35	29, 34	biimtrid 245	. . . . . . . 8 ⊢ (Ord 𝐵 → (∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧) → (rank‘𝑥) ∈ 𝐵))
36	28, 35	biimtrid 245	. . . . . . 7 ⊢ (Ord 𝐵 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) → (rank‘𝑥) ∈ 𝐵))
37	36	ralimdv 3177	. . . . . 6 ⊢ (Ord 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵))
38	8, 37	syl 18	. . . . 5 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵))
39	38	impcom 413	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵)
40	39	3adant1 1148	. . 3 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → ∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵)
41		rankfilimbi 9883	. . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ∈ ∪ (𝑅1 “ On)) ∧ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵 ∧ Lim 𝐵)) → (rank‘𝐴) ∈ 𝐵)
42	26, 24, 40, 25, 41	syl22anc 852	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → (rank‘𝐴) ∈ 𝐵)
43		fveq2 6877	. . . . 5 ⊢ (𝑤 = suc (rank‘𝐴) → (𝑅1‘𝑤) = (𝑅1‘suc (rank‘𝐴)))
44	43	eleq2d 2847	. . . 4 ⊢ (𝑤 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1‘𝑤) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
45		limsuc 7849	. . . . . 6 ⊢ (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
46	45	biimpa 482	. . . . 5 ⊢ ((Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
47	46	3adant1 1148	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
48		rankidb 9790	. . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
49	48	3ad2ant1 1151	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
50	44, 47, 49	rspcedvdw 3580	. . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤))
51		eluniima 7246	. . . 4 ⊢ (Fun 𝑅1 → (𝐴 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤)))
52	5, 51	ax-mp 5	. . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤))
53	50, 52	sylibr 237	. 2 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ 𝐵))
54	24, 25, 42, 53	syl3anc 1398	1 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ⊆ wss 3899  ∪ cuni 4867   “ cima 5654  Ord word 6354  Oncon0 6355  Lim wlim 6356  suc csuc 6357  Fun wfun 6525  ‘cfv 6531  Fincfn 8957  𝑅₁cr1 9750  rankcrnk 9751

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-en 8958  df-dom 8959  df-fin 8961  df-r1 9752  df-rank 9753

This theorem is used by:  elhf4  9893  r1filim  35708