Theorem eqnbrtrd 5104

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

Step	Hyp	Ref	Expression
1		eqnbrtrd.2	. 2 ⊢ (𝜑 → ¬ 𝐵𝑅𝐶)
2		eqnbrtrd.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
3	2	breq1d 5096	. 2 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶))
4	1, 3	mtbird 325	1 ⊢ (𝜑 → ¬ 𝐴𝑅𝐶)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1542   class class class wbr 5086

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087

This theorem is referenced by:  supgtoreq  9386  rlimno1  15618  pczndvds  16838  pcadd  16862  recld2  24782  itg2cnlem2  25731  dgrub  26201  gausslemma2dlem1a  27330  nosupbnd1lem1  27674  nosupbnd2lem1  27681  noinfbnd1lem1  27689  noinfbnd2  27697  mirbtwnhl  28750  mullt0b2d  42931  sqrtcval  44070