Theorem difpr 3841

Description: Removing two elements as pair of elements corresponds to removing each of the two elements as singletons. (Contributed by Alexander van der Vekens, 13-Jul-2018.)

Assertion

Ref	Expression
difpr	|- ( A \ { B , C } ) = ( ( A \ { B } ) \ { C } )

Proof of Theorem difpr

Step	Hyp	Ref	Expression
1		df-pr 3701	. . 3 |- { B , C } = ( { B } u. { C } )
2	1	difeq2i 3338	. 2 |- ( A \ { B , C } ) = ( A \ ( { B } u. { C } ) )
3		difun1 3485	. 2 |- ( A \ ( { B } u. { C } ) ) = ( ( A \ { B } ) \ { C } )
4	2, 3	eqtri 2255	1 |- ( A \ { B , C } ) = ( ( A \ { B } ) \ { C } )

Syntax hints:   = wceq 1398   \ cdif 3211   u. cun 3212   {csn 3694   {cpr 3695

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-pr 3701

This theorem is referenced by:  hashdifpr  11210