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

Theorem rankprb 9274
Description: The rank of an unordered pair. Part of Exercise 30 of [Enderton] p. 207. (Contributed by Mario Carneiro, 10-Jun-2013.)
Assertion
Ref Expression
rankprb ((𝐴 (𝑅1 “ On) ∧ 𝐵 (𝑅1 “ On)) → (rank‘{𝐴, 𝐵}) = suc ((rank‘𝐴) ∪ (rank‘𝐵)))

Proof of Theorem rankprb
StepHypRef Expression
1 snwf 9232 . . . 4 (𝐴 (𝑅1 “ On) → {𝐴} ∈ (𝑅1 “ On))
2 snwf 9232 . . . 4 (𝐵 (𝑅1 “ On) → {𝐵} ∈ (𝑅1 “ On))
3 rankunb 9273 . . . 4 (({𝐴} ∈ (𝑅1 “ On) ∧ {𝐵} ∈ (𝑅1 “ On)) → (rank‘({𝐴} ∪ {𝐵})) = ((rank‘{𝐴}) ∪ (rank‘{𝐵})))
41, 2, 3syl2an 597 . . 3 ((𝐴 (𝑅1 “ On) ∧ 𝐵 (𝑅1 “ On)) → (rank‘({𝐴} ∪ {𝐵})) = ((rank‘{𝐴}) ∪ (rank‘{𝐵})))
5 ranksnb 9250 . . . 4 (𝐴 (𝑅1 “ On) → (rank‘{𝐴}) = suc (rank‘𝐴))
6 ranksnb 9250 . . . 4 (𝐵 (𝑅1 “ On) → (rank‘{𝐵}) = suc (rank‘𝐵))
7 uneq12 4133 . . . 4 (((rank‘{𝐴}) = suc (rank‘𝐴) ∧ (rank‘{𝐵}) = suc (rank‘𝐵)) → ((rank‘{𝐴}) ∪ (rank‘{𝐵})) = (suc (rank‘𝐴) ∪ suc (rank‘𝐵)))
85, 6, 7syl2an 597 . . 3 ((𝐴 (𝑅1 “ On) ∧ 𝐵 (𝑅1 “ On)) → ((rank‘{𝐴}) ∪ (rank‘{𝐵})) = (suc (rank‘𝐴) ∪ suc (rank‘𝐵)))
94, 8eqtrd 2856 . 2 ((𝐴 (𝑅1 “ On) ∧ 𝐵 (𝑅1 “ On)) → (rank‘({𝐴} ∪ {𝐵})) = (suc (rank‘𝐴) ∪ suc (rank‘𝐵)))
10 df-pr 4563 . . 3 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
1110fveq2i 6667 . 2 (rank‘{𝐴, 𝐵}) = (rank‘({𝐴} ∪ {𝐵}))
12 rankon 9218 . . . 4 (rank‘𝐴) ∈ On
1312onordi 6289 . . 3 Ord (rank‘𝐴)
14 rankon 9218 . . . 4 (rank‘𝐵) ∈ On
1514onordi 6289 . . 3 Ord (rank‘𝐵)
16 ordsucun 7534 . . 3 ((Ord (rank‘𝐴) ∧ Ord (rank‘𝐵)) → suc ((rank‘𝐴) ∪ (rank‘𝐵)) = (suc (rank‘𝐴) ∪ suc (rank‘𝐵)))
1713, 15, 16mp2an 690 . 2 suc ((rank‘𝐴) ∪ (rank‘𝐵)) = (suc (rank‘𝐴) ∪ suc (rank‘𝐵))
189, 11, 173eqtr4g 2881 1 ((𝐴 (𝑅1 “ On) ∧ 𝐵 (𝑅1 “ On)) → (rank‘{𝐴, 𝐵}) = suc ((rank‘𝐴) ∪ (rank‘𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  cun 3933  {csn 4560  {cpr 4562   cuni 4831  cima 5552  Ord word 6184  Oncon0 6185  suc csuc 6187  cfv 6349  𝑅1cr1 9185  rankcrnk 9186
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-om 7575  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-r1 9187  df-rank 9188
This theorem is referenced by:  rankopb  9275  rankpr  9280  r1limwun  10152  rankaltopb  33435
  Copyright terms: Public domain W3C validator