MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eqnbrtrd Structured version   Visualization version   GIF version

Theorem eqnbrtrd 5124
Description: Substitution of equal classes into the negation of a binary relation. (Contributed by Glauco Siliprandi, 3-Jan-2021.)
Hypotheses
Ref Expression
eqnbrtrd.1 (𝜑𝐴 = 𝐵)
eqnbrtrd.2 (𝜑 → ¬ 𝐵𝑅𝐶)
Assertion
Ref Expression
eqnbrtrd (𝜑 → ¬ 𝐴𝑅𝐶)

Proof of Theorem eqnbrtrd
StepHypRef Expression
1 eqnbrtrd.2 . 2 (𝜑 → ¬ 𝐵𝑅𝐶)
2 eqnbrtrd.1 . . 3 (𝜑𝐴 = 𝐵)
32breq1d 5116 . 2 (𝜑 → (𝐴𝑅𝐶𝐵𝑅𝐶))
41, 3mtbird 325 1 (𝜑 → ¬ 𝐴𝑅𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1542   class class class wbr 5106
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2708
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2715  df-cleq 2729  df-clel 2815  df-rab 3409  df-v 3448  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-br 5107
This theorem is referenced by:  supgtoreq  9407  rlimno1  15539  pczndvds  16738  pcadd  16762  recld2  24180  itg2cnlem2  25130  dgrub  25598  gausslemma2dlem1a  26716  nosupbnd1lem1  27059  nosupbnd2lem1  27066  noinfbnd1lem1  27074  noinfbnd2  27082  mirbtwnhl  27625  sqrtcval  41920
  Copyright terms: Public domain W3C validator