![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > breq123d | Structured version Visualization version GIF version |
Description: Equality deduction for a binary relation. (Contributed by NM, 29-Oct-2011.) |
Ref | Expression |
---|---|
breq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
breq123d.2 | ⊢ (𝜑 → 𝑅 = 𝑆) |
breq123d.3 | ⊢ (𝜑 → 𝐶 = 𝐷) |
Ref | Expression |
---|---|
breq123d | ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑆𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1d.1 | . . 3 ⊢ (𝜑 → 𝐴 = 𝐵) | |
2 | breq123d.3 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐷) | |
3 | 1, 2 | breq12d 5156 | . 2 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
4 | breq123d.2 | . . 3 ⊢ (𝜑 → 𝑅 = 𝑆) | |
5 | 4 | breqd 5154 | . 2 ⊢ (𝜑 → (𝐵𝑅𝐷 ↔ 𝐵𝑆𝐷)) |
6 | 3, 5 | bitrd 279 | 1 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑆𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1534 class class class wbr 5143 |
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 3429 df-v 3472 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4320 df-if 4526 df-sn 4626 df-pr 4628 df-op 4632 df-br 5144 |
This theorem is referenced by: sbcbr123 5197 fmptco 7133 xpsle 17555 invfuc 17960 yonedainv 18267 opphllem3 28547 lmif 28583 islmib 28585 iscgra 28607 isinag 28636 fmptcof2 32437 submomnd 32785 sgnsv 32876 inftmrel 32883 isinftm 32884 submarchi 32889 rlocval 32968 suborng 33025 rprmval 33225 uncov 37069 iscvlat 38790 paddfval 39265 lhpset 39463 tendofset 40226 diaffval 40498 fnwe2val 42464 aomclem8 42476 afv2eq12d 46586 |
Copyright terms: Public domain | W3C validator |