Theorem onuni 4339

Description: The union of an ordinal number is an ordinal number. (Contributed by NM, 29-Sep-2006.)

Assertion

Ref	Expression
onuni	⊢ (𝐴 ∈ On → ∪ 𝐴 ∈ On)

Proof of Theorem onuni

Step	Hyp	Ref	Expression
1		onss 4338	. 2 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
2		ssonuni 4333	. 2 ⊢ (𝐴 ∈ On → (𝐴 ⊆ On → ∪ 𝐴 ∈ On))
3	1, 2	mpd 13	1 ⊢ (𝐴 ∈ On → ∪ 𝐴 ∈ On)

Syntax hints:   → wi 4   ∈ wcel 1445   ⊆ wss 3013  ∪ cuni 3675  Oncon0 4214

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-13 1456  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-sep 3978  ax-un 4284

This theorem depends on definitions:  df-bi 116  df-3an 929  df-tru 1299  df-nf 1402  df-sb 1700  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ral 2375  df-rex 2376  df-v 2635  df-in 3019  df-ss 3026  df-uni 3676  df-tr 3959  df-iord 4217  df-on 4219

This theorem is referenced by: (None)