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

Theorem xpcomf1o 7052
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 4841 . . . 4  |-  Rel  ( A  X.  B )
2 cnvf1o 6399 . . . 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 5580 . . . 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 5162 . . 3  |-  `' ( A  X.  B )  =  ( B  X.  A )
9 f1oeq3 5582 . . 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 1398   {csn 3673   U.cuni 3898    |-> cmpt 4155    X. cxp 4729   `'ccnv 4730   Rel wrel 4736   -1-1-onto->wf1o 5332
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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-2nd 6313
This theorem is referenced by:  xpcomco  7053  xpcomen  7054
  Copyright terms: Public domain W3C validator