Theorem brdif 4113

Description: The difference of two binary relations. (Contributed by Scott Fenton, 11-Apr-2011.)

Assertion

Ref	Expression
brdif	|- ( A ( R \ S ) B <-> ( A R B /\ -. A S B ) )

Proof of Theorem brdif

Step	Hyp	Ref	Expression
1		eldif 3183	. 2 |- ( <. A , B >. e. ( R \ S ) <-> ( <. A , B >. e. R /\ -. <. A , B >. e. S ) )
2		df-br 4060	. 2 |- ( A ( R \ S ) B <-> <. A , B >. e. ( R \ S ) )
3		df-br 4060	. . 3 |- ( A R B <-> <. A , B >. e. R )
4		df-br 4060	. . . 4 |- ( A S B <-> <. A , B >. e. S )
5	4	notbii 670	. . 3 |- ( -. A S B <-> -. <. A , B >. e. S )
6	3, 5	anbi12i 460	. 2 |- ( ( A R B /\ -. A S B ) <-> ( <. A , B >. e. R /\ -. <. A , B >. e. S ) )
7	1, 2, 6	3bitr4i 212	1 |- ( A ( R \ S ) B <-> ( A R B /\ -. A S B ) )

Syntax hints:   -. wn 3   /\ wa 104   <-> wb 105   e. wcel 2178   \ cdif 3171   <.cop 3646   class class class wbr 4059

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-dif 3176  df-br 4060

This theorem is referenced by:  fundif  5337  fndmdif  5708  brdifun  6670