Metamath Proof Explorer


Theorem onsssupeqcond

Description: If for every element of a set of ordinals there is an element of a subset which is at least as large, then the union of the set and the subset is the same. Lemma 2.12 of Schloeder p. 5. (Contributed by RP, 27-Jan-2025)

Ref Expression
Assertion onsssupeqcond ⊢ A ⊆ On ∧ A ∈ V → B ⊆ A ∧ ∀ a ∈ A ∃ b ∈ B a ⊆ b → ⋃ A = ⋃ B

Proof

Step Hyp Ref Expression
1 uniss2 ⊢ ∀ a ∈ A ∃ b ∈ B a ⊆ b → ⋃ A ⊆ ⋃ B
2 1 adantl ⊢ B ⊆ A ∧ ∀ a ∈ A ∃ b ∈ B a ⊆ b → ⋃ A ⊆ ⋃ B
3 uniss ⊢ B ⊆ A → ⋃ B ⊆ ⋃ A
4 3 adantr ⊢ B ⊆ A ∧ ∀ a ∈ A ∃ b ∈ B a ⊆ b → ⋃ B ⊆ ⋃ A
5 2 4 eqssd ⊢ B ⊆ A ∧ ∀ a ∈ A ∃ b ∈ B a ⊆ b → ⋃ A = ⋃ B
6 5 a1i ⊢ A ⊆ On ∧ A ∈ V → B ⊆ A ∧ ∀ a ∈ A ∃ b ∈ B a ⊆ b → ⋃ A = ⋃ B