Theorem prel12 4193

Description: Equality of two unordered pairs. (Contributed by NM, 17-Oct-1996.)

Hypotheses

Ref	Expression
preq12b.1	|- A e. _V
preq12b.2	|- B e. _V
preq12b.3	|- C e. _V
preq12b.4	|- D e. _V

Assertion

Ref	Expression
prel12	|- ( -. A = B -> ( { A , B } = { C , D } <-> ( A e. { C , D } /\ B e. { C , D } ) ) )

Proof of Theorem prel12

Step	Hyp	Ref	Expression
1		preq12b.1	. . . . 5 |- A e. _V
2	1	prid1 4124	. . . 4 |- A e. { A , B }
3		eleq2 2527	. . . 4 |- ( { A , B } = { C , D } -> ( A e. { A , B } <-> A e. { C , D } ) )
4	2, 3	mpbii 211	. . 3 |- ( { A , B } = { C , D } -> A e. { C , D } )
5		preq12b.2	. . . . 5 |- B e. _V
6	5	prid2 4125	. . . 4 |- B e. { A , B }
7		eleq2 2527	. . . 4 |- ( { A , B } = { C , D } -> ( B e. { A , B } <-> B e. { C , D } ) )
8	6, 7	mpbii 211	. . 3 |- ( { A , B } = { C , D } -> B e. { C , D } )
9	4, 8	jca 530	. 2 |- ( { A , B } = { C , D } -> ( A e. { C , D } /\ B e. { C , D } ) )
10	1	elpr 4034	. . . 4 |- ( A e. { C , D } <-> ( A = C \/ A = D ) )
11		eqeq2 2469	. . . . . . . . . . . 12 |- ( B = D -> ( A = B <-> A = D ) )
12	11	notbid 292	. . . . . . . . . . 11 |- ( B = D -> ( -. A = B <-> -. A = D ) )
13		orel2 381	. . . . . . . . . . 11 |- ( -. A = D -> ( ( A = C \/ A = D ) -> A = C ) )
14	12, 13	syl6bi 228	. . . . . . . . . 10 |- ( B = D -> ( -. A = B -> ( ( A = C \/ A = D ) -> A = C ) ) )
15	14	com3l 81	. . . . . . . . 9 |- ( -. A = B -> ( ( A = C \/ A = D ) -> ( B = D -> A = C ) ) )
16	15	imp 427	. . . . . . . 8 |- ( ( -. A = B /\ ( A = C \/ A = D ) ) -> ( B = D -> A = C ) )
17	16	ancrd 552	. . . . . . 7 |- ( ( -. A = B /\ ( A = C \/ A = D ) ) -> ( B = D -> ( A = C /\ B = D ) ) )
18		eqeq2 2469	. . . . . . . . . . . 12 |- ( B = C -> ( A = B <-> A = C ) )
19	18	notbid 292	. . . . . . . . . . 11 |- ( B = C -> ( -. A = B <-> -. A = C ) )
20		orel1 380	. . . . . . . . . . 11 |- ( -. A = C -> ( ( A = C \/ A = D ) -> A = D ) )
21	19, 20	syl6bi 228	. . . . . . . . . 10 |- ( B = C -> ( -. A = B -> ( ( A = C \/ A = D ) -> A = D ) ) )
22	21	com3l 81	. . . . . . . . 9 |- ( -. A = B -> ( ( A = C \/ A = D ) -> ( B = C -> A = D ) ) )
23	22	imp 427	. . . . . . . 8 |- ( ( -. A = B /\ ( A = C \/ A = D ) ) -> ( B = C -> A = D ) )
24	23	ancrd 552	. . . . . . 7 |- ( ( -. A = B /\ ( A = C \/ A = D ) ) -> ( B = C -> ( A = D /\ B = C ) ) )
25	17, 24	orim12d 836	. . . . . 6 |- ( ( -. A = B /\ ( A = C \/ A = D ) ) -> ( ( B = D \/ B = C ) -> ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) ) )
26	5	elpr 4034	. . . . . . 7 |- ( B e. { C , D } <-> ( B = C \/ B = D ) )
27		orcom 385	. . . . . . 7 |- ( ( B = C \/ B = D ) <-> ( B = D \/ B = C ) )
28	26, 27	bitri 249	. . . . . 6 |- ( B e. { C , D } <-> ( B = D \/ B = C ) )
29		preq12b.3	. . . . . . 7 |- C e. _V
30		preq12b.4	. . . . . . 7 |- D e. _V
31	1, 5, 29, 30	preq12b 4192	. . . . . 6 |- ( { A , B } = { C , D } <-> ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) )
32	25, 28, 31	3imtr4g 270	. . . . 5 |- ( ( -. A = B /\ ( A = C \/ A = D ) ) -> ( B e. { C , D } -> { A , B } = { C , D } ) )
33	32	ex 432	. . . 4 |- ( -. A = B -> ( ( A = C \/ A = D ) -> ( B e. { C , D } -> { A , B } = { C , D } ) ) )
34	10, 33	syl5bi 217	. . 3 |- ( -. A = B -> ( A e. { C , D } -> ( B e. { C , D } -> { A , B } = { C , D } ) ) )
35	34	impd 429	. 2 |- ( -. A = B -> ( ( A e. { C , D } /\ B e. { C , D } ) -> { A , B } = { C , D } ) )
36	9, 35	impbid2 204	1 |- ( -. A = B -> ( { A , B } = { C , D } <-> ( A e. { C , D } /\ B e. { C , D } ) ) )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 184   \/ wo 366   /\ wa 367   = wceq 1398   e. wcel 1823   _Vcvv 3106   {cpr 4018

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432

This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-v 3108  df-un 3466  df-sn 4017  df-pr 4019

This theorem is referenced by:  prel12g  4196  dfac2  8502