| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqbrtrrid | GIF version | ||
| Description: B chained equality inference for a binary relation. (Contributed by NM, 17-Sep-2004.) |
| Ref | Expression |
|---|---|
| eqbrtrrid.1 | ⊢ 𝐵 = 𝐴 |
| eqbrtrrid.2 | ⊢ (𝜑 → 𝐵𝑅𝐶) |
| Ref | Expression |
|---|---|
| eqbrtrrid | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqbrtrrid.2 | . 2 ⊢ (𝜑 → 𝐵𝑅𝐶) | |
| 2 | eqbrtrrid.1 | . 2 ⊢ 𝐵 = 𝐴 | |
| 3 | eqid 2238 | . 2 ⊢ 𝐶 = 𝐶 | |
| 4 | 1, 2, 3 | 3brtr3g 4163 | 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: enpr1g 7085 pr2cv1 7541 endjudisj 7566 recexprlem1ssl 8000 addgt0 8776 addgegt0 8777 addgtge0 8778 addge0 8779 expge1 11015 expcnv 12273 fprodge1 12408 cos12dec 12537 3dvds 12633 bitsinv1lem 12730 ncoprmgcdne1b 12869 phicl2 12994 ballotfilemfrcn0 13275 exmidunben 13319 prdsvalstrd 13622 znidomb 14995 sin0pilem2 15886 cosq23lt0 15937 cos0pilt1 15956 rplogcl 15984 logge0 15985 logdivlti 15986 mersenne 16117 perfectlem2 16120 lgseisen 16205 lgsquadlem1 16208 |
| Copyright terms: Public domain | W3C validator |