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

Theorem opeq2i 3892
Description: Equality inference for ordered pairs. (Contributed by NM, 16-Dec-2006.)
Hypothesis
Ref Expression
opeq1i.1  |-  A  =  B
Assertion
Ref Expression
opeq2i  |-  <. C ,  A >.  =  <. C ,  B >.

Proof of Theorem opeq2i
StepHypRef Expression
1 opeq1i.1 . 2  |-  A  =  B
2 opeq2 3889 . 2  |-  ( A  =  B  ->  <. C ,  A >.  =  <. C ,  B >. )
31, 2ax-mp 5 1  |-  <. C ,  A >.  =  <. C ,  B >.
Colors of variables: wff set class
Syntax hints:    = wceq 1398   <.cop 3697
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3218  df-sn 3700  df-pr 3701  df-op 3703
This theorem is referenced by:  fnressn  5875  fressnfv  5876  nqprlu  7878  suplocexpr  8056  addresr  8168  iseqvalcbv  10845  pfx1  11420  pfxccatpfx2  11454  ressval2  13363  imasplusg  13572  eupth2lembfi  16598
  Copyright terms: Public domain W3C validator