Metamath Proof Explorer


Theorem onuniintrab

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

Ref Expression
Assertion onuniintrab ⊢ A ⊆ On ∧ A ∈ V → ⋃ A = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x

Proof

Step Hyp Ref Expression
1 ssonuni ⊢ A ∈ V → A ⊆ On → ⋃ A ∈ On
2 1 impcom ⊢ A ⊆ On ∧ A ∈ V → ⋃ A ∈ On
3 intmin ⊢ ⋃ A ∈ On → ⋂ x ∈ On | ⋃ A ⊆ x = ⋃ A
4 unissb ⊢ ⋃ A ⊆ x ↔ ∀ y ∈ A y ⊆ x
5 4 rabbii ⊢ x ∈ On | ⋃ A ⊆ x = x ∈ On | ∀ y ∈ A y ⊆ x
6 5 inteqi ⊢ ⋂ x ∈ On | ⋃ A ⊆ x = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x
7 3 6 eqtr3di ⊢ ⋃ A ∈ On → ⋃ A = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x
8 2 7 syl ⊢ A ⊆ On ∧ A ∈ V → ⋃ A = ⋂ x ∈ On | ∀ y ∈ A y ⊆ x