Metamath Proof Explorer


Theorem disjssun

Description: Subset relation for disjoint classes. (Contributed by NM, 25-Oct-2005) (Proof shortened by Andrew Salmon, 26-Jun-2011)

Ref Expression
Assertion disjssun ⊢ A ∩ B = ∅ → A ⊆ B ∪ C ↔ A ⊆ C

Proof

Step Hyp Ref Expression
1 uneq2 ⊢ A ∩ B = ∅ → A ∩ C ∪ A ∩ B = A ∩ C ∪ ∅
2 indi ⊢ A ∩ B ∪ C = A ∩ B ∪ A ∩ C
3 2 equncomi ⊢ A ∩ B ∪ C = A ∩ C ∪ A ∩ B
4 un0 ⊢ A ∩ C ∪ ∅ = A ∩ C
5 4 eqcomi ⊢ A ∩ C = A ∩ C ∪ ∅
6 1 3 5 3eqtr4g ⊢ A ∩ B = ∅ → A ∩ B ∪ C = A ∩ C
7 6 eqeq1d ⊢ A ∩ B = ∅ → A ∩ B ∪ C = A ↔ A ∩ C = A
8 dfss2 ⊢ A ⊆ B ∪ C ↔ A ∩ B ∪ C = A
9 dfss2 ⊢ A ⊆ C ↔ A ∩ C = A
10 7 8 9 3bitr4g ⊢ A ∩ B = ∅ → A ⊆ B ∪ C ↔ A ⊆ C