| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breqtrrid | GIF version | ||
| Description: B chained equality inference for a binary relation. (Contributed by NM, 24-Apr-2005.) |
| Ref | Expression |
|---|---|
| breqtrrid.1 | ⊢ 𝐴𝑅𝐵 |
| breqtrrid.2 | ⊢ (𝜑 → 𝐶 = 𝐵) |
| Ref | Expression |
|---|---|
| breqtrrid | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breqtrrid.1 | . 2 ⊢ 𝐴𝑅𝐵 | |
| 2 | breqtrrid.2 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐵) | |
| 3 | 2 | eqcomd 2244 | . 2 ⊢ (𝜑 → 𝐵 = 𝐶) |
| 4 | 1, 3 | breqtrid 4167 | 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: xsubge0 10283 xposdif 10284 bernneq 11098 bitsfzo 12722 bitsmod 12723 bitsinv1lem 12728 pcge0 13092 ballotfilem5 13242 rpabscxpbnd 16042 lgsdir2lem2 16148 2lgsoddprmlem3 16230 eupth2lem3lem3fi 16711 eupth2lembfi 16718 trilpolemclim 17085 trilpolemlt1 17090 nconstwlpolemgt0 17114 |
| Copyright terms: Public domain | W3C validator |