Metamath Proof Explorer


Theorem onsupintrab2

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

Ref Expression
Assertion onsupintrab2 ⊢ A ∈ 𝒫 On → sup A On E = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x

Proof

Step Hyp Ref Expression
1 elpwb ⊢ A ∈ 𝒫 On ↔ A ∈ V ∧ A ⊆ On
2 onsupintrab ⊢ A ⊆ On ∧ A ∈ V → sup A On E = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x
3 2 ancoms ⊢ A ∈ V ∧ A ⊆ On → sup A On E = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x
4 1 3 sylbi ⊢ A ∈ 𝒫 On → sup A On E = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x