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

Theorem rankelpr 9863
Description: Rank membership is inherited by unordered pairs. (Contributed by NM, 18-Sep-2006.) (Revised by Mario Carneiro, 17-Nov-2014.)
Hypotheses
Ref Expression
rankelun.1 𝐴 ∈ V
rankelun.2 𝐵 ∈ V
rankelun.3 𝐶 ∈ V
rankelun.4 𝐷 ∈ V
Assertion
Ref Expression
rankelpr (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘{𝐴, 𝐵}) ∈ (rank‘{𝐶, 𝐷}))

Proof of Theorem rankelpr
StepHypRef Expression
1 rankelun.1 . . . . 5 𝐴 ∈ V
2 rankelun.2 . . . . 5 𝐵 ∈ V
3 rankelun.3 . . . . 5 𝐶 ∈ V
4 rankelun.4 . . . . 5 𝐷 ∈ V
51, 2, 3, 4rankelun 9862 . . . 4 (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘(𝐴𝐵)) ∈ (rank‘(𝐶𝐷)))
61, 2rankun 9846 . . . 4 (rank‘(𝐴𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵))
73, 4rankun 9846 . . . 4 (rank‘(𝐶𝐷)) = ((rank‘𝐶) ∪ (rank‘𝐷))
85, 6, 73eltr3g 2841 . . 3 (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷)))
9 rankon 9785 . . . . . 6 (rank‘𝐶) ∈ On
10 rankon 9785 . . . . . 6 (rank‘𝐷) ∈ On
119, 10onun2i 6476 . . . . 5 ((rank‘𝐶) ∪ (rank‘𝐷)) ∈ On
1211onordi 6465 . . . 4 Ord ((rank‘𝐶) ∪ (rank‘𝐷))
13 ordsucelsuc 7803 . . . 4 (Ord ((rank‘𝐶) ∪ (rank‘𝐷)) → (((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷)) ↔ suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷))))
1412, 13ax-mp 5 . . 3 (((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ((rank‘𝐶) ∪ (rank‘𝐷)) ↔ suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷)))
158, 14sylib 217 . 2 (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → suc ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ suc ((rank‘𝐶) ∪ (rank‘𝐷)))
161, 2rankpr 9847 . 2 (rank‘{𝐴, 𝐵}) = suc ((rank‘𝐴) ∪ (rank‘𝐵))
173, 4rankpr 9847 . 2 (rank‘{𝐶, 𝐷}) = suc ((rank‘𝐶) ∪ (rank‘𝐷))
1815, 16, 173eltr4g 2842 1 (((rank‘𝐴) ∈ (rank‘𝐶) ∧ (rank‘𝐵) ∈ (rank‘𝐷)) → (rank‘{𝐴, 𝐵}) ∈ (rank‘{𝐶, 𝐷}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wcel 2098  Vcvv 3466  cun 3938  {cpr 4622  Ord word 6353  suc csuc 6356  cfv 6533  rankcrnk 9753
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718  ax-reg 9582  ax-inf2 9631
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3959  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-int 4941  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-tr 5256  df-id 5564  df-eprel 5570  df-po 5578  df-so 5579  df-fr 5621  df-we 5623  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6290  df-ord 6357  df-on 6358  df-lim 6359  df-suc 6360  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7404  df-om 7849  df-2nd 7969  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-rdg 8405  df-r1 9754  df-rank 9755
This theorem is referenced by:  rankelop  9864
  Copyright terms: Public domain W3C validator