Theorem difun1 3467

Description: A relationship involving double difference and union. (Contributed by NM, 29-Aug-2004.)

Assertion

Ref	Expression
difun1	|- ( A \ ( B u. C ) ) = ( ( A \ B ) \ C )

Proof of Theorem difun1

Step	Hyp	Ref	Expression
1		inass 3417	. . . 4 |- ( ( A i^i ( _V \ B ) ) i^i ( _V \ C ) ) = ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) )
2		invdif 3449	. . . 4 |- ( ( A i^i ( _V \ B ) ) i^i ( _V \ C ) ) = ( ( A i^i ( _V \ B ) ) \ C )
3	1, 2	eqtr3i 2254	. . 3 |- ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) ) = ( ( A i^i ( _V \ B ) ) \ C )
4		undm 3465	. . . . 5 |- ( _V \ ( B u. C ) ) = ( ( _V \ B ) i^i ( _V \ C ) )
5	4	ineq2i 3405	. . . 4 |- ( A i^i ( _V \ ( B u. C ) ) ) = ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) )
6		invdif 3449	. . . 4 |- ( A i^i ( _V \ ( B u. C ) ) ) = ( A \ ( B u. C ) )
7	5, 6	eqtr3i 2254	. . 3 |- ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) ) = ( A \ ( B u. C ) )
8	3, 7	eqtr3i 2254	. 2 |- ( ( A i^i ( _V \ B ) ) \ C ) = ( A \ ( B u. C ) )
9		invdif 3449	. . 3 |- ( A i^i ( _V \ B ) ) = ( A \ B )
10	9	difeq1i 3321	. 2 |- ( ( A i^i ( _V \ B ) ) \ C ) = ( ( A \ B ) \ C )
11	8, 10	eqtr3i 2254	1 |- ( A \ ( B u. C ) ) = ( ( A \ B ) \ C )

Syntax hints:   = wceq 1397   _Vcvv 2802   \ cdif 3197   u. cun 3198   i^i cin 3199

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206

This theorem is referenced by:  dif32  3470  difabs  3471  difpr  3815  diffifi  7082  difinfinf  7299