Theorem difun1 3387

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 3337	. . . 4 |- ( ( A i^i ( _V \ B ) ) i^i ( _V \ C ) ) = ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) )
2		invdif 3369	. . . 4 |- ( ( A i^i ( _V \ B ) ) i^i ( _V \ C ) ) = ( ( A i^i ( _V \ B ) ) \ C )
3	1, 2	eqtr3i 2193	. . 3 |- ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) ) = ( ( A i^i ( _V \ B ) ) \ C )
4		undm 3385	. . . . 5 |- ( _V \ ( B u. C ) ) = ( ( _V \ B ) i^i ( _V \ C ) )
5	4	ineq2i 3325	. . . 4 |- ( A i^i ( _V \ ( B u. C ) ) ) = ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) )
6		invdif 3369	. . . 4 |- ( A i^i ( _V \ ( B u. C ) ) ) = ( A \ ( B u. C ) )
7	5, 6	eqtr3i 2193	. . 3 |- ( A i^i ( ( _V \ B ) i^i ( _V \ C ) ) ) = ( A \ ( B u. C ) )
8	3, 7	eqtr3i 2193	. 2 |- ( ( A i^i ( _V \ B ) ) \ C ) = ( A \ ( B u. C ) )
9		invdif 3369	. . 3 |- ( A i^i ( _V \ B ) ) = ( A \ B )
10	9	difeq1i 3241	. 2 |- ( ( A i^i ( _V \ B ) ) \ C ) = ( ( A \ B ) \ C )
11	8, 10	eqtr3i 2193	1 |- ( A \ ( B u. C ) ) = ( ( A \ B ) \ C )

Syntax hints:   = wceq 1348   _Vcvv 2730   \ cdif 3118   u. cun 3119   i^i cin 3120

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rab 2457  df-v 2732  df-dif 3123  df-un 3125  df-in 3127

This theorem is referenced by:  dif32  3390  difabs  3391  difpr  3722  diffifi  6872  difinfinf  7078