Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-1st | Structured version Visualization version GIF version |
Description: Define a function that extracts the first member, or abscissa, of an ordered pair. Theorem op1st 7846 proves that it does this. For example, (1st ‘〈3, 4〉) = 3. Equivalent to Definition 5.13 (i) of [Monk1] p. 52 (compare op1sta 6131 and op1stb 5385). The notation is the same as Monk's. (Contributed by NM, 9-Oct-2004.) |
Ref | Expression |
---|---|
df-1st | ⊢ 1st = (𝑥 ∈ V ↦ ∪ dom {𝑥}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | c1st 7836 | . 2 class 1st | |
2 | vx | . . 3 setvar 𝑥 | |
3 | cvv 3431 | . . 3 class V | |
4 | 2 | cv 1537 | . . . . . 6 class 𝑥 |
5 | 4 | csn 4560 | . . . . 5 class {𝑥} |
6 | 5 | cdm 5588 | . . . 4 class dom {𝑥} |
7 | 6 | cuni 4838 | . . 3 class ∪ dom {𝑥} |
8 | 2, 3, 7 | cmpt 5156 | . 2 class (𝑥 ∈ V ↦ ∪ dom {𝑥}) |
9 | 1, 8 | wceq 1538 | 1 wff 1st = (𝑥 ∈ V ↦ ∪ dom {𝑥}) |
Colors of variables: wff setvar class |
This definition is referenced by: 1stval 7840 fo1st 7858 f1stres 7862 |
Copyright terms: Public domain | W3C validator |