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

Theorem op2nda 6183
Description: Extract the second member of an ordered pair. (See op1sta 6180 to extract the first member, op2ndb 6182 for an alternate version, and op2nd 7939 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 6179 . . 3 ran {⟨𝐴, 𝐵⟩} = {𝐵}
32unieqi 4872 . 2 ran {⟨𝐴, 𝐵⟩} = {𝐵}
4 cnvsn.2 . . 3 𝐵 ∈ V
54unisn 4879 . 2 {𝐵} = 𝐵
63, 5eqtri 2756 1 ran {⟨𝐴, 𝐵⟩} = 𝐵
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wcel 2113  Vcvv 3437  {csn 4577  cop 4583   cuni 4860  ran crn 5622
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 2115  ax-9 2123  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
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 2712  df-cleq 2725  df-clel 2808  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-xp 5627  df-rel 5628  df-cnv 5629  df-dm 5631  df-rn 5632
This theorem is referenced by:  elxp4  7861  elxp5  7862  op2nd  7939  fo2nd  7951  f2ndres  7955  ixpsnf1o  8872  xpassen  8995  xpdom2  8996
  Copyright terms: Public domain W3C validator