Metamath Proof Explorer


Theorem onsuplub

Description: The supremum of a set of ordinals is the least upper bound. (Contributed by RP, 27-Jan-2025)

Ref Expression
Assertion onsuplub AOnAVBOnBAzABz

Proof

Step Hyp Ref Expression
1 eluni2 BAzABz
2 1 a1i AOnAVBOnBAzABz