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

Theorem op2nda 6131
Description: Extract the second member of an ordered pair. (See op1sta 6128 to extract the first member, op2ndb 6130 for an alternate version, and op2nd 7840 for the preferred version.) (Contributed by NM, 17-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Hypotheses
Ref Expression
cnvsn.1 𝐴 ∈ V
cnvsn.2 𝐵 ∈ V
Assertion
Ref Expression
op2nda ran {⟨𝐴, 𝐵⟩} = 𝐵

Proof of Theorem op2nda
StepHypRef Expression
1 cnvsn.1 . . . 4 𝐴 ∈ V
21rnsnop 6127 . . 3 ran {⟨𝐴, 𝐵⟩} = {𝐵}
32unieqi 4852 . 2 ran {⟨𝐴, 𝐵⟩} = {𝐵}
4 cnvsn.2 . . 3 𝐵 ∈ V
54unisn 4861 . 2 {𝐵} = 𝐵
63, 5eqtri 2766 1 ran {⟨𝐴, 𝐵⟩} = 𝐵
Colors of variables: wff setvar class
Syntax hints:   = wceq 1539  wcel 2106  Vcvv 3432  {csn 4561  cop 4567   cuni 4839  ran crn 5590
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600
This theorem is referenced by:  elxp4  7769  elxp5  7770  op2nd  7840  fo2nd  7852  f2ndres  7856  ixpsnf1o  8726  xpassen  8853  xpdom2  8854
  Copyright terms: Public domain W3C validator