Proving Power Set Inclusion When B is Included in C

AI Thread Summary
To prove that if set B is included in set C, then the power set of B is included in the power set of C, one can start with the definitions of power sets and subsets. The power set of C contains all subsets of C, which inherently includes all subsets of any subset of C, including B. Therefore, every subset of B, which constitutes the power set of B, is also a subset of C. This leads to the conclusion that the power set of B must be included in the power set of C. The argument is formal and aligns with set theory principles.
yxgao
Messages
122
Reaction score
0
How do you show that if B is included in C, then the power set of B is included in the power set of C?
 
Physics news on Phys.org
What have you tried already? I'd imagine just starting with the definitions would give a strong clue.
 
Power set of C includes all subsets of C, which means that it also includes all subsets of a subset (B). Thus it includes the power set of B.
Is this formal enough?
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
18
Views
2K
Replies
2
Views
2K
Replies
19
Views
4K
Replies
5
Views
1K
Replies
2
Views
2K
Replies
4
Views
6K
Replies
5
Views
2K
Replies
1
Views
1K
Back
Top