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

Theorem rankelb 9857
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 9837 . . . . . 6 (𝐵 ∈ ∪ (𝑅1 “ On) → 𝐵 ⊆ ∪ (𝑅1 “ On))
21sseld 3912 . . . . 5 (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → 𝐴 ∈ ∪ (𝑅1 “ On)))
3 rankidn 9855 . . . . 5 (𝐴 ∈ ∪ (𝑅1 “ On) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))
42, 3syl6 36 . . . 4 (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
54imp 412 . . 3 ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))
6 rankon 9827 . . . . 5 (rank‘𝐵) ∈ On
7 rankon 9827 . . . . 5 (rank‘𝐴) ∈ On
8 ontri1 6412 . . . . 5 (((rank‘𝐵) ∈ On ∧ (rank‘𝐴) ∈ On) → ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵)))
96, 7, 8mp2an 705 . . . 4 ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ¬ (rank‘𝐴) ∈ (rank‘𝐵))
10 rankdmr1 9833 . . . . . 6 (rank‘𝐵) ∈ dom 𝑅1
11 rankdmr1 9833 . . . . . 6 (rank‘𝐴) ∈ dom 𝑅1
12 r1ord3g 9810 . . . . . 6 (((rank‘𝐵) ∈ dom 𝑅1 ∧ (rank‘𝐴) ∈ dom 𝑅1) → ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴))))
1310, 11, 12mp2an 705 . . . . 5 ((rank‘𝐵) ⊆ (rank‘𝐴) → (𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)))
14 r1rankidb 9836 . . . . . 6 (𝐵 ∈ ∪ (𝑅1 “ On) → 𝐵 ⊆ (𝑅1‘(rank‘𝐵)))
1514sselda 3913 . . . . 5 ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐵)))
16 ssel 3907 . . . . 5 ((𝑅1‘(rank‘𝐵)) ⊆ (𝑅1‘(rank‘𝐴)) → (𝐴 ∈ (𝑅1‘(rank‘𝐵)) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
1713, 15, 16syl2imc 42 . . . 4 ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → ((rank‘𝐵) ⊆ (rank‘𝐴) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
189, 17biimtrrid 246 . . 3 ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → (¬ (rank‘𝐴) ∈ (rank‘𝐵) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
195, 18mt3d 149 . 2 ((𝐵 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ 𝐵) → (rank‘𝐴) ∈ (rank‘𝐵))
2019ex 418 1 (𝐵 ∈ ∪ (𝑅1 “ On) → (𝐴 ∈ 𝐵 → (rank‘𝐴) ∈ (rank‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147   ⊆ wss 3900  ∪ cuni 4870  dom cdm 5655   “ cima 5658  Oncon0 6377  ‘cfv 6555  𝑅1cr1 9790  rankcrnk 9791
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-r1 9792  df-rank 9793
This theorem is used by:  wfelirr  9858  rankval3b  9860  rankel  9875  rankunb  9888  rankuni2b  9891  rankval4b  9904  rankcf  10886  rankfilimb  35809  regsfromunir1  37505  rankrelp  46143
  Copyright terms: Public domain W3C validator