MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hashun Unicode version

Theorem hashun 11364
Description: The size of the union of disjoint finite sets is the sum of their sizes. (Contributed by Paul Chapman, 30-Nov-2012.) (Revised by Mario Carneiro, 15-Sep-2013.)
Assertion
Ref Expression
hashun  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  ( A  i^i  B )  =  (/) )  ->  ( # `  ( A  u.  B
) )  =  ( ( # `  A
)  +  ( # `  B ) ) )

Proof of Theorem hashun
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ficardun 7828 . . 3  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  ( A  i^i  B )  =  (/) )  ->  ( card `  ( A  u.  B
) )  =  ( ( card `  A
)  +o  ( card `  B ) ) )
21fveq2d 5529 . 2  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  ( A  i^i  B )  =  (/) )  ->  ( ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  ( A  u.  B
) ) )  =  ( ( rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  0 )  |`  om ) `  ( ( card `  A
)  +o  ( card `  B ) ) ) )
3 unfi 7124 . . . 4  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( A  u.  B
)  e.  Fin )
4 eqid 2283 . . . . 5  |-  ( rec ( ( x  e. 
_V  |->  ( x  + 
1 ) ) ,  0 )  |`  om )  =  ( rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  0 )  |`  om )
54hashgval 11340 . . . 4  |-  ( ( A  u.  B )  e.  Fin  ->  (
( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  ( A  u.  B ) ) )  =  ( # `  ( A  u.  B )
) )
63, 5syl 15 . . 3  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( ( rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  0 )  |`  om ) `  ( card `  ( A  u.  B )
) )  =  (
# `  ( A  u.  B ) ) )
763adant3 975 . 2  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  ( A  i^i  B )  =  (/) )  ->  ( ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  ( A  u.  B
) ) )  =  ( # `  ( A  u.  B )
) )
8 ficardom 7594 . . . . 5  |-  ( A  e.  Fin  ->  ( card `  A )  e. 
om )
9 ficardom 7594 . . . . 5  |-  ( B  e.  Fin  ->  ( card `  B )  e. 
om )
104hashgadd 11359 . . . . 5  |-  ( ( ( card `  A
)  e.  om  /\  ( card `  B )  e.  om )  ->  (
( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  (
( card `  A )  +o  ( card `  B
) ) )  =  ( ( ( rec ( ( x  e. 
_V  |->  ( x  + 
1 ) ) ,  0 )  |`  om ) `  ( card `  A
) )  +  ( ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  B ) ) ) )
118, 9, 10syl2an 463 . . . 4  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( ( rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  0 )  |`  om ) `  ( ( card `  A
)  +o  ( card `  B ) ) )  =  ( ( ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  A ) )  +  ( ( rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  0 )  |`  om ) `  ( card `  B
) ) ) )
124hashgval 11340 . . . . 5  |-  ( A  e.  Fin  ->  (
( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  A ) )  =  ( # `  A
) )
134hashgval 11340 . . . . 5  |-  ( B  e.  Fin  ->  (
( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  B ) )  =  ( # `  B
) )
1412, 13oveqan12d 5877 . . . 4  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( ( ( rec ( ( x  e. 
_V  |->  ( x  + 
1 ) ) ,  0 )  |`  om ) `  ( card `  A
) )  +  ( ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( card `  B ) ) )  =  ( (
# `  A )  +  ( # `  B
) ) )
1511, 14eqtrd 2315 . . 3  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( ( rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  0 )  |`  om ) `  ( ( card `  A
)  +o  ( card `  B ) ) )  =  ( ( # `  A )  +  (
# `  B )
) )
16153adant3 975 . 2  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  ( A  i^i  B )  =  (/) )  ->  ( ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  0 )  |`  om ) `  ( (
card `  A )  +o  ( card `  B
) ) )  =  ( ( # `  A
)  +  ( # `  B ) ) )
172, 7, 163eqtr3d 2323 1  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  ( A  i^i  B )  =  (/) )  ->  ( # `  ( A  u.  B
) )  =  ( ( # `  A
)  +  ( # `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   _Vcvv 2788    u. cun 3150    i^i cin 3151   (/)c0 3455    e. cmpt 4077   omcom 4656    |` cres 4691   ` cfv 5255  (class class class)co 5858   reccrdg 6422    +o coa 6476   Fincfn 6863   cardccrd 7568   0cc0 8737   1c1 8738    + caddc 8740   #chash 11337
This theorem is referenced by:  hashun2  11365  hashun3  11366  hashunsng  11367  hashssdif  11374  hashxplem  11385  hashfun  11389  hashbclem  11390  hashf1lem2  11394  climcndslem1  12308  climcndslem2  12309  phiprmpw  12844  prmreclem5  12967  4sqlem11  13002  ppidif  20401  mumul  20419  ppiub  20443  lgsquadlem2  20594  lgsquadlem3  20595  ballotlemgun  23083  ballotth  23096  subfacp1lem1  23710  subfacp1lem6  23716  vdgrun  23893  eldioph2lem1  26839
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-cnex 8793  ax-resscn 8794  ax-1cn 8795  ax-icn 8796  ax-addcl 8797  ax-addrcl 8798  ax-mulcl 8799  ax-mulrcl 8800  ax-mulcom 8801  ax-addass 8802  ax-mulass 8803  ax-distr 8804  ax-i2m1 8805  ax-1ne0 8806  ax-1rid 8807  ax-rnegex 8808  ax-rrecex 8809  ax-cnre 8810  ax-pre-lttri 8811  ax-pre-lttrn 8812  ax-pre-ltadd 8813  ax-pre-mulgt0 8814
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-int 3863  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-riota 6304  df-recs 6388  df-rdg 6423  df-1o 6479  df-oadd 6483  df-er 6660  df-en 6864  df-dom 6865  df-sdom 6866  df-fin 6867  df-card 7572  df-cda 7794  df-pnf 8869  df-mnf 8870  df-xr 8871  df-ltxr 8872  df-le 8873  df-sub 9039  df-neg 9040  df-nn 9747  df-n0 9966  df-z 10025  df-uz 10231  df-hash 11338
  Copyright terms: Public domain W3C validator