Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  r1filimi Structured version   Visualization version   GIF version

Theorem r1filimi 35475
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.
StepHypRef Expression
1 raleq 3320 . . . . . . 7 (𝑎 = 𝐴 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) ↔ ∀𝑥𝐴 𝑥 (𝑅1𝐵)))
2 eleq1 2851 . . . . . . 7 (𝑎 = 𝐴 → (𝑎 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On)))
31, 2imbi12d 347 . . . . . 6 (𝑎 = 𝐴 → ((∀𝑥𝑎 𝑥 (𝑅1𝐵) → 𝑎 (𝑅1 “ On)) ↔ (∀𝑥𝐴 𝑥 (𝑅1𝐵) → 𝐴 (𝑅1 “ On))))
43imbi2d 343 . . . . 5 (𝑎 = 𝐴 → ((Lim 𝐵 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) → 𝑎 (𝑅1 “ On))) ↔ (Lim 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → 𝐴 (𝑅1 “ On)))))
5 r1funlim 9739 . . . . . . . . . 10 (Fun 𝑅1 ∧ Lim dom 𝑅1)
65simpli 488 . . . . . . . . 9 Fun 𝑅1
7 eluniima 7250 . . . . . . . . 9 (Fun 𝑅1 → (𝑥 (𝑅1𝐵) ↔ ∃𝑦𝐵 𝑥 ∈ (𝑅1𝑦)))
86, 7ax-mp 5 . . . . . . . 8 (𝑥 (𝑅1𝐵) ↔ ∃𝑦𝐵 𝑥 ∈ (𝑅1𝑦))
9 limord 6424 . . . . . . . . . . . 12 (Lim 𝐵 → Ord 𝐵)
10 ordsson 7783 . . . . . . . . . . . 12 (Ord 𝐵𝐵 ⊆ On)
119, 10syl 18 . . . . . . . . . . 11 (Lim 𝐵𝐵 ⊆ On)
1211sseld 3937 . . . . . . . . . 10 (Lim 𝐵 → (𝑦𝐵𝑦 ∈ On))
1312anim1d 622 . . . . . . . . 9 (Lim 𝐵 → ((𝑦𝐵𝑥 ∈ (𝑅1𝑦)) → (𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦))))
1413reximdv2 3175 . . . . . . . 8 (Lim 𝐵 → (∃𝑦𝐵 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦)))
158, 14biimtrid 245 . . . . . . 7 (Lim 𝐵 → (𝑥 (𝑅1𝐵) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦)))
1615ralimdv 3179 . . . . . 6 (Lim 𝐵 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) → ∀𝑥𝑎𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦)))
17 vex 3459 . . . . . . . 8 𝑎 ∈ V
1817tz9.12 9763 . . . . . . 7 (∀𝑥𝑎𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝑎 ∈ (𝑅1𝑦))
19 eluniima 7250 . . . . . . . 8 (Fun 𝑅1 → (𝑎 (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1𝑦)))
206, 19ax-mp 5 . . . . . . 7 (𝑎 (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1𝑦))
2118, 20sylibr 237 . . . . . 6 (∀𝑥𝑎𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝑎 (𝑅1 “ On))
2216, 21syl6 36 . . . . 5 (Lim 𝐵 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) → 𝑎 (𝑅1 “ On)))
234, 22vtoclg 3523 . . . 4 (𝐴 ∈ Fin → (Lim 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → 𝐴 (𝑅1 “ On))))
2423impcomd 416 . . 3 (𝐴 ∈ Fin → ((∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 (𝑅1 “ On)))
25243impib 1134 . 2 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 (𝑅1 “ On))
26 simp3 1156 . 2 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → Lim 𝐵)
27 simp1 1154 . . 3 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 ∈ Fin)
28 eluniima 7250 . . . . . . . . 9 (Fun 𝑅1 → (𝑥 (𝑅1𝐵) ↔ ∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧)))
296, 28ax-mp 5 . . . . . . . 8 (𝑥 (𝑅1𝐵) ↔ ∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧))
30 df-rex 3090 . . . . . . . . 9 (∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧) ↔ ∃𝑧(𝑧𝐵𝑥 ∈ (𝑅1𝑧)))
31 rankr1ai 9771 . . . . . . . . . . . 12 (𝑥 ∈ (𝑅1𝑧) → (rank‘𝑥) ∈ 𝑧)
32 ordtr1 6407 . . . . . . . . . . . 12 (Ord 𝐵 → (((rank‘𝑥) ∈ 𝑧𝑧𝐵) → (rank‘𝑥) ∈ 𝐵))
3331, 32sylani 615 . . . . . . . . . . 11 (Ord 𝐵 → ((𝑥 ∈ (𝑅1𝑧) ∧ 𝑧𝐵) → (rank‘𝑥) ∈ 𝐵))
3433ancomsd 470 . . . . . . . . . 10 (Ord 𝐵 → ((𝑧𝐵𝑥 ∈ (𝑅1𝑧)) → (rank‘𝑥) ∈ 𝐵))
3534exlimdv 1963 . . . . . . . . 9 (Ord 𝐵 → (∃𝑧(𝑧𝐵𝑥 ∈ (𝑅1𝑧)) → (rank‘𝑥) ∈ 𝐵))
3630, 35biimtrid 245 . . . . . . . 8 (Ord 𝐵 → (∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧) → (rank‘𝑥) ∈ 𝐵))
3729, 36biimtrid 245 . . . . . . 7 (Ord 𝐵 → (𝑥 (𝑅1𝐵) → (rank‘𝑥) ∈ 𝐵))
3837ralimdv 3179 . . . . . 6 (Ord 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵))
399, 38syl 18 . . . . 5 (Lim 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵))
4039impcom 412 . . . 4 ((∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵)
41403adant1 1148 . . 3 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵)
42 rankfilimbi 35473 . . 3 (((𝐴 ∈ Fin ∧ 𝐴 (𝑅1 “ On)) ∧ (∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵 ∧ Lim 𝐵)) → (rank‘𝐴) ∈ 𝐵)
4327, 25, 41, 26, 42syl22anc 851 . 2 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → (rank‘𝐴) ∈ 𝐵)
44 fveq2 6883 . . . . 5 (𝑤 = suc (rank‘𝐴) → (𝑅1𝑤) = (𝑅1‘suc (rank‘𝐴)))
4544eleq2d 2849 . . . 4 (𝑤 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1𝑤) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
46 limsuc 7846 . . . . . 6 (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
4746biimpa 481 . . . . 5 ((Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
48473adant1 1148 . . . 4 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
49 rankidb 9773 . . . . 5 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
50493ad2ant1 1151 . . . 4 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
5145, 48, 50rspcedvdw 3585 . . 3 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → ∃𝑤𝐵 𝐴 ∈ (𝑅1𝑤))
52 eluniima 7250 . . . 4 (Fun 𝑅1 → (𝐴 (𝑅1𝐵) ↔ ∃𝑤𝐵 𝐴 ∈ (𝑅1𝑤)))
536, 52ax-mp 5 . . 3 (𝐴 (𝑅1𝐵) ↔ ∃𝑤𝐵 𝐴 ∈ (𝑅1𝑤))
5451, 53sylibr 237 . 2 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 (𝑅1𝐵))
5525, 26, 43, 54syl3anc 1398 1 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 (𝑅1𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1103   = wceq 1570  wex 1809  wcel 2143  wral 3079  wrex 3089  wss 3906   cuni 4873  dom cdm 5663  cima 5666  Ord word 6361  Oncon0 6362  Lim wlim 6363  suc csuc 6364  Fun wfun 6532  cfv 6538  Fincfn 8944  𝑅1cr1 9735  rankcrnk 9736
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 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
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-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-en 8945  df-dom 8946  df-fin 8948  df-r1 9737  df-rank 9738
This theorem is referenced by:  r1filim  35476  r1omhf  35478
  Copyright terms: Public domain W3C validator