| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 3brtr4g | Structured version Visualization version GIF version | ||
| Description: Substitution of equality into both sides of a binary relation. (Contributed by NM, 16-Jan-1997.) |
| Ref | Expression |
|---|---|
| 3brtr4g.1 | ⊢ (𝜑 → 𝐴𝑅𝐵) |
| 3brtr4g.2 | ⊢ 𝐶 = 𝐴 |
| 3brtr4g.3 | ⊢ 𝐷 = 𝐵 |
| Ref | Expression |
|---|---|
| 3brtr4g | ⊢ (𝜑 → 𝐶𝑅𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3brtr4g.1 | . 2 ⊢ (𝜑 → 𝐴𝑅𝐵) | |
| 2 | 3brtr4g.2 | . . 3 ⊢ 𝐶 = 𝐴 | |
| 3 | 3brtr4g.3 | . . 3 ⊢ 𝐷 = 𝐵 | |
| 4 | 2, 3 | breq12i 5106 | . 2 ⊢ (𝐶𝑅𝐷 ↔ 𝐴𝑅𝐵) |
| 5 | 1, 4 | sylibr 234 | 1 ⊢ (𝜑 → 𝐶𝑅𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 class class class wbr 5097 |
| 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 2707 |
| 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 2714 df-cleq 2727 df-clel 2810 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4285 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 |
| This theorem is referenced by: eqbrtrid 5132 enrefnn 8985 limensuci 9083 infensuc 9085 djuen 10082 djudom1 10095 rlimneg 15572 isumsup2 15771 crth 16707 4sqlem6 16873 gzrngunit 21390 matgsum 22383 ovolunlem1a 25455 ovolfiniun 25460 ioombl1lem1 25517 ioombl1lem4 25520 iblss 25764 itgle 25769 dvfsumlem3 25993 emcllem6 26969 gausslemma2dlem0f 27330 gausslemma2dlem0g 27331 pntpbnd1a 27554 ostth2lem4 27605 noinfbnd2lem1 27700 omsmon 34434 itg2gt0cn 37845 dalem-cly 39966 dalem10 39968 fourierdlem103 46490 fourierdlem104 46491 |
| Copyright terms: Public domain | W3C validator |