Theorem op2ndb 6228

Description: Extract the second member of an ordered pair. Theorem 5.12(ii) of [Monk1] p. 52. (See op1stb 5439 to extract the first member, op2nda 6229 for an alternate version, and op2nd 8010 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 6227	. . . . . 6 ⊢ ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}
4	3	inteqi 4910	. . . . 5 ⊢ ∩ ◡{⟨𝐴, 𝐵⟩} = ∩ {⟨𝐵, 𝐴⟩}
5		opex 5431	. . . . . 6 ⊢ ⟨𝐵, 𝐴⟩ ∈ V
6	5	intsn 4943	. . . . 5 ⊢ ∩ {⟨𝐵, 𝐴⟩} = ⟨𝐵, 𝐴⟩
7	4, 6	eqtri 2783	. . . 4 ⊢ ∩ ◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩
8	7	inteqi 4910	. . 3 ⊢ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = ∩ ⟨𝐵, 𝐴⟩
9	8	inteqi 4910	. 2 ⊢ ∩ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = ∩ ∩ ⟨𝐵, 𝐴⟩
10	2, 1	op1stb 5439	. 2 ⊢ ∩ ∩ ⟨𝐵, 𝐴⟩ = 𝐵
11	9, 10	eqtri 2783	1 ⊢ ∩ ∩ ∩ ◡{⟨𝐴, 𝐵⟩} = 𝐵

This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  Vcvv 3450  {csn 4584  ⟨cop 4834  ∩ cint 4906  ^◡ccnv 5649

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-int 4907  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658

This theorem is used by:  2ndval2  8019