![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > eqbrb | Structured version Visualization version GIF version |
Description: Substitution of equal classes in a binary relation. (Contributed by Peter Mazsa, 14-Jun-2024.) |
Ref | Expression |
---|---|
eqbrb | ⊢ ((𝐴 = 𝐵 ∧ 𝐴𝑅𝐶) ↔ (𝐴 = 𝐵 ∧ 𝐵𝑅𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 482 | . . . 4 ⊢ ((𝐵 = 𝐴 ∧ 𝐴𝑅𝐶) → 𝐵 = 𝐴) | |
2 | eqbrtr 37702 | . . . 4 ⊢ ((𝐵 = 𝐴 ∧ 𝐴𝑅𝐶) → 𝐵𝑅𝐶) | |
3 | 1, 2 | jca 511 | . . 3 ⊢ ((𝐵 = 𝐴 ∧ 𝐴𝑅𝐶) → (𝐵 = 𝐴 ∧ 𝐵𝑅𝐶)) |
4 | eqcom 2735 | . . . 4 ⊢ (𝐵 = 𝐴 ↔ 𝐴 = 𝐵) | |
5 | 4 | anbi1i 623 | . . 3 ⊢ ((𝐵 = 𝐴 ∧ 𝐴𝑅𝐶) ↔ (𝐴 = 𝐵 ∧ 𝐴𝑅𝐶)) |
6 | 4 | anbi1i 623 | . . 3 ⊢ ((𝐵 = 𝐴 ∧ 𝐵𝑅𝐶) ↔ (𝐴 = 𝐵 ∧ 𝐵𝑅𝐶)) |
7 | 3, 5, 6 | 3imtr3i 291 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐴𝑅𝐶) → (𝐴 = 𝐵 ∧ 𝐵𝑅𝐶)) |
8 | simpl 482 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐵𝑅𝐶) → 𝐴 = 𝐵) | |
9 | eqbrtr 37702 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶) | |
10 | 8, 9 | jca 511 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐵𝑅𝐶) → (𝐴 = 𝐵 ∧ 𝐴𝑅𝐶)) |
11 | 7, 10 | impbii 208 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐴𝑅𝐶) ↔ (𝐴 = 𝐵 ∧ 𝐵𝑅𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1534 class class class wbr 5148 |
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 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2699 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2706 df-cleq 2720 df-clel 2806 df-rab 3430 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-br 5149 |
This theorem is referenced by: ressn2 37914 trressn 37917 |
Copyright terms: Public domain | W3C validator |