![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eqbrtrrdi | GIF version |
Description: A chained equality inference for a binary relation. (Contributed by NM, 4-Jan-2006.) |
Ref | Expression |
---|---|
eqbrtrrdi.1 | ⊢ (𝜑 → 𝐵 = 𝐴) |
eqbrtrrdi.2 | ⊢ 𝐵𝑅𝐶 |
Ref | Expression |
---|---|
eqbrtrrdi | ⊢ (𝜑 → 𝐴𝑅𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqbrtrrdi.1 | . . 3 ⊢ (𝜑 → 𝐵 = 𝐴) | |
2 | 1 | eqcomd 2183 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) |
3 | eqbrtrrdi.2 | . 2 ⊢ 𝐵𝑅𝐶 | |
4 | 2, 3 | eqbrtrdi 4042 | 1 ⊢ (𝜑 → 𝐴𝑅𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1353 class class class wbr 4003 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-un 3133 df-sn 3598 df-pr 3599 df-op 3601 df-br 4004 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |