Metamath Proof Explorer


Theorem onsupeqmax

Description: Condition when the supremum of a set of ordinals is the maximum element of that set. (Contributed by RP, 24-Jan-2025)

Ref Expression
Assertion onsupeqmax ⊢ A ⊆ On ∧ A ∈ V → ∃ x ∈ A ∀ y ∈ A y ⊆ x ↔ ⋃ A ∈ A

Proof

Step Hyp Ref Expression
1 unielid ⊢ ⋃ A ∈ A ↔ ∃ x ∈ A ∀ y ∈ A y ⊆ x
2 1 a1i ⊢ A ⊆ On ∧ A ∈ V → ⋃ A ∈ A ↔ ∃ x ∈ A ∀ y ∈ A y ⊆ x
3 2 bicomd ⊢ A ⊆ On ∧ A ∈ V → ∃ x ∈ A ∀ y ∈ A y ⊆ x ↔ ⋃ A ∈ A