Theorem op2ndb 6233

Description: Extract the second member of an ordered pair. Theorem 5.12(ii) of [Monk1] p. 52. (See op1stb 5458 to extract the first member, op2nda 6234 for an alternate version, and op2nd 8004 for the preferred version.) (Contributed by NM, 25-Nov-2003.)

Hypotheses

Ref	Expression
cnvsn.1	⊢ 𝐴 ∈ V
cnvsn.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
op2ndb	⊢ ∩ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = 𝐵

Proof of Theorem op2ndb

Step	Hyp	Ref	Expression
1		cnvsn.1	. . . . . . 7 ⊢ 𝐴 ∈ V
2		cnvsn.2	. . . . . . 7 ⊢ 𝐵 ∈ V
3	1, 2	cnvsn 6232	. . . . . 6 ⊢ ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
4	3	inteqi 4921	. . . . 5 ⊢ ∩ ◡{⟨𝐴, 𝐵⟩} = ∩ {⟨𝐵, 𝐴⟩}
5		opex 5450	. . . . . 6 ⊢ ⟨𝐵, 𝐴⟩ ∈ V
6	5	intsn 4954	. . . . 5 ⊢ ∩ {⟨𝐵, 𝐴⟩} = ⟨𝐵, 𝐴⟩
7	4, 6	eqtri 2789	. . . 4 ⊢ ∩ ◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩
8	7	inteqi 4921	. . 3 ⊢ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = ∩ ⟨𝐵, 𝐴⟩
9	8	inteqi 4921	. 2 ⊢ ∩ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = ∩ ∩ ⟨𝐵, 𝐴⟩
10	2, 1	op1stb 5458	. 2 ⊢ ∩ ∩ ⟨𝐵, 𝐴⟩ = 𝐵
11	9, 10	eqtri 2789	1 ⊢ ∩ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = 𝐵

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2146  Vcvv 3458  {csn 4594  ⟨cop 4600  ∩ cint 4917  ^◡ccnv 5665

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 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-int 4918  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674

This theorem is used by:  2ndval2  8013