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

Theorem xpcomf1o 6920
Description: The canonical bijection from  ( A  X.  B ) to  ( B  X.  A ). (Contributed by Mario Carneiro, 23-Apr-2014.)
Hypothesis
Ref Expression
xpcomf1o.1  |-  F  =  ( x  e.  ( A  X.  B ) 
|->  U. `' { x } )
Assertion
Ref Expression
xpcomf1o  |-  F :
( A  X.  B
)
-1-1-onto-> ( B  X.  A
)
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    F( x)

Proof of Theorem xpcomf1o
StepHypRef Expression
1 relxp 4784 . . . 4  |-  Rel  ( A  X.  B )
2 cnvf1o 6311 . . . 4  |-  ( Rel  ( A  X.  B
)  ->  ( x  e.  ( A  X.  B
)  |->  U. `' { x } ) : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B
) )
31, 2ax-mp 5 . . 3  |-  ( x  e.  ( A  X.  B )  |->  U. `' { x } ) : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B )
4 xpcomf1o.1 . . . 4  |-  F  =  ( x  e.  ( A  X.  B ) 
|->  U. `' { x } )
5 f1oeq1 5510 . . . 4  |-  ( F  =  ( x  e.  ( A  X.  B
)  |->  U. `' { x } )  ->  ( F : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B )  <->  ( x  e.  ( A  X.  B
)  |->  U. `' { x } ) : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B
) ) )
64, 5ax-mp 5 . . 3  |-  ( F : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B )  <->  ( x  e.  ( A  X.  B
)  |->  U. `' { x } ) : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B
) )
73, 6mpbir 146 . 2  |-  F :
( A  X.  B
)
-1-1-onto-> `' ( A  X.  B )
8 cnvxp 5101 . . 3  |-  `' ( A  X.  B )  =  ( B  X.  A )
9 f1oeq3 5512 . . 3  |-  ( `' ( A  X.  B
)  =  ( B  X.  A )  -> 
( F : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B
)  <->  F : ( A  X.  B ) -1-1-onto-> ( B  X.  A ) ) )
108, 9ax-mp 5 . 2  |-  ( F : ( A  X.  B ) -1-1-onto-> `' ( A  X.  B )  <->  F :
( A  X.  B
)
-1-1-onto-> ( B  X.  A
) )
117, 10mpbi 145 1  |-  F :
( A  X.  B
)
-1-1-onto-> ( B  X.  A
)
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1373   {csn 3633   U.cuni 3850    |-> cmpt 4105    X. cxp 4673   `'ccnv 4674   Rel wrel 4680   -1-1-onto->wf1o 5270
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-sbc 2999  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-1st 6226  df-2nd 6227
This theorem is referenced by:  xpcomco  6921  xpcomen  6922
  Copyright terms: Public domain W3C validator