Theorem undif4 3587

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 759	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶) → ¬ 𝑥 ∈ 𝐶))
2		olc 723	. . . . . . 7 ⊢ (¬ 𝑥 ∈ 𝐶 → (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶))
3	1, 2	impbid1 142	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶) ↔ ¬ 𝑥 ∈ 𝐶))
4	3	anbi2d 468	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → (((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶)))
5		eldif 3229	. . . . . . 7 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶))
6	5	orbi2i 774	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)))
7		ordi 828	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∨ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶)))
8	6, 7	bitri 184	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐴 ∨ ¬ 𝑥 ∈ 𝐶)))
9		elun 3370	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
10	9	anbi1i 462	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶))
11	4, 8, 10	3bitr4g 223	. . . 4 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶)))
12		elun 3370	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ (𝐵 ∖ 𝐶)))
13		eldif 3229	. . . 4 ⊢ (𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶) ↔ (𝑥 ∈ (𝐴 ∪ 𝐵) ∧ ¬ 𝑥 ∈ 𝐶))
14	11, 12, 13	3bitr4g 223	. . 3 ⊢ ((𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → (𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶)))
15	14	alimi 1508	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶) → ∀𝑥(𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶)))
16		disj1 3575	. 2 ⊢ ((𝐴 ∩ 𝐶) = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐶))
17		dfcleq 2232	. 2 ⊢ ((𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ 𝐶) ↔ ∀𝑥(𝑥 ∈ (𝐴 ∪ (𝐵 ∖ 𝐶)) ↔ 𝑥 ∈ ((𝐴 ∪ 𝐵) ∖ 𝐶)))
18	15, 16, 17	3imtr4i 201	1 ⊢ ((𝐴 ∩ 𝐶) = ∅ → (𝐴 ∪ (𝐵 ∖ 𝐶)) = ((𝐴 ∪ 𝐵) ∖ 𝐶))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  ∀wal 1400   = wceq 1402   ∈ wcel 2209   ∖ cdif 3217   ∪ cun 3218   ∩ cin 3219  ∅c0 3520

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-nul 3521

This theorem is used by:  phplem1  7153