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

Theorem eqnbrtrd 5127
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 5117 . 2 (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶))
41, 3mtbird 328 1 (𝜑 → ¬ 𝐴𝑅𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1572   class class class wbr 5107
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108
This theorem is used by:  supgtoreq  9499  rlimno1  15864  pczndvds  17089  pcadd  17113  recld2  25191  itg2cnlem2  26140  dgrub  26610  gausslemma2dlem1a  27751  nosupbnd1lem1  28124  nosupbnd2lem1  28131  noinfbnd1lem1  28139  noinfbnd2  28147  mirbtwnhl  29211  mullt0b2d  43813  sqrtcval  44962
  Copyright terms: Public domain W3C validator