Theorem difin2 3226

Description: Represent a set difference as an intersection with a larger difference. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
difin2	⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∖ 𝐵) = ((𝐶 ∖ 𝐵) ∩ 𝐴))

Proof of Theorem difin2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 2966	. . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐶))
2	1	pm4.71d 379	. . . 4 ⊢ (𝐴 ⊆ 𝐶 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶)))
3	2	anbi1d 446	. . 3 ⊢ (𝐴 ⊆ 𝐶 → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ ¬ 𝑥 ∈ 𝐵)))
4		eldif 2954	. . 3 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
5		elin 3153	. . . 4 ⊢ (𝑥 ∈ ((𝐶 ∖ 𝐵) ∩ 𝐴) ↔ (𝑥 ∈ (𝐶 ∖ 𝐵) ∧ 𝑥 ∈ 𝐴))
6		eldif 2954	. . . . 5 ⊢ (𝑥 ∈ (𝐶 ∖ 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵))
7	6	anbi1i 439	. . . 4 ⊢ ((𝑥 ∈ (𝐶 ∖ 𝐵) ∧ 𝑥 ∈ 𝐴) ↔ ((𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴))
8		ancom 257	. . . . 5 ⊢ (((𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)))
9		anass 387	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ ¬ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵)))
10	8, 9	bitr4i 180	. . . 4 ⊢ (((𝑥 ∈ 𝐶 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ ¬ 𝑥 ∈ 𝐵))
11	5, 7, 10	3bitri 199	. . 3 ⊢ (𝑥 ∈ ((𝐶 ∖ 𝐵) ∩ 𝐴) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ ¬ 𝑥 ∈ 𝐵))
12	3, 4, 11	3bitr4g 216	. 2 ⊢ (𝐴 ⊆ 𝐶 → (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 𝑥 ∈ ((𝐶 ∖ 𝐵) ∩ 𝐴)))
13	12	eqrdv 2054	1 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∖ 𝐵) = ((𝐶 ∖ 𝐵) ∩ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 101   = wceq 1259   ∈ wcel 1409   ∖ cdif 2941   ∩ cin 2943   ⊆ wss 2944

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038

This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-dif 2947  df-in 2951  df-ss 2958

This theorem is referenced by: (None)