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

Theorem 2nd1st 6342
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 6337 . . . . 5  |-  ( A  e.  ( B  X.  C )  ->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
21sneqd 3682 . . . 4  |-  ( A  e.  ( B  X.  C )  ->  { A }  =  { <. ( 1st `  A ) ,  ( 2nd `  A
) >. } )
32cnveqd 4906 . . 3  |-  ( A  e.  ( B  X.  C )  ->  `' { A }  =  `' { <. ( 1st `  A
) ,  ( 2nd `  A ) >. } )
43unieqd 3904 . 2  |-  ( A  e.  ( B  X.  C )  ->  U. `' { A }  =  U. `' { <. ( 1st `  A
) ,  ( 2nd `  A ) >. } )
5 1stexg 6329 . . 3  |-  ( A  e.  ( B  X.  C )  ->  ( 1st `  A )  e. 
_V )
6 2ndexg 6330 . . 3  |-  ( A  e.  ( B  X.  C )  ->  ( 2nd `  A )  e. 
_V )
7 opswapg 5223 . . 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 2264 1  |-  ( A  e.  ( B  X.  C )  ->  U. `' { A }  =  <. ( 2nd `  A ) ,  ( 1st `  A
) >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   _Vcvv 2802   {csn 3669   <.cop 3672   U.cuni 3893    X. cxp 4723   `'ccnv 4724   ` cfv 5326   1stc1st 6300   2ndc2nd 6301
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332  df-fv 5334  df-1st 6302  df-2nd 6303
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator