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

Theorem breq2i 3937
Description: Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.)
Hypothesis
Ref Expression
breq1i.1  |-  A  =  B
Assertion
Ref Expression
breq2i  |-  ( C R A  <->  C R B )

Proof of Theorem breq2i
StepHypRef Expression
1 breq1i.1 . 2  |-  A  =  B
2 breq2 3933 . 2  |-  ( A  =  B  ->  ( C R A  <->  C R B ) )
31, 2ax-mp 5 1  |-  ( C R A  <->  C R B )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    = wceq 1331   class class class wbr 3929
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 2121
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534  df-op 3536  df-br 3930
This theorem is referenced by:  breqtri  3953  en1  6693  snnen2og  6753  1nen2  6755  pm54.43  7046  caucvgprprlemval  7496  caucvgprprlemmu  7503  caucvgsr  7610  pitonnlem1  7653  lt0neg2  8231  le0neg2  8233  negap0  8392  recexaplem2  8413  recgt1  8655  crap0  8716  addltmul  8956  nn0lt10b  9131  nn0lt2  9132  3halfnz  9148  xlt0neg2  9622  xle0neg2  9624  iccshftr  9777  iccshftl  9779  iccdil  9781  icccntr  9783  fihashen1  10545  cjap0  10679  abs00ap  10834  xrmaxiflemval  11019  mertenslem2  11305  mertensabs  11306  3dvdsdec  11562  3dvds2dec  11563  ndvdsi  11630  3prm  11809  prmfac1  11830  sinhalfpilem  12872  sincosq1lem  12906  sincosq1sgn  12907  sincosq2sgn  12908  sincosq3sgn  12909  sincosq4sgn  12910
  Copyright terms: Public domain W3C validator