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 35363
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 3316 . . . . . . 7 (𝑎 = 𝐴 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) ↔ ∀𝑥𝐴 𝑥 (𝑅1𝐵)))
2 eleq1 2849 . . . . . . 7 (𝑎 = 𝐴 → (𝑎 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On)))
31, 2imbi12d 346 . . . . . 6 (𝑎 = 𝐴 → ((∀𝑥𝑎 𝑥 (𝑅1𝐵) → 𝑎 (𝑅1 “ On)) ↔ (∀𝑥𝐴 𝑥 (𝑅1𝐵) → 𝐴 (𝑅1 “ On))))
43imbi2d 342 . . . . 5 (𝑎 = 𝐴 → ((Lim 𝐵 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) → 𝑎 (𝑅1 “ On))) ↔ (Lim 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → 𝐴 (𝑅1 “ On)))))
5 r1funlim 9721 . . . . . . . . . 10 (Fun 𝑅1 ∧ Lim dom 𝑅1)
65simpli 487 . . . . . . . . 9 Fun 𝑅1
7 eluniima 7230 . . . . . . . . 9 (Fun 𝑅1 → (𝑥 (𝑅1𝐵) ↔ ∃𝑦𝐵 𝑥 ∈ (𝑅1𝑦)))
86, 7ax-mp 5 . . . . . . . 8 (𝑥 (𝑅1𝐵) ↔ ∃𝑦𝐵 𝑥 ∈ (𝑅1𝑦))
9 limord 6403 . . . . . . . . . . . 12 (Lim 𝐵 → Ord 𝐵)
10 ordsson 7762 . . . . . . . . . . . 12 (Ord 𝐵𝐵 ⊆ On)
119, 10syl 17 . . . . . . . . . . 11 (Lim 𝐵𝐵 ⊆ On)
1211sseld 3935 . . . . . . . . . 10 (Lim 𝐵 → (𝑦𝐵𝑦 ∈ On))
1312anim1d 620 . . . . . . . . 9 (Lim 𝐵 → ((𝑦𝐵𝑥 ∈ (𝑅1𝑦)) → (𝑦 ∈ On ∧ 𝑥 ∈ (𝑅1𝑦))))
1413reximdv2 3171 . . . . . . . 8 (Lim 𝐵 → (∃𝑦𝐵 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦)))
158, 14biimtrid 244 . . . . . . 7 (Lim 𝐵 → (𝑥 (𝑅1𝐵) → ∃𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦)))
1615ralimdv 3175 . . . . . 6 (Lim 𝐵 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) → ∀𝑥𝑎𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦)))
17 vex 3457 . . . . . . . 8 𝑎 ∈ V
1817tz9.12 9745 . . . . . . 7 (∀𝑥𝑎𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝑎 ∈ (𝑅1𝑦))
19 eluniima 7230 . . . . . . . 8 (Fun 𝑅1 → (𝑎 (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1𝑦)))
206, 19ax-mp 5 . . . . . . 7 (𝑎 (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑎 ∈ (𝑅1𝑦))
2118, 20sylibr 236 . . . . . 6 (∀𝑥𝑎𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝑎 (𝑅1 “ On))
2216, 21syl6 35 . . . . 5 (Lim 𝐵 → (∀𝑥𝑎 𝑥 (𝑅1𝐵) → 𝑎 (𝑅1 “ On)))
234, 22vtoclg 3521 . . . 4 (𝐴 ∈ Fin → (Lim 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → 𝐴 (𝑅1 “ On))))
2423impcomd 415 . . 3 (𝐴 ∈ Fin → ((∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 (𝑅1 “ On)))
25243impib 1128 . 2 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 (𝑅1 “ On))
26 simp3 1150 . 2 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → Lim 𝐵)
27 simp1 1148 . . 3 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 ∈ Fin)
28 eluniima 7230 . . . . . . . . 9 (Fun 𝑅1 → (𝑥 (𝑅1𝐵) ↔ ∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧)))
296, 28ax-mp 5 . . . . . . . 8 (𝑥 (𝑅1𝐵) ↔ ∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧))
30 df-rex 3086 . . . . . . . . 9 (∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧) ↔ ∃𝑧(𝑧𝐵𝑥 ∈ (𝑅1𝑧)))
31 rankr1ai 9753 . . . . . . . . . . . 12 (𝑥 ∈ (𝑅1𝑧) → (rank‘𝑥) ∈ 𝑧)
32 ordtr1 6386 . . . . . . . . . . . 12 (Ord 𝐵 → (((rank‘𝑥) ∈ 𝑧𝑧𝐵) → (rank‘𝑥) ∈ 𝐵))
3331, 32sylani 613 . . . . . . . . . . 11 (Ord 𝐵 → ((𝑥 ∈ (𝑅1𝑧) ∧ 𝑧𝐵) → (rank‘𝑥) ∈ 𝐵))
3433ancomsd 469 . . . . . . . . . 10 (Ord 𝐵 → ((𝑧𝐵𝑥 ∈ (𝑅1𝑧)) → (rank‘𝑥) ∈ 𝐵))
3534exlimdv 1952 . . . . . . . . 9 (Ord 𝐵 → (∃𝑧(𝑧𝐵𝑥 ∈ (𝑅1𝑧)) → (rank‘𝑥) ∈ 𝐵))
3630, 35biimtrid 244 . . . . . . . 8 (Ord 𝐵 → (∃𝑧𝐵 𝑥 ∈ (𝑅1𝑧) → (rank‘𝑥) ∈ 𝐵))
3729, 36biimtrid 244 . . . . . . 7 (Ord 𝐵 → (𝑥 (𝑅1𝐵) → (rank‘𝑥) ∈ 𝐵))
3837ralimdv 3175 . . . . . 6 (Ord 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵))
399, 38syl 17 . . . . 5 (Lim 𝐵 → (∀𝑥𝐴 𝑥 (𝑅1𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵))
4039impcom 411 . . . 4 ((∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵)
41403adant1 1142 . . 3 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → ∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵)
42 rankfilimbi 35361 . . 3 (((𝐴 ∈ Fin ∧ 𝐴 (𝑅1 “ On)) ∧ (∀𝑥𝐴 (rank‘𝑥) ∈ 𝐵 ∧ Lim 𝐵)) → (rank‘𝐴) ∈ 𝐵)
4327, 25, 41, 26, 42syl22anc 849 . 2 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → (rank‘𝐴) ∈ 𝐵)
44 fveq2 6863 . . . . 5 (𝑤 = suc (rank‘𝐴) → (𝑅1𝑤) = (𝑅1‘suc (rank‘𝐴)))
4544eleq2d 2847 . . . 4 (𝑤 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1𝑤) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
46 limsuc 7825 . . . . . 6 (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
4746biimpa 480 . . . . 5 ((Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
48473adant1 1142 . . . 4 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → suc (rank‘𝐴) ∈ 𝐵)
49 rankidb 9755 . . . . 5 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
50493ad2ant1 1145 . . . 4 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
5145, 48, 50rspcedvdw 3584 . . 3 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → ∃𝑤𝐵 𝐴 ∈ (𝑅1𝑤))
52 eluniima 7230 . . . 4 (Fun 𝑅1 → (𝐴 (𝑅1𝐵) ↔ ∃𝑤𝐵 𝐴 ∈ (𝑅1𝑤)))
536, 52ax-mp 5 . . 3 (𝐴 (𝑅1𝐵) ↔ ∃𝑤𝐵 𝐴 ∈ (𝑅1𝑤))
5451, 53sylibr 236 . 2 ((𝐴 (𝑅1 “ On) ∧ Lim 𝐵 ∧ (rank‘𝐴) ∈ 𝐵) → 𝐴 (𝑅1𝐵))
5525, 26, 43, 54syl3anc 1389 1 ((𝐴 ∈ Fin ∧ ∀𝑥𝐴 𝑥 (𝑅1𝐵) ∧ Lim 𝐵) → 𝐴 (𝑅1𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1097   = wceq 1559  wex 1798  wcel 2141  wral 3075  wrex 3085  wss 3904   cuni 4864  dom cdm 5645  cima 5648  Ord word 6341  Oncon0 6342  Lim wlim 6343  suc csuc 6344  Fun wfun 6511  cfv 6517  Fincfn 8923  𝑅1cr1 9717  rankcrnk 9718
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-om 7843  df-1st 7966  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376  df-1o 8432  df-en 8924  df-dom 8925  df-fin 8927  df-r1 9719  df-rank 9720
This theorem is referenced by:  r1filim  35364  r1omhf  35366
  Copyright terms: Public domain W3C validator