Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > op1sta | Structured version Visualization version GIF version |
Description: Extract the first member of an ordered pair. (See op2nda 6079 to extract the second member, op1stb 5355 for an alternate version, and op1st 7691 for the preferred version.) (Contributed by Raph Levien, 4-Dec-2003.) |
Ref | Expression |
---|---|
cnvsn.1 | ⊢ 𝐴 ∈ V |
cnvsn.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
op1sta | ⊢ ∪ dom {〈𝐴, 𝐵〉} = 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnvsn.2 | . . . 4 ⊢ 𝐵 ∈ V | |
2 | 1 | dmsnop 6067 | . . 3 ⊢ dom {〈𝐴, 𝐵〉} = {𝐴} |
3 | 2 | unieqi 4840 | . 2 ⊢ ∪ dom {〈𝐴, 𝐵〉} = ∪ {𝐴} |
4 | cnvsn.1 | . . 3 ⊢ 𝐴 ∈ V | |
5 | 4 | unisn 4847 | . 2 ⊢ ∪ {𝐴} = 𝐴 |
6 | 3, 5 | eqtri 2844 | 1 ⊢ ∪ dom {〈𝐴, 𝐵〉} = 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2110 Vcvv 3494 {csn 4560 〈cop 4566 ∪ cuni 4831 dom cdm 5549 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-dm 5559 |
This theorem is referenced by: elxp4 7621 op1st 7691 fo1st 7703 f1stres 7707 xpassen 8605 xpdom2 8606 |
Copyright terms: Public domain | W3C validator |