how do you prove this equation with law of theory?
bring in demorgans laws a couple times
okay that was wrong sorry
you can pretend im not watching XD
\[\lnot [( A\cap \lnot B)\cup (\lnot B\cup C)]\] use demorgan to get \[\lnot(A \cap \lnot B)\cap \lnot(\lnot B\cup C)\]
then use it again for each piece
get \[(\lnot A\cap B)\cap (B \cup \lnot C)\]
you mean this ? ¬[(¬A∩B)∪(B∪¬C)∩(¬A∩C)]
then \[(\lnot A\cap B)\cap (B \cup \lnot C)\cup (A\cap \lnot C)\] is what i get
then rewrite the left two parentheses
iSee, but how do you get that step down to (B∩¬C)? thats where it confuses me
\(X\cap (Y\cup Z)=(X\cap Y)\cup (X\cap Z)\)
so get rid of the intersection between the first two parentheses, by writing it as a union of intersections
\[(\lnot A\cap B)\cap (B \cup \lnot C)\cup (A\cap \lnot C)\] \[(\lnot A\cap B\cap B)\cup (\lnot A\cap B \cap C)\cup (A\cap \lnot C)\]
damn a typo
\[(\lnot A\cap B\cap B)\cup (\lnot A\cap B \cap\lnot C)\cup (A\cap \lnot C)\]
now that everything is a union, you can remove the parentheses also of course \(B\cap B=B\)
do you mean i can remove all the parentheses and recombine every term?
you can reorder them
so when is this reordering thing valid ? can i just do it in the very first step ?
no because you have the \(\lnot\) if front of the first parentheses
now you have nothing but unions
\[(\lnot A\cap B\cap B)\cup (\lnot A\cap B \cap\lnot C)\cup (A\cap \lnot C)\] \[(\lnot A\cap B)\cup (\lnot A\cap B\cap \lnot C)\cup (A\cap \lnot C)\] \[(\lnot A\cap B\cap \lnot C)\cup (A\cap \lnot C)\]
can i see ∩ and ∪ as regular operator + and -?
not really
i can see how you get down to last step, it just doesnt quite make sense too me . sigh
then \[(\lnot A\cap B\cap \lnot C)\cup (A\cap \lnot C)\] \[(B\cap \lnot C)\] as \[(\lnot X\cap Y)\cup (X\cap Y)=Y\]
oh maybe i made a mistake i didn't write it out on paper first let me do that
i did make a mistake, there are several more steps
i think we can do this, but it is going to take a minute or two, especially to write it out it is a lot of changing stuff
lol, omg im feel bad for this. but thanks for doing this
ok first the original question \[\lnot [( A\cap \lnot B)\cup (\lnot B\cup C)]\cup (A\cap \lnot C)\]
we want to write everything as a union, so we can commute the last part we do not need to touch, because it is already \(\cup (A\cap \lnot C)\) so we leave it alone and concentrate on \[\lnot [( A\cap \lnot B)\cup (\lnot B\cup C)]\]
bring the \(\lnot \) inside the parentheses by turning the \(\cap\) into a \(\cup\)
damn another typo
\[\lnot [( A\cap \lnot B)\cup (\lnot B\cap C)]\]\[=[\lnot ( A\cap \lnot B)\cap (\lnot B\cap C)]\]
there i finally got it right
now bring the \(\lnot\) inside both parentheses
damn i cannot seem to write this correctly sorry
lol, its all right
\[\lnot [( A\cap \lnot B)\cup (\lnot B\cap C)]\]
there that is what we concentrate on i had it wrong okay
\[\lnot [( A\cap \lnot B)\cup (\lnot B\cap C)]\] \[=[\lnot ( A\cap \lnot B)\cap \lnot(\lnot B\cap C)]\]
now bring in the \(\lnot\) again
\[=[(\lnot A\cup B)\cap (B\cup \lnot C)]\]
now demorgan distributive law twice
\[((\lnot A\cup B)\cap B)\cup (\lnot (A\cup B)\cap \lnot C)\] for the first one
now distribute again
\[(\lnot A\cap B)\cup (B\cap B)\cup (\lnot A\cap \lnot C)\cup (B\cap\lnot C)\]
now we can bring back the \(\cup (A\cap \lnot C)\) and reorder
\[(B\cap B)=B\]
and \[(A\cap \lnot C)\cup (\lnot A\cap \lnot C)=\lnot C\]
and \((\lnot A\cap B)\subset B\)
and also \((B\cap \lnot C)\subset B\) and also \(\subset \lnot C\)
so you are left with \(B\cup \lnot C\)
sorry it took so long
nono, my you good . thanks soo much
yw
with a bagel
Join our real-time social learning platform and learn together with your friends!