Theorem difprsn2 3779

Description: Removal of a singleton from an unordered pair. (Contributed by Alexander van der Vekens, 5-Oct-2017.)

Assertion

Ref	Expression
difprsn2	|- ( A =/= B -> ( { A , B } \ { B } ) = { A } )

Proof of Theorem difprsn2

Step	Hyp	Ref	Expression
1		prcom 3714	. . 3 |- { A , B } = { B , A }
2	1	difeq1i 3291	. 2 |- ( { A , B } \ { B } ) = ( { B , A } \ { B } )
3		necom 2461	. . 3 |- ( A =/= B <-> B =/= A )
4		difprsn1 3778	. . 3 |- ( B =/= A -> ( { B , A } \ { B } ) = { A } )
5	3, 4	sylbi 121	. 2 |- ( A =/= B -> ( { B , A } \ { B } ) = { A } )
6	2, 5	eqtrid 2251	1 |- ( A =/= B -> ( { A , B } \ { B } ) = { A } )

Syntax hints:   -> wi 4   = wceq 1373   =/= wne 2377   \ cdif 3167   {csn 3638   {cpr 3639

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 2188

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rab 2494  df-v 2775  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-sn 3644  df-pr 3645

This theorem is referenced by: (None)