Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rankung Structured version   Visualization version   GIF version

Theorem rankung 36348
Description: The rank of the union of two sets. Closed form of rankun 9780. (Contributed by Scott Fenton, 15-Jul-2015.)
Assertion
Ref Expression
rankung ((𝐴𝑉𝐵𝑊) → (rank‘(𝐴𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)))

Proof of Theorem rankung
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uneq1 4102 . . . 4 (𝑥 = 𝐴 → (𝑥𝑦) = (𝐴𝑦))
21fveq2d 6845 . . 3 (𝑥 = 𝐴 → (rank‘(𝑥𝑦)) = (rank‘(𝐴𝑦)))
3 fveq2 6841 . . . 4 (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
43uneq1d 4108 . . 3 (𝑥 = 𝐴 → ((rank‘𝑥) ∪ (rank‘𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦)))
52, 4eqeq12d 2753 . 2 (𝑥 = 𝐴 → ((rank‘(𝑥𝑦)) = ((rank‘𝑥) ∪ (rank‘𝑦)) ↔ (rank‘(𝐴𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦))))
6 uneq2 4103 . . . 4 (𝑦 = 𝐵 → (𝐴𝑦) = (𝐴𝐵))
76fveq2d 6845 . . 3 (𝑦 = 𝐵 → (rank‘(𝐴𝑦)) = (rank‘(𝐴𝐵)))
8 fveq2 6841 . . . 4 (𝑦 = 𝐵 → (rank‘𝑦) = (rank‘𝐵))
98uneq2d 4109 . . 3 (𝑦 = 𝐵 → ((rank‘𝐴) ∪ (rank‘𝑦)) = ((rank‘𝐴) ∪ (rank‘𝐵)))
107, 9eqeq12d 2753 . 2 (𝑦 = 𝐵 → ((rank‘(𝐴𝑦)) = ((rank‘𝐴) ∪ (rank‘𝑦)) ↔ (rank‘(𝐴𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵))))
11 vex 3434 . . 3 𝑥 ∈ V
12 vex 3434 . . 3 𝑦 ∈ V
1311, 12rankun 9780 . 2 (rank‘(𝑥𝑦)) = ((rank‘𝑥) ∪ (rank‘𝑦))
145, 10, 13vtocl2g 3518 1 ((𝐴𝑉𝐵𝑊) → (rank‘(𝐴𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  cun 3888  cfv 6499  rankcrnk 9687
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689  ax-reg 9507  ax-inf2 9562
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6266  df-ord 6327  df-on 6328  df-lim 6329  df-suc 6330  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-r1 9688  df-rank 9689
This theorem is referenced by:  hfun  36360
  Copyright terms: Public domain W3C validator