Theorem op2nda 6231

Description: Extract the second member of an ordered pair. (See op1sta 6228 to extract the first member, op2ndb 6230 for an alternate version, and op2nd 8001 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 6227	. . 3 ⊢ ran {⟨𝐴, 𝐵⟩} = {𝐵}
3	2	unieqi 4886	. 2 ⊢ ∪ ran {⟨𝐴, 𝐵⟩} = ∪ {𝐵}
4		cnvsn.2	. . 3 ⊢ 𝐵 ∈ V
5	4	unisn 4893	. 2 ⊢ ∪ {𝐵} = 𝐵
6	3, 5	eqtri 2788	1 ⊢ ∪ ran {⟨𝐴, 𝐵⟩} = 𝐵

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2146  Vcvv 3457  {csn 4591  ⟨cop 4597  ∪ cuni 4874  ran crn 5664

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671  df-dm 5673  df-rn 5674

This theorem is used by:  elxp4  7925  elxp5  7926  op2nd  8001  fo2nd  8013  f2ndres  8017  ixpsnf1o  8942  xpassen  9066  xpdom2  9067