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

Theorem op2nda 6170
Description: Extract the second member of an ordered pair. (See op1sta 6167 to extract the first member, op2ndb 6169 for an alternate version, and op2nd 7925 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 6166 . . 3 ran {⟨𝐴, 𝐵⟩} = {𝐵}
32unieqi 4866 . 2 ran {⟨𝐴, 𝐵⟩} = {𝐵}
4 cnvsn.2 . . 3 𝐵 ∈ V
54unisn 4873 . 2 {𝐵} = 𝐵
63, 5eqtri 2754 1 ran {⟨𝐴, 𝐵⟩} = 𝐵
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wcel 2111  Vcvv 3436  {csn 4571  cop 4577   cuni 4854  ran crn 5612
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-opab 5149  df-xp 5617  df-rel 5618  df-cnv 5619  df-dm 5621  df-rn 5622
This theorem is referenced by:  elxp4  7847  elxp5  7848  op2nd  7925  fo2nd  7937  f2ndres  7941  ixpsnf1o  8857  xpassen  8979  xpdom2  8980
  Copyright terms: Public domain W3C validator