ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  opeqsn Unicode version

Theorem opeqsn 4371
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
StepHypRef Expression
1 opeqsn.1 . . . 4  |-  A  e. 
_V
2 opeqsn.2 . . . 4  |-  B  e. 
_V
31, 2dfop 3884 . . 3  |-  <. A ,  B >.  =  { { A } ,  { A ,  B } }
43eqeq1i 2242 . 2  |-  ( <. A ,  B >.  =  { C }  <->  { { A } ,  { A ,  B } }  =  { C } )
51snex 4300 . . 3  |-  { A }  e.  _V
6 prexg 4327 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  { A ,  B }  e.  _V )
71, 2, 6mp2an 426 . . 3  |-  { A ,  B }  e.  _V
8 opeqsn.3 . . 3  |-  C  e. 
_V
95, 7, 8preqsn 3881 . 2  |-  ( { { A } ,  { A ,  B } }  =  { C } 
<->  ( { A }  =  { A ,  B }  /\  { A ,  B }  =  C
) )
10 eqcom 2236 . . . . 5  |-  ( { A }  =  { A ,  B }  <->  { A ,  B }  =  { A } )
111, 2, 1preqsn 3881 . . . . 5  |-  ( { A ,  B }  =  { A }  <->  ( A  =  B  /\  B  =  A ) )
12 eqcom 2236 . . . . . . 7  |-  ( B  =  A  <->  A  =  B )
1312anbi2i 457 . . . . . 6  |-  ( ( A  =  B  /\  B  =  A )  <->  ( A  =  B  /\  A  =  B )
)
14 anidm 396 . . . . . 6  |-  ( ( A  =  B  /\  A  =  B )  <->  A  =  B )
1513, 14bitri 184 . . . . 5  |-  ( ( A  =  B  /\  B  =  A )  <->  A  =  B )
1610, 11, 153bitri 206 . . . 4  |-  ( { A }  =  { A ,  B }  <->  A  =  B )
1716anbi1i 458 . . 3  |-  ( ( { A }  =  { A ,  B }  /\  { A ,  B }  =  C )  <->  ( A  =  B  /\  { A ,  B }  =  C ) )
18 dfsn2 3705 . . . . . . 7  |-  { A }  =  { A ,  A }
19 preq2 3771 . . . . . . 7  |-  ( A  =  B  ->  { A ,  A }  =  { A ,  B }
)
2018, 19eqtr2id 2280 . . . . . 6  |-  ( A  =  B  ->  { A ,  B }  =  { A } )
2120eqeq1d 2243 . . . . 5  |-  ( A  =  B  ->  ( { A ,  B }  =  C  <->  { A }  =  C ) )
22 eqcom 2236 . . . . 5  |-  ( { A }  =  C  <-> 
C  =  { A } )
2321, 22bitrdi 196 . . . 4  |-  ( A  =  B  ->  ( { A ,  B }  =  C  <->  C  =  { A } ) )
2423pm5.32i 454 . . 3  |-  ( ( A  =  B  /\  { A ,  B }  =  C )  <->  ( A  =  B  /\  C  =  { A } ) )
2517, 24bitri 184 . 2  |-  ( ( { A }  =  { A ,  B }  /\  { A ,  B }  =  C )  <->  ( A  =  B  /\  C  =  { A } ) )
264, 9, 253bitri 206 1  |-  ( <. A ,  B >.  =  { C }  <->  ( A  =  B  /\  C  =  { A } ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   _Vcvv 2815   {csn 3691   {cpr 3692   <.cop 3694
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700
This theorem is referenced by:  relop  4907
  Copyright terms: Public domain W3C validator