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

Theorem opthg 4240
Description: Ordered pair theorem.  C and  D are not required to be sets under our specific ordered pair definition. (Contributed by NM, 14-Oct-2005.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
opthg  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( <. A ,  B >.  =  <. C ,  D >.  <-> 
( A  =  C  /\  B  =  D ) ) )

Proof of Theorem opthg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opeq1 3780 . . . 4  |-  ( x  =  A  ->  <. x ,  y >.  =  <. A ,  y >. )
21eqeq1d 2186 . . 3  |-  ( x  =  A  ->  ( <. x ,  y >.  =  <. C ,  D >.  <->  <. A ,  y >.  =  <. C ,  D >. ) )
3 eqeq1 2184 . . . 4  |-  ( x  =  A  ->  (
x  =  C  <->  A  =  C ) )
43anbi1d 465 . . 3  |-  ( x  =  A  ->  (
( x  =  C  /\  y  =  D )  <->  ( A  =  C  /\  y  =  D ) ) )
52, 4bibi12d 235 . 2  |-  ( x  =  A  ->  (
( <. x ,  y
>.  =  <. C ,  D >. 
<->  ( x  =  C  /\  y  =  D ) )  <->  ( <. A ,  y >.  =  <. C ,  D >.  <->  ( A  =  C  /\  y  =  D ) ) ) )
6 opeq2 3781 . . . 4  |-  ( y  =  B  ->  <. A , 
y >.  =  <. A ,  B >. )
76eqeq1d 2186 . . 3  |-  ( y  =  B  ->  ( <. A ,  y >.  =  <. C ,  D >.  <->  <. A ,  B >.  = 
<. C ,  D >. ) )
8 eqeq1 2184 . . . 4  |-  ( y  =  B  ->  (
y  =  D  <->  B  =  D ) )
98anbi2d 464 . . 3  |-  ( y  =  B  ->  (
( A  =  C  /\  y  =  D )  <->  ( A  =  C  /\  B  =  D ) ) )
107, 9bibi12d 235 . 2  |-  ( y  =  B  ->  (
( <. A ,  y
>.  =  <. C ,  D >. 
<->  ( A  =  C  /\  y  =  D ) )  <->  ( <. A ,  B >.  =  <. C ,  D >.  <->  ( A  =  C  /\  B  =  D ) ) ) )
11 vex 2742 . . 3  |-  x  e. 
_V
12 vex 2742 . . 3  |-  y  e. 
_V
1311, 12opth 4239 . 2  |-  ( <.
x ,  y >.  =  <. C ,  D >.  <-> 
( x  =  C  /\  y  =  D ) )
145, 10, 13vtocl2g 2803 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( <. A ,  B >.  =  <. C ,  D >.  <-> 
( A  =  C  /\  B  =  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2148   <.cop 3597
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603
This theorem is referenced by:  opthg2  4241  xpopth  6179  eqop  6180  inl11  7066  preqlu  7473  cauappcvgprlemladd  7659  elrealeu  7830  qnumdenbi  12194  crth  12226  imasaddfnlemg  12740
  Copyright terms: Public domain W3C validator