Theorem opeqsn 4345

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 3861	. . 3 |- <. A , B >. = { { A } , { A , B } }
4	3	eqeq1i 2239	. 2 |- ( <. A , B >. = { C } <-> { { A } , { A , B } } = { C } )
5	1	snex 4275	. . 3 |- { A } e. _V
6		prexg 4301	. . . 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 3858	. 2 |- ( { { A } , { A , B } } = { C } <-> ( { A } = { A , B } /\ { A , B } = C ) )
10		eqcom 2233	. . . . 5 |- ( { A } = { A , B } <-> { A , B } = { A } )
11	1, 2, 1	preqsn 3858	. . . . 5 |- ( { A , B } = { A } <-> ( A = B /\ B = A ) )
12		eqcom 2233	. . . . . . 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 3683	. . . . . . 7 |- { A } = { A , A }
19		preq2 3749	. . . . . . 7 |- ( A = B -> { A , A } = { A , B } )
20	18, 19	eqtr2id 2277	. . . . . 6 |- ( A = B -> { A , B } = { A } )
21	20	eqeq1d 2240	. . . . 5 |- ( A = B -> ( { A , B } = C <-> { A } = C ) )
22		eqcom 2233	. . . . 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 1397   e. wcel 2202   _Vcvv 2802   {csn 3669   {cpr 3670   <.cop 3672

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678

This theorem is referenced by:  relop  4880