| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Define a function that extracts the second member of an ordered pair. Theorem op2nd 4070 proves that it does this. Equivalent to Definition 5.13 (ii) of [Monk1] p. 52 (compare op2nda 3438 and op2ndb 3437). The notation is the same as Monk's. |
| Ref | Expression |
|---|---|
| df-2nd |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | c2nd 4062 |
. 2
| |
| 2 | vy |
. . . . 5
| |
| 3 | 2 | cv 952 |
. . . 4
|
| 4 | vx |
. . . . . . . 8
| |
| 5 | 4 | cv 952 |
. . . . . . 7
|
| 6 | 5 | csn 2399 |
. . . . . 6
|
| 7 | 6 | crn 3161 |
. . . . 5
|
| 8 | 7 | cuni 2493 |
. . . 4
|
| 9 | 3, 8 | wceq 953 |
. . 3
|
| 10 | 9, 4, 2 | copab 2656 |
. 2
|
| 11 | 1, 10 | wceq 953 |
1
|
| Colors of variables: wff set class |
| This definition is referenced by: 2ndval 4066 fo2nd 4076 f2ndres 4078 |