Metamath Proof Explorer


Theorem onsupintrab

Description: The supremum of a set of ordinals is the intersection of every ordinal greater-than-or-equal to every member of the set. Definition 2.9 of Schloeder p. 5. (Contributed by RP, 23-Jan-2025)

Ref Expression
Assertion onsupintrab ⊢ A ⊆ On ∧ A ∈ V → sup A On E = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x

Proof

Step Hyp Ref Expression
1 onsupuni ⊢ A ⊆ On ∧ A ∈ V → sup A On E = ⋃ A
2 onuniintrab ⊢ A ⊆ On ∧ A ∈ V → ⋃ A = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x
3 1 2 eqtrd ⊢ A ⊆ On ∧ A ∈ V → sup A On E = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x