| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Ordered pair membership in a restriction. Exercise 13 of [TakeutiZaring] p. 25. |
| Ref | Expression |
|---|---|
| opelres.1 |
|
| Ref | Expression |
|---|---|
| opelres |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 4006 |
. . 3
| |
| 2 | 1 | eleq2i 1961 |
. 2
|
| 3 | elin 2786 |
. 2
| |
| 4 | opelres.1 |
. . . . 5
| |
| 5 | 4 | opelxp 4036 |
. . . 4
|
| 6 | 5, 4 | mpbiran2 799 |
. . 3
|
| 7 | 6 | anbi2i 538 |
. 2
|
| 8 | 2, 3, 7 | 3bitri 194 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: brres 4223 opelresg 4224 opres 4225 opresOLD 4226 dmres 4234 relssres 4248 resiexg 4253 iss 4254 issOLD 4255 asymref 4308 asymrefOLD 4309 ssrnres 4354 rninxpOLD 4356 funssres 4460 fcoi1OLD 4585 fcoi2OLD 4587 fcnvres 4589 fsplit 5086 gapmlem 9461 elres 13824 restidsing 14391 cnvresima 15359 filnetlem4 15643 |
| 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-res 4006 |