Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqnbrtrd | Structured version Visualization version GIF version |
Description: Substitution of equal classes into the negation of a binary relation. (Contributed by Glauco Siliprandi, 3-Jan-2021.) |
Ref | Expression |
---|---|
eqnbrtrd.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
eqnbrtrd.2 | ⊢ (𝜑 → ¬ 𝐵𝑅𝐶) |
Ref | Expression |
---|---|
eqnbrtrd | ⊢ (𝜑 → ¬ 𝐴𝑅𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqnbrtrd.2 | . 2 ⊢ (𝜑 → ¬ 𝐵𝑅𝐶) | |
2 | eqnbrtrd.1 | . . 3 ⊢ (𝜑 → 𝐴 = 𝐵) | |
3 | 2 | breq1d 5067 | . 2 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶)) |
4 | 1, 3 | mtbird 327 | 1 ⊢ (𝜑 → ¬ 𝐴𝑅𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1531 class class class wbr 5057 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-rab 3145 df-v 3495 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-nul 4290 df-if 4466 df-sn 4560 df-pr 4562 df-op 4566 df-br 5058 |
This theorem is referenced by: supgtoreq 8926 rlimno1 15002 pczndvds 16193 pcadd 16217 recld2 23414 itg2cnlem2 24355 dgrub 24816 gausslemma2dlem1a 25933 mirbtwnhl 26458 noprefixmo 33195 nosupbnd1lem1 33201 nosupbnd2lem1 33208 |
Copyright terms: Public domain | W3C validator |