| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breqtrdi | GIF version | ||
| Description: A chained equality inference for a binary relation. (Contributed by NM, 11-Oct-1999.) |
| Ref | Expression |
|---|---|
| breqtrdi.1 | ⊢ (𝜑 → 𝐴𝑅𝐵) |
| breqtrdi.2 | ⊢ 𝐵 = 𝐶 |
| Ref | Expression |
|---|---|
| breqtrdi | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breqtrdi.1 | . 2 ⊢ (𝜑 → 𝐴𝑅𝐵) | |
| 2 | eqid 2238 | . 2 ⊢ 𝐴 = 𝐴 | |
| 3 | breqtrdi.2 | . 2 ⊢ 𝐵 = 𝐶 | |
| 4 | 1, 2, 3 | 3brtr3g 4164 | 1 ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = 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: breqtrrdi 4173 en2eleq 7553 en2other2 7554 dju0en 7576 ltm1sr 8150 maxle2 12000 xrmax2sup 12044 mertenslem2 12327 ege2le3 12462 cos01gt0 12554 sin02gt0 12555 cos12dec 12559 bitsfzolem 12745 bitsmod 12747 unennn 13345 dvef 15970 sin0pilem2 16026 cosq23lt0 16077 cosq34lt1 16095 cos02pilt1 16096 logbgcd1irraplemexp 16221 pellexlem2 16247 ppiqeq0 16297 ppiqub 16310 bposlem1 16328 bposlem2 16329 lgslem3 16343 lgsquadlem1 16418 lgsquadlem3 16420 trilpolemeq1 17313 |
| Copyright terms: Public domain | W3C validator |