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

Theorem pw2f1odc 7101
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 2234 . . . 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 7100 . . . . 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 2818 . . . . 5  |-  y  e. 
_V
1312cnvex 5306 . . . 4  |-  `' y  e.  _V
1413imaex 5121 . . 3  |-  ( `' y " { C } )  e.  _V
1514a1i 9 . 2  |-  ( (
ph  /\  y  e.  ( { B ,  C }  ^m  A ) )  ->  ( `' y
" { C }
)  e.  _V )
163, 4, 5, 6, 7pw2f1odclem 7100 . 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 6266 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 842    = wceq 1398    e. wcel 2205    =/= wne 2414   A.wral 2522   _Vcvv 2815   ifcif 3624   ~Pcpw 3674   {csn 3694   {cpr 3695    |-> cmpt 4176   `'ccnv 4753   "cima 4757   -1-1-onto->wf1o 5356  (class class class)co 6058    ^m cmap 6895
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 619  ax-in2 620  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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-map 6897
This theorem is referenced by:  exmidpw2en  7185
  Copyright terms: Public domain W3C validator