Theorem op2ndb 5246

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

Hypotheses

Ref	Expression
cnvsn.1	|- A e. _V
cnvsn.2	|- B e. _V

Assertion

Ref	Expression
op2ndb	|- |^| |^| |^| `' { <. A , B >. } = B

Proof of Theorem op2ndb

Step	Hyp	Ref	Expression
1		cnvsn.1	. . . . . . 7 |- A e. _V
2		cnvsn.2	. . . . . . 7 |- B e. _V
3	1, 2	cnvsn 5245	. . . . . 6 |- `' { <. A , B >. } = { <. B , A >. }
4	3	inteqi 3953	. . . . 5 |- |^| `' { <. A , B >. } = |^| { <. B , A >. }
5	2, 1	opex 4345	. . . . . 6 |- <. B , A >. e. _V
6	5	intsn 3984	. . . . 5 |- |^| { <. B , A >. } = <. B , A >.
7	4, 6	eqtri 2253	. . . 4 |- |^| `' { <. A , B >. } = <. B , A >.
8	7	inteqi 3953	. . 3 |- |^| |^| `' { <. A , B >. } = |^| <. B , A >.
9	8	inteqi 3953	. 2 |- |^| |^| |^| `' { <. A , B >. } = |^| |^| <. B , A >.
10	2, 1	op1stb 4599	. 2 |- |^| |^| <. B , A >. = B
11	9, 10	eqtri 2253	1 |- |^| |^| |^| `' { <. A , B >. } = B

Syntax hints:   = wceq 1398   e. wcel 2203   _Vcvv 2813   {csn 3689   <.cop 3692   |^|cint 3949   `'ccnv 4748

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-int 3950  df-br 4110  df-opab 4172  df-xp 4755  df-rel 4756  df-cnv 4757

This theorem is referenced by:  2ndval2  6350