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

Theorem rankr1ai 9211
Description: One direction of rankr1a 9249. (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 6677 . . 3 (𝐴 ∈ (𝑅1𝐵) → 𝐵 ∈ dom 𝑅1)
2 r1val1 9199 . . . . . 6 (𝐵 ∈ dom 𝑅1 → (𝑅1𝐵) = 𝑥𝐵 𝒫 (𝑅1𝑥))
32eleq2d 2875 . . . . 5 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1𝐵) ↔ 𝐴 𝑥𝐵 𝒫 (𝑅1𝑥)))
4 eliun 4885 . . . . 5 (𝐴 𝑥𝐵 𝒫 (𝑅1𝑥) ↔ ∃𝑥𝐵 𝐴 ∈ 𝒫 (𝑅1𝑥))
53, 4syl6bb 290 . . . 4 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1𝐵) ↔ ∃𝑥𝐵 𝐴 ∈ 𝒫 (𝑅1𝑥)))
6 r1funlim 9179 . . . . . . . . . . 11 (Fun 𝑅1 ∧ Lim dom 𝑅1)
76simpri 489 . . . . . . . . . 10 Lim dom 𝑅1
8 limord 6218 . . . . . . . . . 10 (Lim dom 𝑅1 → Ord dom 𝑅1)
97, 8ax-mp 5 . . . . . . . . 9 Ord dom 𝑅1
10 ordtr1 6202 . . . . . . . . 9 (Ord dom 𝑅1 → ((𝑥𝐵𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1))
119, 10ax-mp 5 . . . . . . . 8 ((𝑥𝐵𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1)
1211ancoms 462 . . . . . . 7 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → 𝑥 ∈ dom 𝑅1)
13 r1sucg 9182 . . . . . . . 8 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1𝑥))
1413eleq2d 2875 . . . . . . 7 (𝑥 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1𝑥)))
1512, 14syl 17 . . . . . 6 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1𝑥)))
16 ordsson 7484 . . . . . . . . . 10 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
179, 16ax-mp 5 . . . . . . . . 9 dom 𝑅1 ⊆ On
1817, 12sseldi 3913 . . . . . . . 8 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → 𝑥 ∈ On)
19 rabid 3331 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ↔ (𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)))
20 intss1 4853 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2119, 20sylbir 238 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2218, 21sylan 583 . . . . . . 7 (((𝐵 ∈ dom 𝑅1𝑥𝐵) ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2322ex 416 . . . . . 6 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2415, 23sylbird 263 . . . . 5 ((𝐵 ∈ dom 𝑅1𝑥𝐵) → (𝐴 ∈ 𝒫 (𝑅1𝑥) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2524reximdva 3233 . . . 4 (𝐵 ∈ dom 𝑅1 → (∃𝑥𝐵 𝐴 ∈ 𝒫 (𝑅1𝑥) → ∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
265, 25sylbid 243 . . 3 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1𝐵) → ∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
271, 26mpcom 38 . 2 (𝐴 ∈ (𝑅1𝐵) → ∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
28 r1elwf 9209 . . . . . . 7 (𝐴 ∈ (𝑅1𝐵) → 𝐴 (𝑅1 “ On))
29 rankvalb 9210 . . . . . . 7 (𝐴 (𝑅1 “ On) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3028, 29syl 17 . . . . . 6 (𝐴 ∈ (𝑅1𝐵) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3130sseq1d 3946 . . . . 5 (𝐴 ∈ (𝑅1𝐵) → ((rank‘𝐴) ⊆ 𝑥 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
3231adantr 484 . . . 4 ((𝐴 ∈ (𝑅1𝐵) ∧ 𝑥𝐵) → ((rank‘𝐴) ⊆ 𝑥 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
33 rankon 9208 . . . . . . 7 (rank‘𝐴) ∈ On
3417, 1sseldi 3913 . . . . . . 7 (𝐴 ∈ (𝑅1𝐵) → 𝐵 ∈ On)
35 ontr2 6206 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → (((rank‘𝐴) ⊆ 𝑥𝑥𝐵) → (rank‘𝐴) ∈ 𝐵))
3633, 34, 35sylancr 590 . . . . . 6 (𝐴 ∈ (𝑅1𝐵) → (((rank‘𝐴) ⊆ 𝑥𝑥𝐵) → (rank‘𝐴) ∈ 𝐵))
3736expcomd 420 . . . . 5 (𝐴 ∈ (𝑅1𝐵) → (𝑥𝐵 → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵)))
3837imp 410 . . . 4 ((𝐴 ∈ (𝑅1𝐵) ∧ 𝑥𝐵) → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3932, 38sylbird 263 . . 3 ((𝐴 ∈ (𝑅1𝐵) ∧ 𝑥𝐵) → ( {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4039rexlimdva 3243 . 2 (𝐴 ∈ (𝑅1𝐵) → (∃𝑥𝐵 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4127, 40mpd 15 1 (𝐴 ∈ (𝑅1𝐵) → (rank‘𝐴) ∈ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wrex 3107  {crab 3110  wss 3881  𝒫 cpw 4497   cuni 4800   cint 4838   ciun 4881  dom cdm 5519  cima 5522  Ord word 6158  Oncon0 6159  Lim wlim 6160  suc csuc 6161  Fun wfun 6318  cfv 6324  𝑅1cr1 9175  rankcrnk 9176
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-om 7561  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-r1 9177  df-rank 9178
This theorem is referenced by:  rankr1ag  9215  tcrank  9297  dfac12lem1  9554  dfac12lem2  9555  r1limwun  10147  inatsk  10189  aomclem4  40001  r1rankcld  40939
  Copyright terms: Public domain W3C validator