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

Theorem cardsucnn 9944
Description: The cardinality of the successor of a finite ordinal (natural number). This theorem does not hold for infinite ordinals; see cardsucinf 9943. (Contributed by NM, 7-Nov-2008.)
Assertion
Ref Expression
cardsucnn (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))

Proof of Theorem cardsucnn
StepHypRef Expression
1 peano2 7868 . . 3 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 cardnn 9922 . . 3 (suc 𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
31, 2syl 17 . 2 (𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
4 cardnn 9922 . . 3 (𝐴 ∈ ω → (card‘𝐴) = 𝐴)
5 suceq 6401 . . 3 ((card‘𝐴) = 𝐴 → suc (card‘𝐴) = suc 𝐴)
64, 5syl 17 . 2 (𝐴 ∈ ω → suc (card‘𝐴) = suc 𝐴)
73, 6eqtr4d 2768 1 (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  suc csuc 6336  cfv 6513  ωcom 7844  cardccrd 9894
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-pss 3936  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4913  df-br 5110  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-ord 6337  df-on 6338  df-lim 6339  df-suc 6340  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-om 7845  df-1o 8436  df-er 8673  df-en 8921  df-dom 8922  df-sdom 8923  df-fin 8924  df-card 9898
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator