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

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

Proof of Theorem cardsucnn
StepHypRef Expression
1 peano2 7885 . . 3 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 cardnn 9948 . . 3 (suc 𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
31, 2syl 18 . 2 (𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
4 cardnn 9948 . . 3 (𝐴 ∈ ω → (card‘𝐴) = 𝐴)
5 suceq 6429 . . 3 ((card‘𝐴) = 𝐴 → suc (card‘𝐴) = suc 𝐴)
64, 5syl 18 . 2 (𝐴 ∈ ω → suc (card‘𝐴) = suc 𝐴)
73, 6eqtr4d 2799 1 (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1568  wcel 2141  suc csuc 6362  cfv 6536  ωcom 7861  cardccrd 9920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7862  df-1o 8452  df-er 8693  df-en 8943  df-dom 8944  df-sdom 8945  df-fin 8946  df-card 9924
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator