Theorem onun2i 4487

Description: The union of two ordinal numbers is an ordinal number. (Contributed by NM, 13-Jun-1994.) (Constructive proof by Jim Kingdon, 25-Jul-2019.)

Hypotheses

Ref	Expression
onun2i.1	⊢ 𝐴 ∈ On
onun2i.2	⊢ 𝐵 ∈ On

Assertion

Ref	Expression
onun2i	⊢ (𝐴 ∪ 𝐵) ∈ On

Proof of Theorem onun2i

Step	Hyp	Ref	Expression
1		onun2i.1	. 2 ⊢ 𝐴 ∈ On
2		onun2i.2	. 2 ⊢ 𝐵 ∈ On
3		onun2 4486	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∪ 𝐵) ∈ On)
4	1, 2, 3	mp2an 426	1 ⊢ (𝐴 ∪ 𝐵) ∈ On

Syntax hints:   ∈ wcel 2148   ∪ cun 3127  Oncon0 4360

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pr 4206  ax-un 4430

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-sn 3597  df-pr 3598  df-uni 3808  df-tr 4099  df-iord 4363  df-on 4365

This theorem is referenced by: (None)