Can You Prove a power set problem?

preview_player
Показать описание
We show that the difference of A and B is an element of the power set of A using a formal proof. This would be covered in set theory in discrete mathematics.

#SetTheory #DiscreteMath #SetProof

Join this channel to get access to perks:

Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible.
Рекомендации по теме
Комментарии
Автор

I really needed more Discrete math! I'm out of university, but I need to refresh on this to get back into algorithms/data structures.

Also, thank you for fixing the audio! It sounds perfect now!

Loki-
Автор

A−B⇔(x ∈ A)∧(x ∉ B)
⇔x ∈ A
∴ (A−B) ⊆ A
And powersets are the family of subsets in A
∴ (A−B) ∈ P(A)
That's how I did it 🤔 I don't know if I made any technical mistakes or jumped to conclusions that needed more proof

yamatanoorochi
Автор

Okay correct me if I am wrong but I think this is another way to solve this problem using the rules of power sets. Could you just prove that (A-B) is a subset of (A), then you could use the rules to turn (A-B) is subset of (A) into (A-B) is element of Superset(A)?

minh
Автор

Isn't the power set by definition "the set that contains all subsets of a given set" therefore A-(literally anything) will always be a subset of P(A). Am I missing something? Can I use the definition as the proof?

Michelle-epgg
Автор

Sorry, but P(A-B)cP(A) cannot be proved verbally only. And this is why I don't get along with the set theory, since it doesn't supply us with the formal proofs. Despite the fact, I understand P(A-B)cP(A) without formal proof.

philosophyversuslogic