| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > breqan12rd | Structured version Visualization version GIF version | ||
| Description: Equality deduction for a binary relation. (Contributed by NM, 8-Feb-1996.) |
| Ref | Expression |
|---|---|
| breq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| breqan12i.2 | ⊢ (𝜓 → 𝐶 = 𝐷) |
| Ref | Expression |
|---|---|
| breqan12rd | ⊢ ((𝜓 ∧ 𝜑) → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1d.1 | . . 3 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | breqan12i.2 | . . 3 ⊢ (𝜓 → 𝐶 = 𝐷) | |
| 3 | 1, 2 | breqan12d 5123 | . 2 ⊢ ((𝜑 ∧ 𝜓) → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
| 4 | 3 | ancoms 464 | 1 ⊢ ((𝜓 ∧ 𝜑) → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 class class class wbr 5107 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 |
| This theorem is used by: f1oweALT 7973 ledivdiv 12132 xltnegi 13272 ramub1lem1 17124 dvferm1 26219 dvferm2 26221 dvivthlem1 26242 ulmdvlem3 26645 gausslemma2dlem3 27612 lgsquad 27627 areacirclem4 38468 areacirclem5 38469 iccpartgt 48335 |
| Copyright terms: Public domain | W3C validator |