ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-pw GIF version

Definition df-pw 3658
Description: Define power class. Definition 5.10 of [TakeutiZaring] p. 17, but we also let it apply to proper classes, i.e. those that are not members of V. When applied to a set, this produces its power set. A power set of S is the set of all subsets of S, including the empty set and S itself. For example, if 𝐴 is { 3 , 5 , 7 }, then 𝒫 𝐴 is { (/) , { 3 } , { 5 } , { 7 } , { 3 , 5 } , { 3 , 7 } , { 5 , 7 } , { 3 , 5 , 7 } }. We will later introduce the Axiom of Power Sets. Still later we will prove that the size of the power set of a finite set is 2 raised to the power of the size of the set. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
df-pw 𝒫 𝐴 = {𝑥𝑥𝐴}
Distinct variable group:   𝑥,𝐴

Detailed syntax breakdown of Definition df-pw
StepHypRef Expression
1 cA . . 3 class 𝐴
21cpw 3656 . 2 class 𝒫 𝐴
3 vx . . . . 5 setvar 𝑥
43cv 1397 . . . 4 class 𝑥
54, 1wss 3201 . . 3 wff 𝑥𝐴
65, 3cab 2217 . 2 class {𝑥𝑥𝐴}
72, 6wceq 1398 1 wff 𝒫 𝐴 = {𝑥𝑥𝐴}
Colors of variables: wff set class
This definition is referenced by:  pweq  3659  elpw  3662  nfpw  3669  pwss  3672  pw0  3825  snsspw  3852  pwsnss  3892  vpwex  4275  abssexg  4278  iunpw  4583  iotass  5311  mapex  6866  ssenen  7080  tgvalex  13426  bdcpw  16585
  Copyright terms: Public domain W3C validator