Metamath Proof Explorer


Theorem oninfunirab

Description: The infimum of a non-empty class of ordinals is the union of every ordinal less-than-or-equal to every element of that class. (Contributed by RP, 23-Jan-2025)

Ref Expression
Assertion oninfunirab A On A inf A On E = x On | y A x y

Proof

Step Hyp Ref Expression
1 oninfint A On A inf A On E = A
2 onintunirab A On A A = x On | y A x y
3 1 2 eqtrd A On A inf A On E = x On | y A x y