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

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

Proof of Theorem cardsucnn
StepHypRef Expression
1 peano2 7922 . . 3 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 cardnn 10068 . . 3 (suc 𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
31, 2syl 18 . 2 (𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
4 cardnn 10068 . . 3 (𝐴 ∈ ω → (card‘𝐴) = 𝐴)
5 suceq 6446 . . 3 ((card‘𝐴) = 𝐴 → suc (card‘𝐴) = suc 𝐴)
64, 5syl 18 . 2 (𝐴 ∈ ω → suc (card‘𝐴) = suc 𝐴)
73, 6eqtr4d 2801 1 (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  suc csuc 6379  ‘cfv 6555  ωcom 7898  cardccrd 10040
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-om 7899  df-1o 8501  df-er 8742  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-card 10044
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator