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 5081 | . 2 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
4 | breq123d.2 | . . 3 ⊢ (𝜑 → 𝑅 = 𝑆) | |
5 | 4 | breqd 5079 | . 2 ⊢ (𝜑 → (𝐵𝑅𝐷 ↔ 𝐵𝑆𝐷)) |
6 | 3, 5 | bitrd 281 | 1 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑆𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 class class class wbr 5068 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 |
This theorem is referenced by: sbcbr123 5122 fmptco 6893 xpsle 16854 invfuc 17246 yonedainv 17533 opphllem3 26537 lmif 26573 islmib 26575 iscgra 26597 isinag 26626 fmptcof2 30404 submomnd 30713 sgnsv 30804 inftmrel 30811 isinftm 30812 submarchi 30817 suborng 30890 uncov 34875 iscvlat 36461 paddfval 36935 lhpset 37133 tendofset 37896 diaffval 38168 fnwe2val 39656 aomclem8 39668 afv2eq12d 43421 |
Copyright terms: Public domain | W3C validator |