| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > reseq1 | Unicode version | ||
| Description: Equality theorem for restrictions. (Contributed by NM, 7-Aug-1994.) |
| Ref | Expression |
|---|---|
| reseq1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ineq1 3398 |
. 2
| |
| 2 | df-res 4731 |
. 2
| |
| 3 | df-res 4731 |
. 2
| |
| 4 | 1, 2, 3 | 3eqtr4g 2287 |
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-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-in 3203 df-res 4731 |
| This theorem is referenced by: reseq1i 5001 reseq1d 5004 imaeq1 5063 relcoi1 5260 tfr0dm 6474 tfrlemiex 6483 tfr1onlemex 6499 tfr1onlemaccex 6500 tfrcllemsucaccv 6506 tfrcllembxssdm 6508 tfrcllemex 6512 tfrcllemaccex 6513 tfrcllemres 6514 pmresg 6831 lmbr 14902 |
| Copyright terms: Public domain | W3C validator |