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

Theorem opeq1d 3706
Description: Equality deduction for ordered pairs. (Contributed by NM, 16-Dec-2006.)
Hypothesis
Ref Expression
opeq1d.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
opeq1d  |-  ( ph  -> 
<. A ,  C >.  = 
<. B ,  C >. )

Proof of Theorem opeq1d
StepHypRef Expression
1 opeq1d.1 . 2  |-  ( ph  ->  A  =  B )
2 opeq1 3700 . 2  |-  ( A  =  B  ->  <. A ,  C >.  =  <. B ,  C >. )
31, 2syl 14 1  |-  ( ph  -> 
<. A ,  C >.  = 
<. B ,  C >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1331   <.cop 3525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531
This theorem is referenced by:  oteq1  3709  oteq2  3710  opth  4154  cbvoprab2  5837  djuf1olem  6931  dfplpq2  7155  ltexnqq  7209  nnanq0  7259  addpinq1  7265  prarloclemlo  7295  prarloclem3  7298  prarloclem5  7301  prsrriota  7589  caucvgsrlemfv  7592  caucvgsr  7603  pitonnlem2  7648  pitonn  7649  recidpirq  7659  ax1rid  7678  axrnegex  7680  nntopi  7695  axcaucvglemval  7698  fseq1m1p1  9868  frecuzrdglem  10177  frecuzrdgg  10182  frecuzrdgdomlem  10183  frecuzrdgfunlem  10185  frecuzrdgsuctlem  10189  fsum2dlemstep  11196  ennnfonelemp1  11908  ennnfonelemnn0  11924
  Copyright terms: Public domain W3C validator