cardsucnn - Metamath Proof Explorer

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

Theorem cardsucnn 9398

Description: The cardinality of the successor of a finite ordinal (natural number). This theorem does not hold for infinite ordinals; see cardsucinf 9397. (Contributed by NM, 7-Nov-2008.)

**Assertion**
Ref	Expression
cardsucnn	⊢ (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))

**Proof of Theorem cardsucnn**
Step	Hyp	Ref	Expression
1		peano2 7582	. . 3 ⊢ (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2		cardnn 9376	. . 3 ⊢ (suc 𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
3	1, 2	syl 17	. 2 ⊢ (𝐴 ∈ ω → (card‘suc 𝐴) = suc 𝐴)
4		cardnn 9376	. . 3 ⊢ (𝐴 ∈ ω → (card‘𝐴) = 𝐴)
5		suceq 6224	. . 3 ⊢ ((card‘𝐴) = 𝐴 → suc (card‘𝐴) = suc 𝐴)
6	4, 5	syl 17	. 2 ⊢ (𝐴 ∈ ω → suc (card‘𝐴) = suc 𝐴)
7	3, 6	eqtr4d 2836	1 ⊢ (𝐴 ∈ ω → (card‘suc 𝐴) = suc (card‘𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 suc csuc 6161 ‘cfv 6324 ωcom 7560 cardccrd 9348

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-om 7561 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352

This theorem is referenced by: (None)

W3C validator