Union of subsets is a subset of the union
From Maths
Contents
[hide]Statement
Given two arbitrary families of sets, {Aα}α∈I and {Bα}α∈I such that ∀α∈I[Bα⊆Aα] we have[1]:
- ⋃α∈IBα⊆⋃α∈IAα
This seems quite trivial (and it is) but it is a very useful result
Proof
We will show that ⋃α∈IBα⊆⋃α∈IAα by using the implies-subset relation, and showing x∈⋃α∈IBα⟹x∈⋃α∈IAα
- Let {{M|x\in\bigcup_{\alpha\in I}B_\alpha} this means
- ∃β∈I[x∈Bβ], let β be defined as such.
- By hypothesis, ∀α∈I[Bα⊆Aα], again using the implies-subset relation we see:
- x∈Bβ⟹x∈Aβ
- So we have x∈Aβ
- Recall that x∈⋃α∈IAα⟺∃β∈I[x∈Aβ]
- We have exactly the right side of this, so we also have
- x∈⋃α∈IAα
- We have shown x∈⋃α∈IBα⟹x∈⋃α∈IAα, which (again, by the implies-subset relation) is exactly:
- ⋃α∈IBα⊆⋃α∈IAα - As required.
This completes the proof.
See also
References
- Jump up ↑ Alec's (my) own work