| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Restriction of a class abstraction of ordered pairs. |
| Ref | Expression |
|---|---|
| resopab |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 4006 |
. 2
| |
| 2 | df-xp 4000 |
. . . . 5
| |
| 3 | visset 2295 |
. . . . . . 7
| |
| 4 | 3 | biantru 793 |
. . . . . 6
|
| 5 | 4 | opabbii 3402 |
. . . . 5
|
| 6 | 2, 5 | eqtr4i 1911 |
. . . 4
|
| 7 | 6 | ineq2i 2793 |
. . 3
|
| 8 | incom 2787 |
. . 3
| |
| 9 | 7, 8 | eqtri 1908 |
. 2
|
| 10 | inopab 4108 |
. 2
| |
| 11 | 1, 9, 10 | 3eqtri 1912 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: resopab2 4256 isarep2 4499 resoprab 4938 f1stres 5034 f2ndres 5035 df1st2 5068 df2nd2 5069 seqzres2 7804 sumeq2 8245 subtop 8916 grpidvallem 9341 fiv 10212 idrval 10374 h2hlm 10482 iscst1 14519 mxlelt2 14606 mxlelt 14607 mnlelt2 14608 prodeq2 14661 trclval 15271 phtpycom 16050 phtpycolem3 16053 phtpycolem4 16054 addrfv 16469 subrfv 16470 mulvfv 16471 addrfn 16472 subrfn 16473 mulvfn 16474 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 df-eu 1775 df-mo 1776 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-v 2294 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-op 3053 df-opab 3396 df-xp 4000 df-rel 4001 df-res 4006 |