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

Theorem eqnbrtrd 4595
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 4587 . 2 (𝜑 → (𝐴𝑅𝐶𝐵𝑅𝐶))
41, 3mtbird 313 1 (𝜑 → ¬ 𝐴𝑅𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1474   class class class wbr 4577
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-10 2005  ax-11 2020  ax-12 2032  ax-13 2232  ax-ext 2589
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-rab 2904  df-v 3174  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-sn 4125  df-pr 4127  df-op 4131  df-br 4578
This theorem is referenced by:  gausslemma2dlem1a  24807
  Copyright terms: Public domain W3C validator