Metamath Proof Explorer


Theorem unidif0

Description: The removal of the empty set from a class does not affect its union. (Contributed by NM, 22-Mar-2004) (Proof shortened by Eric Schmidt, 25-Apr-2026)

Ref Expression
Assertion unidif0 ⊢ ⋃ A ∖ ∅ = ⋃ A

Proof

Step Hyp Ref Expression
1 undif1 ⊢ A ∖ ∅ ∪ ∅ = A ∪ ∅
2 1 unieqi ⊢ ⋃ A ∖ ∅ ∪ ∅ = ⋃ A ∪ ∅
3 uniun ⊢ ⋃ A ∪ ∅ = ⋃ A ∪ ⋃ ∅
4 0ex ⊢ ∅ ∈ V
5 4 unisn ⊢ ⋃ ∅ = ∅
6 5 uneq2i ⊢ ⋃ A ∪ ⋃ ∅ = ⋃ A ∪ ∅
7 2 3 6 3eqtri ⊢ ⋃ A ∖ ∅ ∪ ∅ = ⋃ A ∪ ∅
8 uniun ⊢ ⋃ A ∖ ∅ ∪ ∅ = ⋃ A ∖ ∅ ∪ ⋃ ∅
9 5 uneq2i ⊢ ⋃ A ∖ ∅ ∪ ⋃ ∅ = ⋃ A ∖ ∅ ∪ ∅
10 un0 ⊢ ⋃ A ∖ ∅ ∪ ∅ = ⋃ A ∖ ∅
11 8 9 10 3eqtri ⊢ ⋃ A ∖ ∅ ∪ ∅ = ⋃ A ∖ ∅
12 un0 ⊢ ⋃ A ∪ ∅ = ⋃ A
13 7 11 12 3eqtr3i ⊢ ⋃ A ∖ ∅ = ⋃ A