Theorem difprsn 2465

Description: Removal of a singleton from an unordered pair.

Assertion

Ref	Expression
difprsn	|- ({A, B} \ {A}) (_ {B}

Proof of Theorem difprsn

Step	Hyp	Ref	Expression
1		pm3.26 319	. . 3 |- ((x = B /\ -. x = A) -> x = B)
2		eldifsn 2462	. . . 4 |- (x e. ({A, B} \ {A}) <-> (x e. {A, B} /\ x =/= A))
3		visset 1813	. . . . . . 7 |- x e. V
4	3	elpr 2424	. . . . . 6 |- (x e. {A, B} <-> (x = A \/ x = B))
5		orcom 246	. . . . . 6 |- ((x = A \/ x = B) <-> (x = B \/ x = A))
6	4, 5	bitr 173	. . . . 5 |- (x e. {A, B} <-> (x = B \/ x = A))
7		df-ne 1587	. . . . 5 |- (x =/= A <-> -. x = A)
8	6, 7	anbi12i 482	. . . 4 |- ((x e. {A, B} /\ x =/= A) <-> ((x = B \/ x = A) /\ -. x = A))
9		pm5.61 447	. . . 4 |- (((x = B \/ x = A) /\ -. x = A) <-> (x = B /\ -. x = A))
10	2, 8, 9	3bitr 177	. . 3 |- (x e. ({A, B} \ {A}) <-> (x = B /\ -. x = A))
11		elsn 2421	. . 3 |- (x e. {B} <-> x = B)
12	1, 10, 11	3imtr4 219	. 2 |- (x e. ({A, B} \ {A}) -> x e. {B})
13	12	ssriv 2069	1 |- ({A, B} \ {A}) (_ {B}

Syntax hints:  -. wn 2   \/ wo 222   /\ wa 223   = wceq 956   e. wcel 958   =/= wne 1585   \ cdif 2044   (_ wss 2047  {csn 2409  {cpr 2410

This theorem is referenced by:  sspr 2475

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-sn 2412  df-pr 2413

Copyright terms: Public domain