Metamath Proof Explorer


Theorem r1filimi

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)

Ref Expression
Assertion r1filimi ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → A ∈ ⋃ R1 B

Proof

Step Hyp Ref Expression
1 raleq ⊢ a = A → ∀ x ∈ a x ∈ ⋃ R1 B ↔ ∀ x ∈ A x ∈ ⋃ R1 B
2 eleq1 ⊢ a = A → a ∈ ⋃ R1 On ↔ A ∈ ⋃ R1 On
3 1 2 imbi12d ⊢ a = A → ∀ x ∈ a x ∈ ⋃ R1 B → a ∈ ⋃ R1 On ↔ ∀ x ∈ A x ∈ ⋃ R1 B → A ∈ ⋃ R1 On
4 3 imbi2d ⊢ a = A → Lim ⁡ B → ∀ x ∈ a x ∈ ⋃ R1 B → a ∈ ⋃ R1 On ↔ Lim ⁡ B → ∀ x ∈ A x ∈ ⋃ R1 B → A ∈ ⋃ R1 On
5 r1fun ⊢ Fun ⁡ R1
6 eluniima ⊢ Fun ⁡ R1 → x ∈ ⋃ R1 B ↔ ∃ y ∈ B x ∈ R1 ⁡ y
7 5 6 ax-mp ⊢ x ∈ ⋃ R1 B ↔ ∃ y ∈ B x ∈ R1 ⁡ y
8 limord ⊢ Lim ⁡ B → Ord ⁡ B
9 ordsson ⊢ Ord ⁡ B → B ⊆ On
10 8 9 syl ⊢ Lim ⁡ B → B ⊆ On
11 10 sseld ⊢ Lim ⁡ B → y ∈ B → y ∈ On
12 11 anim1d ⊢ Lim ⁡ B → y ∈ B ∧ x ∈ R1 ⁡ y → y ∈ On ∧ x ∈ R1 ⁡ y
13 12 reximdv2 ⊢ Lim ⁡ B → ∃ y ∈ B x ∈ R1 ⁡ y → ∃ y ∈ On x ∈ R1 ⁡ y
14 7 13 biimtrid ⊢ Lim ⁡ B → x ∈ ⋃ R1 B → ∃ y ∈ On x ∈ R1 ⁡ y
15 14 ralimdv ⊢ Lim ⁡ B → ∀ x ∈ a x ∈ ⋃ R1 B → ∀ x ∈ a ∃ y ∈ On x ∈ R1 ⁡ y
16 vex ⊢ a ∈ V
17 16 tz9.12 ⊢ ∀ x ∈ a ∃ y ∈ On x ∈ R1 ⁡ y → ∃ y ∈ On a ∈ R1 ⁡ y
18 eluniima ⊢ Fun ⁡ R1 → a ∈ ⋃ R1 On ↔ ∃ y ∈ On a ∈ R1 ⁡ y
19 5 18 ax-mp ⊢ a ∈ ⋃ R1 On ↔ ∃ y ∈ On a ∈ R1 ⁡ y
20 17 19 sylibr ⊢ ∀ x ∈ a ∃ y ∈ On x ∈ R1 ⁡ y → a ∈ ⋃ R1 On
21 15 20 syl6 ⊢ Lim ⁡ B → ∀ x ∈ a x ∈ ⋃ R1 B → a ∈ ⋃ R1 On
22 4 21 vtoclg ⊢ A ∈ Fin → Lim ⁡ B → ∀ x ∈ A x ∈ ⋃ R1 B → A ∈ ⋃ R1 On
23 22 impcomd ⊢ A ∈ Fin → ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → A ∈ ⋃ R1 On
24 23 3impib ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → A ∈ ⋃ R1 On
25 simp3 ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → Lim ⁡ B
26 simp1 ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → A ∈ Fin
27 eluniima ⊢ Fun ⁡ R1 → x ∈ ⋃ R1 B ↔ ∃ z ∈ B x ∈ R1 ⁡ z
28 5 27 ax-mp ⊢ x ∈ ⋃ R1 B ↔ ∃ z ∈ B x ∈ R1 ⁡ z
29 df-rex ⊢ ∃ z ∈ B x ∈ R1 ⁡ z ↔ ∃ z z ∈ B ∧ x ∈ R1 ⁡ z
30 rankr1ai ⊢ x ∈ R1 ⁡ z → rank ⁡ x ∈ z
31 ordtr1 ⊢ Ord ⁡ B → rank ⁡ x ∈ z ∧ z ∈ B → rank ⁡ x ∈ B
32 30 31 sylani ⊢ Ord ⁡ B → x ∈ R1 ⁡ z ∧ z ∈ B → rank ⁡ x ∈ B
33 32 ancomsd ⊢ Ord ⁡ B → z ∈ B ∧ x ∈ R1 ⁡ z → rank ⁡ x ∈ B
34 33 exlimdv ⊢ Ord ⁡ B → ∃ z z ∈ B ∧ x ∈ R1 ⁡ z → rank ⁡ x ∈ B
35 29 34 biimtrid ⊢ Ord ⁡ B → ∃ z ∈ B x ∈ R1 ⁡ z → rank ⁡ x ∈ B
36 28 35 biimtrid ⊢ Ord ⁡ B → x ∈ ⋃ R1 B → rank ⁡ x ∈ B
37 36 ralimdv ⊢ Ord ⁡ B → ∀ x ∈ A x ∈ ⋃ R1 B → ∀ x ∈ A rank ⁡ x ∈ B
38 8 37 syl ⊢ Lim ⁡ B → ∀ x ∈ A x ∈ ⋃ R1 B → ∀ x ∈ A rank ⁡ x ∈ B
39 38 impcom ⊢ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → ∀ x ∈ A rank ⁡ x ∈ B
40 39 3adant1 ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → ∀ x ∈ A rank ⁡ x ∈ B
41 rankfilimbi ⊢ A ∈ Fin ∧ A ∈ ⋃ R1 On ∧ ∀ x ∈ A rank ⁡ x ∈ B ∧ Lim ⁡ B → rank ⁡ A ∈ B
42 26 24 40 25 41 syl22anc ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → rank ⁡ A ∈ B
43 fveq2 ⊢ w = suc ⁡ rank ⁡ A → R1 ⁡ w = R1 ⁡ suc ⁡ rank ⁡ A
44 43 eleq2d ⊢ w = suc ⁡ rank ⁡ A → A ∈ R1 ⁡ w ↔ A ∈ R1 ⁡ suc ⁡ rank ⁡ A
45 limsuc ⊢ Lim ⁡ B → rank ⁡ A ∈ B ↔ suc ⁡ rank ⁡ A ∈ B
46 45 biimpa ⊢ Lim ⁡ B ∧ rank ⁡ A ∈ B → suc ⁡ rank ⁡ A ∈ B
47 46 3adant1 ⊢ A ∈ ⋃ R1 On ∧ Lim ⁡ B ∧ rank ⁡ A ∈ B → suc ⁡ rank ⁡ A ∈ B
48 rankidb ⊢ A ∈ ⋃ R1 On → A ∈ R1 ⁡ suc ⁡ rank ⁡ A
49 48 3ad2ant1 ⊢ A ∈ ⋃ R1 On ∧ Lim ⁡ B ∧ rank ⁡ A ∈ B → A ∈ R1 ⁡ suc ⁡ rank ⁡ A
50 44 47 49 rspcedvdw ⊢ A ∈ ⋃ R1 On ∧ Lim ⁡ B ∧ rank ⁡ A ∈ B → ∃ w ∈ B A ∈ R1 ⁡ w
51 eluniima ⊢ Fun ⁡ R1 → A ∈ ⋃ R1 B ↔ ∃ w ∈ B A ∈ R1 ⁡ w
52 5 51 ax-mp ⊢ A ∈ ⋃ R1 B ↔ ∃ w ∈ B A ∈ R1 ⁡ w
53 50 52 sylibr ⊢ A ∈ ⋃ R1 On ∧ Lim ⁡ B ∧ rank ⁡ A ∈ B → A ∈ ⋃ R1 B
54 24 25 42 53 syl3anc ⊢ A ∈ Fin ∧ ∀ x ∈ A x ∈ ⋃ R1 B ∧ Lim ⁡ B → A ∈ ⋃ R1 B