Theorem r1filimi 9930

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 3320	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵)))
2		eleq1 2852	. . . . . . 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 9798	. . . . . . . . 9 ⊢ Fun 𝑅1
6		eluniima 7277	. . . . . . . . 9 ⊢ (Fun 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦)))
7	5, 6	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦))
8		limord 6442	. . . . . . . . . . . 12 ⊢ (Lim 𝐵 → Ord 𝐵)
9		ordsson 7821	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → 𝐵 ⊆ On)
10	8, 9	syl 18	. . . . . . . . . . 11 ⊢ (Lim 𝐵 → 𝐵 ⊆ On)
11	10	sseld 3912	. . . . . . . . . 10 ⊢ (Lim 𝐵 → (𝑦 ∈ 𝐵 → 𝑦 ∈ On))
12	11	anim1d 623	. . . . . . . . 9 ⊢ (Lim 𝐵 → ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑦)) → (𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1‘𝑦))))
13	12	reximdv2 3176	. . . . . . . 8 ⊢ (Lim 𝐵 → (∃𝑦 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑦) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
14	7, 13	biimtrid 245	. . . . . . 7 ⊢ (Lim 𝐵 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
15	14	ralimdv 3180	. . . . . 6 ⊢ (Lim 𝐵 → (∀𝑥 ∈ 𝑎 𝑥 ∈ ∪ (𝑅1 “ 𝐵) → ∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦)))
16		vex 3458	. . . . . . . 8 ⊢ 𝑎 ∈ V
17	16	tz9.12 9824	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑎 ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘𝑦) → ∃𝑦 ∈ On 𝑎 ∈ (𝑅1‘𝑦))
18		eluniima 7277	. . . . . . . 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 3521	. . . 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 7277	. . . . . . . . 9 ⊢ (Fun 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧)))
28	5, 27	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ (𝑅1 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧))
29		df-rex 3091	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐵 𝑥 ∈ (𝑅1‘𝑧) ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)))
30		rankr1ai 9833	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑅1‘𝑧) → (rank‘𝑥) ∈ 𝑧)
31		ordtr1 6425	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → (((rank‘𝑥) ∈ 𝑧 ∧ 𝑧 ∈ 𝐵) → (rank‘𝑥) ∈ 𝐵))
32	30, 31	sylani 616	. . . . . . . . . . 11 ⊢ (Ord 𝐵 → ((𝑥 ∈ (𝑅1‘𝑧) ∧ 𝑧 ∈ 𝐵) → (rank‘𝑥) ∈ 𝐵))
33	32	ancomsd 471	. . . . . . . . . 10 ⊢ (Ord 𝐵 → ((𝑧 ∈ 𝐵 ∧ 𝑥 ∈ (𝑅1‘𝑧)) → (rank‘𝑥) ∈ 𝐵))
34	33	exlimdv 1968	. . . . . . . . 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 3180	. . . . . 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 9929	. . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ∈ ∪ (𝑅1 “ On)) ∧ (∀𝑥 ∈ 𝐴 (rank‘𝑥) ∈ 𝐵 ∧ Lim 𝐵)) → (rank‘𝐴) ∈ 𝐵)
42	26, 24, 40, 25, 41	syl22anc 852	. 2 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → (rank‘𝐴) ∈ 𝐵)
43		fveq2 6908	. . . . 5 ⊢ (𝑤 = suc (rank‘𝐴) → (𝑅1‘𝑤) = (𝑅1‘suc (rank‘𝐴)))
44	43	eleq2d 2850	. . . 4 ⊢ (𝑤 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1‘𝑤) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
45		limsuc 7884	. . . . . 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 9835	. . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
49	48	3ad2ant1 1151	. . . 4 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
50	44, 47, 49	rspcedvdw 3583	. . 3 ⊢ ((𝐴 ∈ ∪ (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → ∃𝑤 ∈ 𝐵 𝐴 ∈ (𝑅1‘𝑤))
51		eluniima 7277	. . . 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 1399	1 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ (𝑅1 “ 𝐵) ∧ Lim 𝐵) → 𝐴 ∈ ∪ (𝑅1 “ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∪ cuni 4870   “ cima 5658  Ord word 6379  Oncon0 6380  Lim wlim 6381  suc csuc 6382  Fun wfun 6552  ‘cfv 6558  Fincfn 9001  𝑅₁cr1 9793  rankcrnk 9794

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-en 9002  df-dom 9003  df-fin 9005  df-r1 9795  df-rank 9796

This theorem is used by:  elhf4  9939  r1filim  35813