Theorem undif4 4374

Description: Distribute union over difference. (Contributed by NM, 17-May-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
undif4	⊢ ((𝐴 ∩ 𝐶) = ∅ → (𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ 𝐶))

Proof of Theorem undif4

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pm2.621 896	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶) → ¬ 𝑥 ∈ 𝐶))
2		olc 865	. . . . . . 7 ⊢ (¬ 𝑥 ∈ 𝐶 → (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶))
3	1, 2	impbid1 228	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶) ↔ ¬ 𝑥 ∈ 𝐶))
4	3	anbi2d 631	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶)))
5		eldif 3891	. . . . . . 7 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶))
6	5	orbi2i 910	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
7		ordi 1003	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶)))
8	6, 7	bitri 278	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶)))
9		elun 4076	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
10	9	anbi1i 626	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶))
11	4, 8, 10	3bitr4g 317	. . . 4 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶)))
12		elun 4076	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)))
13		eldif 3891	. . . 4 ⊢ (𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶) ↔ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶))
14	11, 12, 13	3bitr4g 317	. . 3 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶)))
15	14	alimi 1813	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ∀𝑥(𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶)))
16		disj1 4358	. 2 ⊢ ((𝐴 ∩ 𝐶) = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶))
17		dfcleq 2792	. 2 ⊢ ((𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ 𝐶) ↔ ∀𝑥(𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶)))
18	15, 16, 17	3imtr4i 295	1 ⊢ ((𝐴 ∩ 𝐶) = ∅ → (𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844  ∀wal 1536   = wceq 1538   ∈ wcel 2111   ∖ cdif 3878   ∪ cun 3879   ∩ cin 3880  ∅c0 4243

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-nul 4244

This theorem is referenced by:  phplem1  8680  infdifsn  9104  difico  30532  lindsunlem  31108  caratheodorylem1  43165