Theorem op2nda 6248

Description: Extract the second member of an ordered pair. (See op1sta 6245 to extract the first member, op2ndb 6247 for an alternate version, and op2nd 8044 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

Step	Hyp	Ref	Expression
1		cnvsn.1	. . . 4 ⊢ 𝐴 ∈ V
2	1	rnsnop 6244	. . 3 ⊢ ran {⟨𝐴, 𝐵⟩} = {𝐵}
3	2	unieqi 4884	. 2 ⊢ ∪ ran {⟨𝐴, 𝐵⟩} = ∪ {𝐵}
4		cnvsn.2	. . 3 ⊢ 𝐵 ∈ V
5	4	unisn 4891	. 2 ⊢ ∪ {𝐵} = 𝐵
6	3, 5	eqtri 2786	1 ⊢ ∪ ran {⟨𝐴, 𝐵⟩} = 𝐵

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588  ⟨cop 4840  ∪ cuni 4872  ran crn 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669

This theorem is used by:  elxp4  7968  elxp5  7969  op2nd  8044  fo2nd  8056  f2ndres  8060  ixpsnf1o  9004  xpassen  9128  xpdom2  9129