ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  2nd1st Unicode version

Theorem 2nd1st 6335
Description: Swap the members of an ordered pair. (Contributed by NM, 31-Dec-2014.)
Assertion
Ref Expression
2nd1st  |-  ( A  e.  ( B  X.  C )  ->  U. `' { A }  =  <. ( 2nd `  A ) ,  ( 1st `  A
) >. )

Proof of Theorem 2nd1st
StepHypRef Expression
1 1st2nd2 6330 . . . . 5  |-  ( A  e.  ( B  X.  C )  ->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
21sneqd 3679 . . . 4  |-  ( A  e.  ( B  X.  C )  ->  { A }  =  { <. ( 1st `  A ) ,  ( 2nd `  A
) >. } )
32cnveqd 4901 . . 3  |-  ( A  e.  ( B  X.  C )  ->  `' { A }  =  `' { <. ( 1st `  A
) ,  ( 2nd `  A ) >. } )
43unieqd 3899 . 2  |-  ( A  e.  ( B  X.  C )  ->  U. `' { A }  =  U. `' { <. ( 1st `  A
) ,  ( 2nd `  A ) >. } )
5 1stexg 6322 . . 3  |-  ( A  e.  ( B  X.  C )  ->  ( 1st `  A )  e. 
_V )
6 2ndexg 6323 . . 3  |-  ( A  e.  ( B  X.  C )  ->  ( 2nd `  A )  e. 
_V )
7 opswapg 5218 . . 3  |-  ( ( ( 1st `  A
)  e.  _V  /\  ( 2nd `  A )  e.  _V )  ->  U. `' { <. ( 1st `  A
) ,  ( 2nd `  A ) >. }  =  <. ( 2nd `  A
) ,  ( 1st `  A ) >. )
85, 6, 7syl2anc 411 . 2  |-  ( A  e.  ( B  X.  C )  ->  U. `' { <. ( 1st `  A
) ,  ( 2nd `  A ) >. }  =  <. ( 2nd `  A
) ,  ( 1st `  A ) >. )
94, 8eqtrd 2262 1  |-  ( A  e.  ( B  X.  C )  ->  U. `' { A }  =  <. ( 2nd `  A ) ,  ( 1st `  A
) >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200   _Vcvv 2799   {csn 3666   <.cop 3669   U.cuni 3888    X. cxp 4718   `'ccnv 4719   ` cfv 5321   1stc1st 6293   2ndc2nd 6294
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4259  ax-pr 4294  ax-un 4525
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-fo 5327  df-fv 5329  df-1st 6295  df-2nd 6296
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator