| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > releqd | Unicode version | ||
| Description: Equality deduction for the relation predicate. (Contributed by NM, 8-Mar-2014.) |
| Ref | Expression |
|---|---|
| releqd.1 |
|
| Ref | Expression |
|---|---|
| releqd |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | releqd.1 |
. 2
| |
| 2 | releq 4837 |
. 2
| |
| 3 | 1, 2 | syl 14 |
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 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-in 3220 df-ss 3227 df-rel 4761 |
| This theorem is referenced by: dftpos3 6506 tposfo2 6511 tposf12 6513 imasaddfnlemg 13578 releqgg 13973 dvdsrd 14339 isunitd 14351 cnprcl2k 15197 |
| Copyright terms: Public domain | W3C validator |