| 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 5119 | . 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 5103 |
| 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 2733 |
| 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 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 |
| This theorem is used by: f1oweALT 7973 ledivdiv 12184 xltnegi 13324 ramub1lem1 17181 dvferm1 26282 dvferm2 26284 dvivthlem1 26305 ulmdvlem3 26708 gausslemma2dlem3 27674 lgsquad 27689 areacirclem4 38594 areacirclem5 38595 iccpartgt 48450 |
| Copyright terms: Public domain | W3C validator |