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

Definition df-pw 3654
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 3652 . 2 class 𝒫 𝐴
3 vx . . . . 5 setvar 𝑥
43cv 1396 . . . 4 class 𝑥
54, 1wss 3200 . . 3 wff 𝑥𝐴
65, 3cab 2217 . 2 class {𝑥𝑥𝐴}
72, 6wceq 1397 1 wff 𝒫 𝐴 = {𝑥𝑥𝐴}
Colors of variables: wff set class
This definition is referenced by:  pweq  3655  elpw  3658  nfpw  3665  pwss  3668  pw0  3820  snsspw  3847  pwsnss  3887  vpwex  4269  abssexg  4272  iunpw  4577  iotass  5304  mapex  6822  ssenen  7036  tgvalex  13345  bdcpw  16464
  Copyright terms: Public domain W3C validator