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

Theorem pw2f1odc 6891
Description: The power set of a set is equinumerous to set exponentiation with an unordered pair base of ordinal 2. Generalized from Proposition 10.44 of [TakeutiZaring] p. 96. (Contributed by Mario Carneiro, 6-Oct-2014.)
Hypotheses
Ref Expression
pw2f1o.1  |-  ( ph  ->  A  e.  V )
pw2f1o.2  |-  ( ph  ->  B  e.  W )
pw2f1o.3  |-  ( ph  ->  C  e.  W )
pw2f1o.4  |-  ( ph  ->  B  =/=  C )
pw2f1odc.4  |-  ( ph  ->  A. p  e.  A  A. q  e.  ~P  ADECID  p  e.  q )
pw2f1o.5  |-  F  =  ( x  e.  ~P A  |->  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) )
Assertion
Ref Expression
pw2f1odc  |-  ( ph  ->  F : ~P A -1-1-onto-> ( { B ,  C }  ^m  A ) )
Distinct variable groups:    A, p, q, x    z, A, x   
x, B, z    x, C, z    ph, x
Allowed substitution hints:    ph( z, q, p)    B( q, p)    C( q, p)    F( x, z, q, p)    V( x, z, q, p)    W( x, z, q, p)

Proof of Theorem pw2f1odc
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 pw2f1o.5 . 2  |-  F  =  ( x  e.  ~P A  |->  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) )
2 eqid 2193 . . . 4  |-  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  =  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )
3 pw2f1o.1 . . . . . 6  |-  ( ph  ->  A  e.  V )
4 pw2f1o.2 . . . . . 6  |-  ( ph  ->  B  e.  W )
5 pw2f1o.3 . . . . . 6  |-  ( ph  ->  C  e.  W )
6 pw2f1o.4 . . . . . 6  |-  ( ph  ->  B  =/=  C )
7 pw2f1odc.4 . . . . . 6  |-  ( ph  ->  A. p  e.  A  A. q  e.  ~P  ADECID  p  e.  q )
83, 4, 5, 6, 7pw2f1odclem 6890 . . . . 5  |-  ( ph  ->  ( ( x  e. 
~P A  /\  (
z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  =  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) )  <->  ( (
z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  e.  ( { B ,  C }  ^m  A )  /\  x  =  ( `' ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) " { C } ) ) ) )
98biimpa 296 . . . 4  |-  ( (
ph  /\  ( x  e.  ~P A  /\  (
z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  =  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) ) )  -> 
( ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  e.  ( { B ,  C }  ^m  A )  /\  x  =  ( `' ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) " { C } ) ) )
102, 9mpanr2 438 . . 3  |-  ( (
ph  /\  x  e.  ~P A )  ->  (
( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  e.  ( { B ,  C }  ^m  A )  /\  x  =  ( `' ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) " { C } ) ) )
1110simpld 112 . 2  |-  ( (
ph  /\  x  e.  ~P A )  ->  (
z  e.  A  |->  if ( z  e.  x ,  C ,  B ) )  e.  ( { B ,  C }  ^m  A ) )
12 vex 2763 . . . . 5  |-  y  e. 
_V
1312cnvex 5204 . . . 4  |-  `' y  e.  _V
1413imaex 5020 . . 3  |-  ( `' y " { C } )  e.  _V
1514a1i 9 . 2  |-  ( (
ph  /\  y  e.  ( { B ,  C }  ^m  A ) )  ->  ( `' y
" { C }
)  e.  _V )
163, 4, 5, 6, 7pw2f1odclem 6890 . 2  |-  ( ph  ->  ( ( x  e. 
~P A  /\  y  =  ( z  e.  A  |->  if ( z  e.  x ,  C ,  B ) ) )  <-> 
( y  e.  ( { B ,  C }  ^m  A )  /\  x  =  ( `' y " { C }
) ) ) )
171, 11, 15, 16f1od 6121 1  |-  ( ph  ->  F : ~P A -1-1-onto-> ( { B ,  C }  ^m  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104  DECID wdc 835    = wceq 1364    e. wcel 2164    =/= wne 2364   A.wral 2472   _Vcvv 2760   ifcif 3557   ~Pcpw 3601   {csn 3618   {cpr 3619    |-> cmpt 4090   `'ccnv 4658   "cima 4662   -1-1-onto->wf1o 5253  (class class class)co 5918    ^m cmap 6702
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-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-map 6704
This theorem is referenced by:  exmidpw2en  6968
  Copyright terms: Public domain W3C validator