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

Theorem opth2 3977
Description: Ordered pair theorem. (Contributed by NM, 21-Sep-2014.)
Hypotheses
Ref Expression
opth2.1  |-  C  e. 
_V
opth2.2  |-  D  e. 
_V
Assertion
Ref Expression
opth2  |-  ( <. A ,  B >.  = 
<. C ,  D >.  <->  ( A  =  C  /\  B  =  D )
)

Proof of Theorem opth2
StepHypRef Expression
1 opth2.1 . 2  |-  C  e. 
_V
2 opth2.2 . 2  |-  D  e. 
_V
3 opthg2 3976 . 2  |-  ( ( C  e.  _V  /\  D  e.  _V )  ->  ( <. A ,  B >.  =  <. C ,  D >.  <-> 
( A  =  C  /\  B  =  D ) ) )
41, 2, 3mp2an 402 1  |-  ( <. A ,  B >.  = 
<. C ,  D >.  <->  ( A  =  C  /\  B  =  D )
)
Colors of variables: wff set class
Syntax hints:    /\ wa 97    <-> wb 98    = wceq 1243    e. wcel 1393   _Vcvv 2557   <.cop 3378
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384
This theorem is referenced by:  eqvinop  3980  opelxp  4374  fsn  5335  dfplpq2  6452  ltresr  6915  frecuzrdgfn  9198
  Copyright terms: Public domain W3C validator