MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rankr1ai Structured version   Visualization version   GIF version

Theorem rankr1ai 9566
Description: One direction of rankr1a 9604. (Contributed by Mario Carneiro, 28-May-2013.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
rankr1ai (𝐴 ∈ (𝑅1𝐵) → (rank‘𝐴) ∈ 𝐵)

Proof of Theorem rankr1ai
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elfvdm 6798 . . 3 (𝐴 ∈ (𝑅1𝐵) → 𝐵 ∈ dom 𝑅1)
2 r1val1 9554 . . . . . 6 (𝐵 ∈ dom 𝑅1 → (𝑅1𝐵) = 𝑥𝐵 𝒫 (𝑅1𝑥))
32eleq2d 2824 . . . . 5 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1𝐵) ↔ 𝐴 𝑥𝐵 𝒫 (𝑅1𝑥)))
4 eliun 4928 . . . . 5 (𝐴 𝑥𝐵 𝒫 (𝑅1𝑥) ↔ ∃𝑥𝐵 𝐴 ∈ 𝒫 (𝑅1𝑥))
53, 4bitrdi 287 . . . 4 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1𝐵) ↔ ∃𝑥𝐵 𝐴 ∈ 𝒫 (𝑅1𝑥)))
6 r1funlim 9534 . . . . . . . . . . 11 (Fun 𝑅1 ∧ Lim dom 𝑅1)
76simpri 486 . . . . . . . . . 10 Lim dom 𝑅1
8 limord 6318 . . . . . . . . . 10 (Lim dom 𝑅1 → Ord dom 𝑅1)
97, 8ax-mp 5 . . . . . . . . 9 Ord dom 𝑅1
10 ordtr1 6302 . . . . . . . . 9 (Ord dom 𝑅1 → ((𝑥𝐵𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1))
119, 10ax-mp 5 . . . . . . . 8 ((𝑥𝐵𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1)
1211ancoms 459 . . . . . . 7 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → 𝑥 ∈ dom 𝑅1)
13 r1sucg 9537 . . . . . . . 8 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1𝑥))
1413eleq2d 2824 . . . . . . 7 (𝑥 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1𝑥)))
1512, 14syl 17 . . . . . 6 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1𝑥)))
16 ordsson 7623 . . . . . . . . . 10 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
179, 16ax-mp 5 . . . . . . . . 9 dom 𝑅1 ⊆ On
1817, 12sselid 3918 . . . . . . . 8 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → 𝑥 ∈ On)
19 rabid 3308 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ↔ (𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)))
20 intss1 4894 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2119, 20sylbir 234 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2218, 21sylan 580 . . . . . . 7 (((𝐵 ∈ dom 𝑅1𝑥𝐵) ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2322ex 413 . . . . . 6 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2415, 23sylbird 259 . . . . 5 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → (𝐴 ∈ 𝒫 (𝑅1𝑥) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2524reximdva 3201 . . . 4 (𝐵 ∈ dom 𝑅1 → (∃𝑥𝐵 𝐴 ∈ 𝒫 (𝑅1𝑥) → ∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
265, 25sylbid 239 . . 3 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1𝐵) → ∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
271, 26mpcom 38 . 2 (𝐴 ∈ (𝑅1𝐵) → ∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
28 r1elwf 9564 . . . . . . 7 (𝐴 ∈ (𝑅1𝐵) → 𝐴 (𝑅1 “ On))
29 rankvalb 9565 . . . . . . 7 (𝐴 (𝑅1 “ On) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3028, 29syl 17 . . . . . 6 (𝐴 ∈ (𝑅1𝐵) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3130sseq1d 3951 . . . . 5 (𝐴 ∈ (𝑅1𝐵) → ((rank‘𝐴) ⊆ 𝑥 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
3231adantr 481 . . . 4 ((𝐴 ∈ (𝑅1𝐵) ∧ 𝑥𝐵) → ((rank‘𝐴) ⊆ 𝑥 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
33 rankon 9563 . . . . . . 7 (rank‘𝐴) ∈ On
3417, 1sselid 3918 . . . . . . 7 (𝐴 ∈ (𝑅1𝐵) → 𝐵 ∈ On)
35 ontr2 6306 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → (((rank‘𝐴) ⊆ 𝑥𝑥𝐵) → (rank‘𝐴) ∈ 𝐵))
3633, 34, 35sylancr 587 . . . . . 6 (𝐴 ∈ (𝑅1𝐵) → (((rank‘𝐴) ⊆ 𝑥𝑥𝐵) → (rank‘𝐴) ∈ 𝐵))
3736expcomd 417 . . . . 5 (𝐴 ∈ (𝑅1𝐵) → (𝑥𝐵 → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵)))
3837imp 407 . . . 4 ((𝐴 ∈ (𝑅1𝐵) ∧ 𝑥𝐵) → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3932, 38sylbird 259 . . 3 ((𝐴 ∈ (𝑅1𝐵) ∧ 𝑥𝐵) → ( {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4039rexlimdva 3211 . 2 (𝐴 ∈ (𝑅1𝐵) → (∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4127, 40mpd 15 1 (𝐴 ∈ (𝑅1𝐵) → (rank‘𝐴) ∈ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wrex 3065  {crab 3068  wss 3886  𝒫 cpw 4533   cuni 4839   cint 4879   ciun 4924  dom cdm 5584  cima 5587  Ord word 6258  Oncon0 6259  Lim wlim 6260  suc csuc 6261  Fun wfun 6420  cfv 6426  𝑅1cr1 9530  rankcrnk 9531
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5221  ax-nul 5228  ax-pow 5286  ax-pr 5350  ax-un 7578
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3071  df-rab 3073  df-v 3431  df-sbc 3716  df-csb 3832  df-dif 3889  df-un 3891  df-in 3893  df-ss 3903  df-pss 3905  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5074  df-opab 5136  df-mpt 5157  df-tr 5191  df-id 5484  df-eprel 5490  df-po 5498  df-so 5499  df-fr 5539  df-we 5541  df-xp 5590  df-rel 5591  df-cnv 5592  df-co 5593  df-dm 5594  df-rn 5595  df-res 5596  df-ima 5597  df-pred 6195  df-ord 6262  df-on 6263  df-lim 6264  df-suc 6265  df-iota 6384  df-fun 6428  df-fn 6429  df-f 6430  df-f1 6431  df-fo 6432  df-f1o 6433  df-fv 6434  df-ov 7270  df-om 7703  df-2nd 7821  df-frecs 8084  df-wrecs 8115  df-recs 8189  df-rdg 8228  df-r1 9532  df-rank 9533
This theorem is referenced by:  rankr1ag  9570  tcrank  9652  dfac12lem1  9909  dfac12lem2  9910  r1limwun  10502  inatsk  10544  aomclem4  40890  r1rankcld  41830
  Copyright terms: Public domain W3C validator