| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eqbrtr | Structured version Visualization version GIF version | ||
| Description: Substitution of equal classes in binary relation. (Contributed by Peter Mazsa, 14-Jun-2024.) |
| Ref | Expression |
|---|---|
| eqbrtr | ⊢ ((𝐴 = 𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5100 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶)) | |
| 2 | 1 | biimpar 477 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = 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: eqbrb 38409 |
| Copyright terms: Public domain | W3C validator |