Theorem preq12b 3766

Description: Equality relationship for 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
preq12b	|- ( { A , B } = { C , D } <-> ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) )

Proof of Theorem preq12b

Step	Hyp	Ref	Expression
1		preq12b.1	. . . . . 6 |- A e. _V
2	1	prid1 3695	. . . . 5 |- A e. { A , B }
3		eleq2 2239	. . . . 5 |- ( { A , B } = { C , D } -> ( A e. { A , B } <-> A e. { C , D } ) )
4	2, 3	mpbii 148	. . . 4 |- ( { A , B } = { C , D } -> A e. { C , D } )
5	1	elpr 3610	. . . 4 |- ( A e. { C , D } <-> ( A = C \/ A = D ) )
6	4, 5	sylib 122	. . 3 |- ( { A , B } = { C , D } -> ( A = C \/ A = D ) )
7		preq1 3666	. . . . . . . 8 |- ( A = C -> { A , B } = { C , B } )
8	7	eqeq1d 2184	. . . . . . 7 |- ( A = C -> ( { A , B } = { C , D } <-> { C , B } = { C , D } ) )
9		preq12b.2	. . . . . . . 8 |- B e. _V
10		preq12b.4	. . . . . . . 8 |- D e. _V
11	9, 10	preqr2 3765	. . . . . . 7 |- ( { C , B } = { C , D } -> B = D )
12	8, 11	syl6bi 163	. . . . . 6 |- ( A = C -> ( { A , B } = { C , D } -> B = D ) )
13	12	com12 30	. . . . 5 |- ( { A , B } = { C , D } -> ( A = C -> B = D ) )
14	13	ancld 325	. . . 4 |- ( { A , B } = { C , D } -> ( A = C -> ( A = C /\ B = D ) ) )
15		prcom 3665	. . . . . . 7 |- { C , D } = { D , C }
16	15	eqeq2i 2186	. . . . . 6 |- ( { A , B } = { C , D } <-> { A , B } = { D , C } )
17		preq1 3666	. . . . . . . . 9 |- ( A = D -> { A , B } = { D , B } )
18	17	eqeq1d 2184	. . . . . . . 8 |- ( A = D -> ( { A , B } = { D , C } <-> { D , B } = { D , C } ) )
19		preq12b.3	. . . . . . . . 9 |- C e. _V
20	9, 19	preqr2 3765	. . . . . . . 8 |- ( { D , B } = { D , C } -> B = C )
21	18, 20	syl6bi 163	. . . . . . 7 |- ( A = D -> ( { A , B } = { D , C } -> B = C ) )
22	21	com12 30	. . . . . 6 |- ( { A , B } = { D , C } -> ( A = D -> B = C ) )
23	16, 22	sylbi 121	. . . . 5 |- ( { A , B } = { C , D } -> ( A = D -> B = C ) )
24	23	ancld 325	. . . 4 |- ( { A , B } = { C , D } -> ( A = D -> ( A = D /\ B = C ) ) )
25	14, 24	orim12d 786	. . 3 |- ( { A , B } = { C , D } -> ( ( A = C \/ A = D ) -> ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) ) )
26	6, 25	mpd 13	. 2 |- ( { A , B } = { C , D } -> ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) )
27		preq12 3668	. . 3 |- ( ( A = C /\ B = D ) -> { A , B } = { C , D } )
28		prcom 3665	. . . . 5 |- { D , B } = { B , D }
29	17, 28	eqtrdi 2224	. . . 4 |- ( A = D -> { A , B } = { B , D } )
30		preq1 3666	. . . 4 |- ( B = C -> { B , D } = { C , D } )
31	29, 30	sylan9eq 2228	. . 3 |- ( ( A = D /\ B = C ) -> { A , B } = { C , D } )
32	27, 31	jaoi 716	. 2 |- ( ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) -> { A , B } = { C , D } )
33	26, 32	impbii 126	1 |- ( { A , B } = { C , D } <-> ( ( A = C /\ B = D ) \/ ( A = D /\ B = C ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 708   = wceq 1353   e. wcel 2146   _Vcvv 2735   {cpr 3590

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-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-v 2737  df-un 3131  df-sn 3595  df-pr 3596

This theorem is referenced by:  prel12  3767  opthpr  3768  preq12bg  3769  preqsn  3771  opeqpr  4247  preleq  4548