Metamath Proof Explorer


Theorem nnunifi

Description: The union (supremum) of a finite set of finite ordinals is a finite ordinal. (Contributed by Stefan O'Rear, 5-Nov-2014)

Ref Expression
Assertion nnunifi SωSFinSω

Proof

Step Hyp Ref Expression
1 unieq S=S=
2 uni0 =
3 peano1 ω
4 2 3 eqeltri ω
5 1 4 eqeltrdi S=Sω
6 5 adantl SωSFinS=Sω
7 simpll SωSFinSSω
8 omsson ωOn
9 7 8 sstrdi SωSFinSSOn
10 simplr SωSFinSSFin
11 simpr SωSFinSS
12 ordunifi SOnSFinSSS
13 9 10 11 12 syl3anc SωSFinSSS
14 7 13 sseldd SωSFinSSω
15 6 14 pm2.61dane SωSFinSω