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

Theorem opthg 4267
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 3804 . . . 4  |-  ( x  =  A  ->  <. x ,  y >.  =  <. A ,  y >. )
21eqeq1d 2202 . . 3  |-  ( x  =  A  ->  ( <. x ,  y >.  =  <. C ,  D >.  <->  <. A ,  y >.  =  <. C ,  D >. ) )
3 eqeq1 2200 . . . 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 3805 . . . 4  |-  ( y  =  B  ->  <. A , 
y >.  =  <. A ,  B >. )
76eqeq1d 2202 . . 3  |-  ( y  =  B  ->  ( <. A ,  y >.  =  <. C ,  D >.  <->  <. A ,  B >.  = 
<. C ,  D >. ) )
8 eqeq1 2200 . . . 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 2763 . . 3  |-  x  e. 
_V
12 vex 2763 . . 3  |-  y  e. 
_V
1311, 12opth 4266 . 2  |-  ( <.
x ,  y >.  =  <. C ,  D >.  <-> 
( x  =  C  /\  y  =  D ) )
145, 10, 13vtocl2g 2824 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 1364    e. wcel 2164   <.cop 3621
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627
This theorem is referenced by:  opthg2  4268  xpopth  6229  eqop  6230  inl11  7124  preqlu  7532  cauappcvgprlemladd  7718  elrealeu  7889  qnumdenbi  12330  crth  12362  imasaddfnlemg  12897
  Copyright terms: Public domain W3C validator