| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > breqi | Unicode version | ||
| Description: Equality inference for binary relations. (Contributed by NM, 19-Feb-2005.) |
| Ref | Expression |
|---|---|
| breqi.1 |
|
| Ref | Expression |
|---|---|
| breqi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breqi.1 |
. 2
| |
| 2 | breq 4090 |
. 2
| |
| 3 | 1, 2 | ax-mp 5 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-5 1495 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-4 1558 ax-17 1574 ax-ial 1582 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-cleq 2224 df-clel 2227 df-br 4089 |
| This theorem is referenced by: f1ompt 5798 brtpos2 6416 tfrexlem 6499 brdifun 6728 ltpiord 7538 ltxrlt 8244 ltxr 10009 xmeterval 15158 |
| Copyright terms: Public domain | W3C validator |