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

Theorem ficardun 8968
Description: The cardinality of the union of disjoint, finite sets is the ordinal sum of their cardinalities. (Contributed by Paul Chapman, 5-Jun-2009.) (Proof shortened by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
ficardun ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → (card‘(𝐴𝐵)) = ((card‘𝐴) +𝑜 (card‘𝐵)))

Proof of Theorem ficardun
StepHypRef Expression
1 finnum 8718 . . . . . . 7 (𝐴 ∈ Fin → 𝐴 ∈ dom card)
2 finnum 8718 . . . . . . 7 (𝐵 ∈ Fin → 𝐵 ∈ dom card)
3 cardacda 8964 . . . . . . 7 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 +𝑐 𝐵) ≈ ((card‘𝐴) +𝑜 (card‘𝐵)))
41, 2, 3syl2an 494 . . . . . 6 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴 +𝑐 𝐵) ≈ ((card‘𝐴) +𝑜 (card‘𝐵)))
543adant3 1079 . . . . 5 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → (𝐴 +𝑐 𝐵) ≈ ((card‘𝐴) +𝑜 (card‘𝐵)))
65ensymd 7951 . . . 4 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → ((card‘𝐴) +𝑜 (card‘𝐵)) ≈ (𝐴 +𝑐 𝐵))
7 cdaun 8938 . . . 4 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → (𝐴 +𝑐 𝐵) ≈ (𝐴𝐵))
8 entr 7952 . . . 4 ((((card‘𝐴) +𝑜 (card‘𝐵)) ≈ (𝐴 +𝑐 𝐵) ∧ (𝐴 +𝑐 𝐵) ≈ (𝐴𝐵)) → ((card‘𝐴) +𝑜 (card‘𝐵)) ≈ (𝐴𝐵))
96, 7, 8syl2anc 692 . . 3 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → ((card‘𝐴) +𝑜 (card‘𝐵)) ≈ (𝐴𝐵))
10 carden2b 8737 . . 3 (((card‘𝐴) +𝑜 (card‘𝐵)) ≈ (𝐴𝐵) → (card‘((card‘𝐴) +𝑜 (card‘𝐵))) = (card‘(𝐴𝐵)))
119, 10syl 17 . 2 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → (card‘((card‘𝐴) +𝑜 (card‘𝐵))) = (card‘(𝐴𝐵)))
12 ficardom 8731 . . . 4 (𝐴 ∈ Fin → (card‘𝐴) ∈ ω)
13 ficardom 8731 . . . 4 (𝐵 ∈ Fin → (card‘𝐵) ∈ ω)
14 nnacl 7636 . . . . 5 (((card‘𝐴) ∈ ω ∧ (card‘𝐵) ∈ ω) → ((card‘𝐴) +𝑜 (card‘𝐵)) ∈ ω)
15 cardnn 8733 . . . . 5 (((card‘𝐴) +𝑜 (card‘𝐵)) ∈ ω → (card‘((card‘𝐴) +𝑜 (card‘𝐵))) = ((card‘𝐴) +𝑜 (card‘𝐵)))
1614, 15syl 17 . . . 4 (((card‘𝐴) ∈ ω ∧ (card‘𝐵) ∈ ω) → (card‘((card‘𝐴) +𝑜 (card‘𝐵))) = ((card‘𝐴) +𝑜 (card‘𝐵)))
1712, 13, 16syl2an 494 . . 3 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (card‘((card‘𝐴) +𝑜 (card‘𝐵))) = ((card‘𝐴) +𝑜 (card‘𝐵)))
18173adant3 1079 . 2 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → (card‘((card‘𝐴) +𝑜 (card‘𝐵))) = ((card‘𝐴) +𝑜 (card‘𝐵)))
1911, 18eqtr3d 2657 1 ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin ∧ (𝐴𝐵) = ∅) → (card‘(𝐴𝐵)) = ((card‘𝐴) +𝑜 (card‘𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  w3a 1036   = wceq 1480  wcel 1987  cun 3553  cin 3554  c0 3891   class class class wbr 4613  dom cdm 5074  cfv 5847  (class class class)co 6604  ωcom 7012   +𝑜 coa 7502  cen 7896  Fincfn 7899  cardccrd 8705   +𝑐 ccda 8933
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-om 7013  df-wrecs 7352  df-recs 7413  df-rdg 7451  df-1o 7505  df-oadd 7509  df-er 7687  df-en 7900  df-dom 7901  df-sdom 7902  df-fin 7903  df-card 8709  df-cda 8934
This theorem is referenced by:  hashun  13111
  Copyright terms: Public domain W3C validator