Show that $(AcapbarB) cup (barAcap barC) = (AcapbarB) cup (barAcap barC) cup (barB cap barC)$ by rewriting

Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
$A,B,C$ are subsets of the universal set $U$.
$barA$ is the absolute complement of $A$ = $Usetminus A$
Show that $(AcapbarB) cup (barAcap barC) = (AcapbarB) cup (barAcap barC) cup (barB cap barC)$ by rewriting either the left hand side or the right hand side.
I have been able to prove the similarity by showing that $barBcap barC subseteq (AcapbarB) cup (barAcap barC)$, but I want to show it by only rewriting either the RHS or the LHS by using rules like DeMorgan's laws, Absorption laws etc.
The problem I'm having is that in the RHS $barBcap barC$ is redundant; I already have the two sets that I want and if I try to "get rid of" $barBcap barC$ by taking the union of it and some of the other sets, like $(barBcap barC) cup (barAcap barC)$ then I don't have $(barAcap barC)$ on the RHS anymore. But I feel like it must be possible to always rewrite expressions of sets to all equivalent expressions by only using similarity laws like DeMorgan's laws. Maybe I'm wrong.
elementary-set-theory
add a comment |Â
up vote
0
down vote
favorite
$A,B,C$ are subsets of the universal set $U$.
$barA$ is the absolute complement of $A$ = $Usetminus A$
Show that $(AcapbarB) cup (barAcap barC) = (AcapbarB) cup (barAcap barC) cup (barB cap barC)$ by rewriting either the left hand side or the right hand side.
I have been able to prove the similarity by showing that $barBcap barC subseteq (AcapbarB) cup (barAcap barC)$, but I want to show it by only rewriting either the RHS or the LHS by using rules like DeMorgan's laws, Absorption laws etc.
The problem I'm having is that in the RHS $barBcap barC$ is redundant; I already have the two sets that I want and if I try to "get rid of" $barBcap barC$ by taking the union of it and some of the other sets, like $(barBcap barC) cup (barAcap barC)$ then I don't have $(barAcap barC)$ on the RHS anymore. But I feel like it must be possible to always rewrite expressions of sets to all equivalent expressions by only using similarity laws like DeMorgan's laws. Maybe I'm wrong.
elementary-set-theory
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
$A,B,C$ are subsets of the universal set $U$.
$barA$ is the absolute complement of $A$ = $Usetminus A$
Show that $(AcapbarB) cup (barAcap barC) = (AcapbarB) cup (barAcap barC) cup (barB cap barC)$ by rewriting either the left hand side or the right hand side.
I have been able to prove the similarity by showing that $barBcap barC subseteq (AcapbarB) cup (barAcap barC)$, but I want to show it by only rewriting either the RHS or the LHS by using rules like DeMorgan's laws, Absorption laws etc.
The problem I'm having is that in the RHS $barBcap barC$ is redundant; I already have the two sets that I want and if I try to "get rid of" $barBcap barC$ by taking the union of it and some of the other sets, like $(barBcap barC) cup (barAcap barC)$ then I don't have $(barAcap barC)$ on the RHS anymore. But I feel like it must be possible to always rewrite expressions of sets to all equivalent expressions by only using similarity laws like DeMorgan's laws. Maybe I'm wrong.
elementary-set-theory
$A,B,C$ are subsets of the universal set $U$.
$barA$ is the absolute complement of $A$ = $Usetminus A$
Show that $(AcapbarB) cup (barAcap barC) = (AcapbarB) cup (barAcap barC) cup (barB cap barC)$ by rewriting either the left hand side or the right hand side.
I have been able to prove the similarity by showing that $barBcap barC subseteq (AcapbarB) cup (barAcap barC)$, but I want to show it by only rewriting either the RHS or the LHS by using rules like DeMorgan's laws, Absorption laws etc.
The problem I'm having is that in the RHS $barBcap barC$ is redundant; I already have the two sets that I want and if I try to "get rid of" $barBcap barC$ by taking the union of it and some of the other sets, like $(barBcap barC) cup (barAcap barC)$ then I don't have $(barAcap barC)$ on the RHS anymore. But I feel like it must be possible to always rewrite expressions of sets to all equivalent expressions by only using similarity laws like DeMorgan's laws. Maybe I'm wrong.
elementary-set-theory
asked Aug 26 at 6:44
DancingIceCream
385
385
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2894772%2fshow-that-a-cap-barb-cup-bara-cap-barc-a-cap-barb-cup-bar%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password