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

Theorem op2nda 6250
Description: Extract the second member of an ordered pair. (See op1sta 6247 to extract the first member, op2ndb 6249 for an alternate version, and op2nd 8022 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 6246 . . 3 ran {⟨𝐴, 𝐵⟩} = {𝐵}
32unieqi 4924 . 2 ran {⟨𝐴, 𝐵⟩} = {𝐵}
4 cnvsn.2 . . 3 𝐵 ∈ V
54unisn 4931 . 2 {𝐵} = 𝐵
63, 5eqtri 2763 1 ran {⟨𝐴, 𝐵⟩} = 𝐵
Colors of variables: wff setvar class
Syntax hints:   = wceq 1537  wcel 2106  Vcvv 3478  {csn 4631  cop 4637   cuni 4912  ran crn 5690
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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-xp 5695  df-rel 5696  df-cnv 5697  df-dm 5699  df-rn 5700
This theorem is referenced by:  elxp4  7945  elxp5  7946  op2nd  8022  fo2nd  8034  f2ndres  8038  ixpsnf1o  8977  xpassen  9105  xpdom2  9106
  Copyright terms: Public domain W3C validator