Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > reseq2i | Unicode version |
Description: Equality inference for restrictions. (Contributed by Paul Chapman, 22-Jun-2011.) |
Ref | Expression |
---|---|
reseqi.1 |
Ref | Expression |
---|---|
reseq2i |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reseqi.1 | . 2 | |
2 | reseq2 4607 | . 2 | |
3 | 1, 2 | ax-mp 7 | 1 |
Colors of variables: wff set class |
Syntax hints: wceq 1243 cres 4347 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-v 2559 df-in 2924 df-opab 3819 df-xp 4351 df-res 4357 |
This theorem is referenced by: reseq12i 4610 rescom 4636 rescnvcnv 4783 resdm2 4811 funcnvres 4972 funimaexg 4983 resdif 5148 frecfnom 5986 |
Copyright terms: Public domain | W3C validator |