MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opeqex Structured version   Visualization version   Unicode version

Theorem opeqex 4962
Description: Equivalence of existence implied by equality of ordered pairs. (Contributed by NM, 28-May-2008.)
Assertion
Ref Expression
opeqex  |-  ( <. A ,  B >.  = 
<. C ,  D >.  -> 
( ( A  e. 
_V  /\  B  e.  _V )  <->  ( C  e. 
_V  /\  D  e.  _V ) ) )

Proof of Theorem opeqex
StepHypRef Expression
1 neeq1 2856 . 2  |-  ( <. A ,  B >.  = 
<. C ,  D >.  -> 
( <. A ,  B >.  =/=  (/)  <->  <. C ,  D >.  =/=  (/) ) )
2 opnz 4942 . 2  |-  ( <. A ,  B >.  =/=  (/) 
<->  ( A  e.  _V  /\  B  e.  _V )
)
3 opnz 4942 . 2  |-  ( <. C ,  D >.  =/=  (/) 
<->  ( C  e.  _V  /\  D  e.  _V )
)
41, 2, 33bitr3g 302 1  |-  ( <. A ,  B >.  = 
<. C ,  D >.  -> 
( ( A  e. 
_V  /\  B  e.  _V )  <->  ( C  e. 
_V  /\  D  e.  _V ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990    =/= wne 2794   _Vcvv 3200   (/)c0 3915   <.cop 4183
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184
This theorem is referenced by:  oteqex2  4963  oteqex  4964  epelg  5030
  Copyright terms: Public domain W3C validator