Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > df-pw | Unicode version |
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 . 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.) |
Ref | Expression |
---|---|
df-pw |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cA | . . 3 | |
2 | 1 | cpw 3558 | . 2 |
3 | vx | . . . . 5 | |
4 | 3 | cv 1342 | . . . 4 |
5 | 4, 1 | wss 3115 | . . 3 |
6 | 5, 3 | cab 2151 | . 2 |
7 | 2, 6 | wceq 1343 | 1 |
Colors of variables: wff set class |
This definition is referenced by: pweq 3561 elpw 3564 nfpw 3571 pwss 3574 pw0 3719 snsspw 3743 pwsnss 3782 vpwex 4157 abssexg 4160 iunpw 4457 iotass 5169 mapex 6616 ssenen 6813 tgvalex 12650 bdcpw 13711 |
Copyright terms: Public domain | W3C validator |