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

Theorem rankr1ai 9809
Description: One direction of rankr1a 9851. (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 6919 . . 3 (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1)
2 r1val1 9796 . . . . . 6 (𝐵 ∈ dom 𝑅1 → (𝑅1‘𝐵) = ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥))
32eleq2d 2846 . . . . 5 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥)))
4 eliun 4954 . . . . 5 (𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥) ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥))
53, 4bitrdi 290 . . . 4 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
6 r1dmlim 9775 . . . . . . . . . 10 Lim dom 𝑅1
7 limord 6424 . . . . . . . . . 10 (Lim dom 𝑅1 → Ord dom 𝑅1)
86, 7ax-mp 5 . . . . . . . . 9 Ord dom 𝑅1
9 ordtr1 6407 . . . . . . . . 9 (Ord dom 𝑅1 → ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1))
108, 9ax-mp 5 . . . . . . . 8 ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1)
1110ancoms 464 . . . . . . 7 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ dom 𝑅1)
12 r1sucg 9779 . . . . . . . 8 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
1312eleq2d 2846 . . . . . . 7 (𝑥 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
1411, 13syl 18 . . . . . 6 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
15 ordsson 7797 . . . . . . . . . 10 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
168, 15ax-mp 5 . . . . . . . . 9 dom 𝑅1 ⊆ On
1716, 11sselid 3906 . . . . . . . 8 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
18 rabid 3432 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ↔ (𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)))
19 intss1 4922 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2018, 19sylbir 238 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2117, 20sylan 592 . . . . . . 7 (((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2221ex 418 . . . . . 6 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2314, 22sylbird 263 . . . . 5 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝑥) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2423reximdva 3175 . . . 4 (𝐵 ∈ dom 𝑅1 → (∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
255, 24sylbid 243 . . 3 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
261, 25mpcom 39 . 2 (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
27 r1elwf 9807 . . . . . . 7 (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
28 rankvalb 9808 . . . . . . 7 (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
2927, 28syl 18 . . . . . 6 (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3029sseq1d 3939 . . . . 5 (𝐴 ∈ (𝑅1‘𝐵) → ((rank‘𝐴) ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
3130adantr 486 . . . 4 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → ((rank‘𝐴) ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
32 rankon 9806 . . . . . . 7 (rank‘𝐴) ∈ On
3316, 1sselid 3906 . . . . . . 7 (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On)
34 ontr2 6411 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → (((rank‘𝐴) ⊆ 𝑥 ∧ 𝑥 ∈ 𝐵) → (rank‘𝐴) ∈ 𝐵))
3532, 33, 34sylancr 599 . . . . . 6 (𝐴 ∈ (𝑅1‘𝐵) → (((rank‘𝐴) ⊆ 𝑥 ∧ 𝑥 ∈ 𝐵) → (rank‘𝐴) ∈ 𝐵))
3635expcomd 422 . . . . 5 (𝐴 ∈ (𝑅1‘𝐵) → (𝑥 ∈ 𝐵 → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵)))
3736imp 412 . . . 4 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3831, 37sylbird 263 . . 3 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → (∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3938rexlimdva 3163 . 2 (𝐴 ∈ (𝑅1‘𝐵) → (∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4026, 39mpd 16 1 (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  {crab 3412   ⊆ wss 3895  𝒫 cpw 4556  ∪ cuni 4866  ∩ cint 4906  ∪ ciun 4950  dom cdm 5650   “ cima 5653  Ord word 6361  Oncon0 6362  Lim wlim 6363  suc csuc 6364  ‘cfv 6538  𝑅1cr1 9769  rankcrnk 9770
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  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 7423  df-om 7878  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-r1 9771  df-rank 9772
This theorem is used by:  rankr1ag  9813  tcrank  9904  r1filimi  9906  dfac12lem1  10225  dfac12lem2  10226  r1limwun  10824  inatsk  10866  onvf1odlem4  35953  aomclem4  44152  r1rankcld  45322
  Copyright terms: Public domain W3C validator