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

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

Proof of Theorem cardsucnn
StepHypRef Expression
1 peano2 7882 . . 3 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 cardnn 9945 . . 3 (suc 𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
31, 2syl 18 . 2 (𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
4 cardnn 9945 . . 3 (𝐴 ∈ ω → (card‘𝐴) = 𝐴)
5 suceq 6427 . . 3 ((card‘𝐴) = 𝐴 → suc (card‘𝐴) = suc 𝐴)
64, 5syl 18 . 2 (𝐴 ∈ ω → suc (card‘𝐴) = suc 𝐴)
73, 6eqtr4d 2807 1 (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  suc csuc 6360  cfv 6534  ωcom 7858  cardccrd 9917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-om 7859  df-1o 8449  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-card 9921
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator