Theorem opeqsn 4339

Description: Equivalence for an ordered pair equal to a singleton. (Contributed by NM, 3-Jun-2008.)

Hypotheses

Ref	Expression
opeqsn.1	|- A e. _V
opeqsn.2	|- B e. _V
opeqsn.3	|- C e. _V

Assertion

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

Proof of Theorem opeqsn

Step	Hyp	Ref	Expression
1		opeqsn.1	. . . 4 |- A e. _V
2		opeqsn.2	. . . 4 |- B e. _V
3	1, 2	dfop 3856	. . 3 |- <. A , B >. = { { A } , { A , B } }
4	3	eqeq1i 2237	. 2 |- ( <. A , B >. = { C } <-> { { A } , { A , B } } = { C } )
5	1	snex 4269	. . 3 |- { A } e. _V
6		prexg 4295	. . . 4 |- ( ( A e. _V /\ B e. _V ) -> { A , B } e. _V )
7	1, 2, 6	mp2an 426	. . 3 |- { A , B } e. _V
8		opeqsn.3	. . 3 |- C e. _V
9	5, 7, 8	preqsn 3853	. 2 |- ( { { A } , { A , B } } = { C } <-> ( { A } = { A , B } /\ { A , B } = C ) )
10		eqcom 2231	. . . . 5 |- ( { A } = { A , B } <-> { A , B } = { A } )
11	1, 2, 1	preqsn 3853	. . . . 5 |- ( { A , B } = { A } <-> ( A = B /\ B = A ) )
12		eqcom 2231	. . . . . . 7 |- ( B = A <-> A = B )
13	12	anbi2i 457	. . . . . 6 |- ( ( A = B /\ B = A ) <-> ( A = B /\ A = B ) )
14		anidm 396	. . . . . 6 |- ( ( A = B /\ A = B ) <-> A = B )
15	13, 14	bitri 184	. . . . 5 |- ( ( A = B /\ B = A ) <-> A = B )
16	10, 11, 15	3bitri 206	. . . 4 |- ( { A } = { A , B } <-> A = B )
17	16	anbi1i 458	. . 3 |- ( ( { A } = { A , B } /\ { A , B } = C ) <-> ( A = B /\ { A , B } = C ) )
18		dfsn2 3680	. . . . . . 7 |- { A } = { A , A }
19		preq2 3744	. . . . . . 7 |- ( A = B -> { A , A } = { A , B } )
20	18, 19	eqtr2id 2275	. . . . . 6 |- ( A = B -> { A , B } = { A } )
21	20	eqeq1d 2238	. . . . 5 |- ( A = B -> ( { A , B } = C <-> { A } = C ) )
22		eqcom 2231	. . . . 5 |- ( { A } = C <-> C = { A } )
23	21, 22	bitrdi 196	. . . 4 |- ( A = B -> ( { A , B } = C <-> C = { A } ) )
24	23	pm5.32i 454	. . 3 |- ( ( A = B /\ { A , B } = C ) <-> ( A = B /\ C = { A } ) )
25	17, 24	bitri 184	. 2 |- ( ( { A } = { A , B } /\ { A , B } = C ) <-> ( A = B /\ C = { A } ) )
26	4, 9, 25	3bitri 206	1 |- ( <. A , B >. = { C } <-> ( A = B /\ C = { A } ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1395   e. wcel 2200   _Vcvv 2799   {csn 3666   {cpr 3667   <.cop 3669

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675

This theorem is referenced by:  relop  4872