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

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

Proof of Theorem cardsucnn
StepHypRef Expression
1 peano2 7830 . . 3 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 cardnn 9876 . . 3 (suc 𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
31, 2syl 17 . 2 (𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
4 cardnn 9876 . . 3 (𝐴 ∈ ω → (card‘𝐴) = 𝐴)
5 suceq 6380 . . 3 ((card‘𝐴) = 𝐴 → suc (card‘𝐴) = suc 𝐴)
64, 5syl 17 . 2 (𝐴 ∈ ω → suc (card‘𝐴) = suc 𝐴)
73, 6eqtr4d 2773 1 (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  suc csuc 6314  cfv 6487  ωcom 7806  cardccrd 9848
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 2184  ax-ext 2707  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7678
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 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2931  df-ral 3050  df-rex 3060  df-reu 3341  df-rab 3388  df-v 3429  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-int 4880  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-ord 6315  df-on 6316  df-lim 6317  df-suc 6318  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-om 7807  df-1o 8394  df-er 8632  df-en 8883  df-dom 8884  df-sdom 8885  df-fin 8886  df-card 9852
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator