MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-1st Structured version   Visualization version   GIF version

Definition df-1st 8030
Description: Define a function that extracts the first member, or abscissa, of an ordered pair. Theorem op1st 8038 proves that it does this. For example, (1st ‘⟨3, 4⟩) = 3. Equivalent to Definition 5.13 (i) of [Monk1] p. 52 (compare op1sta 6256 and op1stb 5491). The notation is the same as Monk's. (Contributed by NM, 9-Oct-2004.)
Assertion
Ref Expression
df-1st 1st = (𝑥 ∈ V ↦ dom {𝑥})

Detailed syntax breakdown of Definition df-1st
StepHypRef Expression
1 c1st 8028 . 2 class 1st
2 vx . . 3 setvar 𝑥
3 cvv 3488 . . 3 class V
42cv 1536 . . . . . 6 class 𝑥
54csn 4648 . . . . 5 class {𝑥}
65cdm 5700 . . . 4 class dom {𝑥}
76cuni 4931 . . 3 class dom {𝑥}
82, 3, 7cmpt 5249 . 2 class (𝑥 ∈ V ↦ dom {𝑥})
91, 8wceq 1537 1 wff 1st = (𝑥 ∈ V ↦ dom {𝑥})
Colors of variables: wff setvar class
This definition is referenced by:  1stval  8032  fo1st  8050  f1stres  8054
  Copyright terms: Public domain W3C validator