| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breq12 | GIF version | ||
| Description: Equality theorem for a binary relation. (Contributed by NM, 8-Feb-1996.) |
| Ref | Expression |
|---|---|
| breq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4134 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐶)) | |
| 2 | breq2 4135 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵𝑅𝐶 ↔ 𝐵𝑅𝐷)) | |
| 3 | 1, 2 | sylan9bb 466 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 class class class wbr 4131 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-sn 3715 df-pr 3716 df-op 3718 df-br 4132 |
| This theorem is used by: breq12i 4140 breq12d 4144 breqan12d 4147 posng 4849 isopolem 6031 poxp 6472 rbropapd 6517 ecopover 6911 ecopoverg 6914 ltdcnq 7770 recexpr 8011 ltresr 8212 reapval 8912 ltxr 10194 xrltnr 10198 xrltnsym 10212 xrlttr 10214 xrltso 10215 xrlttri3 10216 xposdif 10301 f1olecpbl 13693 wlk2f 16797 dichmul0orlem3 16960 exmidsbthrlem 17273 |
| Copyright terms: Public domain | W3C validator |