| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqbrtrid | GIF version | ||
| Description: B chained equality inference for a binary relation. (Contributed by NM, 11-Oct-1999.) |
| Ref | Expression |
|---|---|
| eqbrtrid.1 | ⊢ 𝐴 = 𝐵 |
| eqbrtrid.2 | ⊢ (𝜑 → 𝐵𝑅𝐶) |
| Ref | Expression |
|---|---|
| eqbrtrid | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqbrtrid.2 | . 2 ⊢ (𝜑 → 𝐵𝑅𝐶) | |
| 2 | eqbrtrid.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 3 | eqid 2238 | . 2 ⊢ 𝐶 = 𝐶 | |
| 4 | 1, 2, 3 | 3brtr4g 4164 | 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: rex2dom 7110 xp1en 7121 caucvgprlemm 8035 intqfrac2 10756 m1modge3gt1 10808 bernneq2 11099 reccn2ap 12079 eirraplem 12544 nno 12673 bitsfzolem 12721 bitsinv1lem 12728 oddprmge3 12913 sqnprm 12914 4sqlem6 13162 4sqlem13m 13182 4sqlem16 13185 4sqlem17 13186 2expltfac 13218 oddennn 13283 strle2g 13461 strle3g 13462 1strstrg 13470 2strstrndx 13472 2strstrg 13473 rngstrg 13489 srngstrd 13500 lmodstrd 13518 ipsstrd 13530 topgrpstrd 13550 imasvalstrd 13619 znidom 14992 psmetge0 15432 reeff1olem 15872 cosq14gt0 15933 cosq34lt1 15951 ioocosf1o 15955 mersenne 16111 gausslemma2dlem0c 16170 gausslemma2dlem0e 16172 lgseisenlem1 16189 lgsquadlem1 16196 lgsquadlem2 16197 lgsquadlem3 16198 pwf1oexmid 17029 trilpolemeq1 17089 |
| Copyright terms: Public domain | W3C validator |