Metamath Proof Explorer


Theorem kardnnfi

Description: The kard cardinal number of a finite ordinal is finite. (Contributed by BTernaryTau, 3-Jul-2026)

Ref Expression
Assertion kardnnfi Could not format assertion : No typesetting found for |- ( A e. _om -> ( kard ` A ) e. Fin ) with typecode |-

Proof

Step Hyp Ref Expression
1 nnon A ω A On
2 onrankid A On rank A = A
3 1 2 sylib A ω rank A = A
4 3 eleq1d A ω rank A ω A ω
5 4 ibir A ω rank A ω
6 peano2 rank A ω suc rank A ω
7 r1fin suc rank A ω R1 suc rank A Fin
8 5 6 7 3syl A ω R1 suc rank A Fin
9 kardval Could not format ( kard ` A ) = Scott { x | x ~~ A } : No typesetting found for |- ( kard ` A ) = Scott { x | x ~~ A } with typecode |-
10 enrefnn A ω A A
11 breq1 x = A x A A A
12 11 elabg A ω A x | x A A A
13 10 12 mpbird A ω A x | x A
14 scottssr1 A x | x A Scott x | x A R1 suc rank A
15 13 14 syl A ω Scott x | x A R1 suc rank A
16 9 15 eqsstrid Could not format ( A e. _om -> ( kard ` A ) C_ ( R1 ` suc ( rank ` A ) ) ) : No typesetting found for |- ( A e. _om -> ( kard ` A ) C_ ( R1 ` suc ( rank ` A ) ) ) with typecode |-
17 8 16 ssfid Could not format ( A e. _om -> ( kard ` A ) e. Fin ) : No typesetting found for |- ( A e. _om -> ( kard ` A ) e. Fin ) with typecode |-