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

Theorem rankelb 9893
Description: The membership relation is inherited by the rank function. Proposition 9.16 of [TakeutiZaring] p. 79. (Contributed by NM, 4-Oct-2003.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
rankelb (𝐵 (𝑅1 “ On) → (𝐴𝐵 → (rank‘𝐴) ∈ (rank‘𝐵)))

Proof of Theorem rankelb
StepHypRef Expression
1 r1elssi 9874 . . . . . 6 (𝐵 (𝑅1 “ On) → 𝐵 (𝑅1 “ On))
21sseld 4007 . . . . 5 (𝐵 (𝑅1 “ On) → (𝐴𝐵𝐴 (𝑅1 “ On)))
3 rankidn 9891 . . . . 5 (𝐴 (𝑅1 “ On) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))
42, 3syl6 35 . . . 4 (𝐵 (𝑅1 “ On) → (𝐴𝐵 → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
54imp 406 . . 3 ((𝐵 (𝑅1 “ On) ∧ 𝐴𝐵) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))
6 rankon 9864 . . . . 5 (rank‘𝐵) ∈ On
7 rankon 9864 . . . . 5 (rank‘𝐴) ∈ On
8 ontri1 6429 . . . . 5 (((rank‘𝐵) ∈ On ∧ (rank‘𝐴) ∈ On) → ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵)))
96, 7, 8mp2an 691 . . . 4 ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵))
10 rankdmr1 9870 . . . . . 6 (rank‘𝐵) ∈ dom 𝑅1
11 rankdmr1 9870 . . . . . 6 (rank‘𝐴) ∈ dom 𝑅1
12 r1ord3g 9848 . . . . . 6 (((rank‘𝐵) ∈ dom 𝑅1 ∧ (rank‘𝐴) ∈ dom 𝑅1) → ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴))))
1310, 11, 12mp2an 691 . . . . 5 ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)))
14 r1rankidb 9873 . . . . . 6 (𝐵 (𝑅1 “ On) → 𝐵 ⊆ (𝑅1‘(rank‘𝐵)))
1514sselda 4008 . . . . 5 ((𝐵 (𝑅1 “ On) ∧ 𝐴𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐵)))
16 ssel 4002 . . . . 5 ((𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)) → (𝐴 ∈ (𝑅1‘(rank‘𝐵)) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
1713, 15, 16syl2imc 41 . . . 4 ((𝐵 (𝑅1 “ On) ∧ 𝐴𝐵) → ((rank‘𝐵) ⊆ (rank‘𝐴) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
189, 17biimtrrid 243 . . 3 ((𝐵 (𝑅1 “ On) ∧ 𝐴𝐵) → (¬ (rank‘𝐴) ∈ (rank‘𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
195, 18mt3d 148 . 2 ((𝐵 (𝑅1 “ On) ∧ 𝐴𝐵) → (rank‘𝐴) ∈ (rank‘𝐵))
2019ex 412 1 (𝐵 (𝑅1 “ On) → (𝐴𝐵 → (rank‘𝐴) ∈ (rank‘𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wcel 2108  wss 3976   cuni 4931  dom cdm 5700  cima 5703  Oncon0 6395  cfv 6573  𝑅1cr1 9831  rankcrnk 9832
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-om 7904  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-r1 9833  df-rank 9834
This theorem is referenced by:  wfelirr  9894  rankval3b  9895  rankel  9908  rankunb  9919  rankuni2b  9922  rankcf  10846
  Copyright terms: Public domain W3C validator