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

Theorem pw2f1odc 7021
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 2231 . . . 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 7020 . . . . 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 2805 . . . . 5  |-  y  e. 
_V
1312cnvex 5275 . . . 4  |-  `' y  e.  _V
1413imaex 5091 . . 3  |-  ( `' y " { C } )  e.  _V
1514a1i 9 . 2  |-  ( (
ph  /\  y  e.  ( { B ,  C }  ^m  A ) )  ->  ( `' y
" { C }
)  e.  _V )
163, 4, 5, 6, 7pw2f1odclem 7020 . 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 6226 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 841    = wceq 1397    e. wcel 2202    =/= wne 2402   A.wral 2510   _Vcvv 2802   ifcif 3605   ~Pcpw 3652   {csn 3669   {cpr 3670    |-> cmpt 4150   `'ccnv 4724   "cima 4728   -1-1-onto->wf1o 5325  (class class class)co 6018    ^m cmap 6817
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 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  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-3an 1006  df-tru 1400  df-fal 1403  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-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-if 3606  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-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-map 6819
This theorem is referenced by:  exmidpw2en  7104
  Copyright terms: Public domain W3C validator