ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-2nd Unicode version

Definition df-2nd 6101
Description: Define a function that extracts the second member, or ordinate, of an ordered pair. Theorem op2nd 6107 proves that it does this. For example,  ( 2nd ` 
<. 3 , 4 
>.) = 4 . Equivalent to Definition 5.13 (ii) of [Monk1] p. 52 (compare op2nda 5082 and op2ndb 5081). The notation is the same as Monk's. (Contributed by NM, 9-Oct-2004.)
Assertion
Ref Expression
df-2nd  |-  2nd  =  ( x  e.  _V  |->  U.
ran  { x } )

Detailed syntax breakdown of Definition df-2nd
StepHypRef Expression
1 c2nd 6099 . 2  class  2nd
2 vx . . 3  setvar  x
3 cvv 2721 . . 3  class  _V
42cv 1341 . . . . . 6  class  x
54csn 3570 . . . . 5  class  { x }
65crn 4599 . . . 4  class  ran  {
x }
76cuni 3783 . . 3  class  U. ran  { x }
82, 3, 7cmpt 4037 . 2  class  ( x  e.  _V  |->  U. ran  { x } )
91, 8wceq 1342 1  wff  2nd  =  ( x  e.  _V  |->  U.
ran  { x } )
Colors of variables: wff set class
This definition is referenced by:  2ndvalg  6103  fo2nd  6118  f2ndres  6120  fihashf1rn  10691
  Copyright terms: Public domain W3C validator