| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breqtrrdi | GIF version | ||
| Description: A chained equality inference for a binary relation. (Contributed by NM, 24-Apr-2005.) |
| Ref | Expression |
|---|---|
| breqtrrdi.1 | ⊢ (𝜑 → 𝐴𝑅𝐵) |
| breqtrrdi.2 | ⊢ 𝐶 = 𝐵 |
| Ref | Expression |
|---|---|
| breqtrrdi | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breqtrrdi.1 | . 2 ⊢ (𝜑 → 𝐴𝑅𝐵) | |
| 2 | breqtrrdi.2 | . . 3 ⊢ 𝐶 = 𝐵 | |
| 3 | 2 | eqcomi 2242 | . 2 ⊢ 𝐵 = 𝐶 |
| 4 | 1, 3 | breqtrdi 4171 | 1 ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 class class class wbr 4130 |
| 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 4131 |
| This theorem is used by: enpr2d 7111 fiunsnnn 7185 exmidpw2en 7219 unsnfi 7226 2omapfi 7320 eninl 7437 eninr 7438 difinfinf 7441 exmidfodomrlemr 7554 exmidfodomrlemrALT 7555 dju1en 7569 djucomen 7572 djuassen 7573 xpdjuen 7574 gtndiv 9745 intqfrac2 10769 uzenom 10875 xrmaxiflemval 12032 ege2le3 12454 eirraplem 12560 bitsfzo 12738 pcprendvds 13089 pcpremul 13092 pcfaclem 13148 infpnlem2 13159 2strstr1g 13525 lmcn2 15430 dveflem 15876 tangtx 15989 ioocosf1o 16005 bposlem1 16209 bposlem2 16210 bposlem3 16211 lgsdirprm 16251 sbthom 17169 nconstwlpolemgt0 17212 |
| Copyright terms: Public domain | W3C validator |