MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  op1sta Structured version   Visualization version   GIF version

Theorem op1sta 5586
Description: Extract the first member of an ordered pair. (See op2nda 5589 to extract the second member, op1stb 4911 for an alternate version, and op1st 7136 for the preferred version.) (Contributed by Raph Levien, 4-Dec-2003.)
Hypotheses
Ref Expression
cnvsn.1 𝐴 ∈ V
cnvsn.2 𝐵 ∈ V
Assertion
Ref Expression
op1sta dom {⟨𝐴, 𝐵⟩} = 𝐴

Proof of Theorem op1sta
StepHypRef Expression
1 cnvsn.2 . . . 4 𝐵 ∈ V
21dmsnop 5578 . . 3 dom {⟨𝐴, 𝐵⟩} = {𝐴}
32unieqi 4418 . 2 dom {⟨𝐴, 𝐵⟩} = {𝐴}
4 cnvsn.1 . . 3 𝐴 ∈ V
54unisn 4424 . 2 {𝐴} = 𝐴
63, 5eqtri 2643 1 dom {⟨𝐴, 𝐵⟩} = 𝐴
Colors of variables: wff setvar class
Syntax hints:   = wceq 1480  wcel 1987  Vcvv 3190  {csn 4155  cop 4161   cuni 4409  dom cdm 5084
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pr 4877
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-rex 2914  df-rab 2917  df-v 3192  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-dm 5094
This theorem is referenced by:  elxp4  7072  op1st  7136  fo1st  7148  f1stres  7150  xpassen  8014  xpdom2  8015
  Copyright terms: Public domain W3C validator