Are De Morgan's laws for sets necessary in this proof?

  • Level: Undergrad 
  • Thread starter plum356
  • Start date
  • Tags Tags
    Laws Sets
3 replies · 2K views · last reply
plum356
Messages
10
Reaction score
6
Good evening!
Have a look at the following part of a proof:
Printed proof of De Morgan's law for complements of sets, showing a chain of implications from x in C_M(A union B) to x in (C_M A intersect C_M B), with the intermediate steps x not in A union B and x not in A and x not in B.

Mentor note: Fixed the LaTeX
I don't understand the use of implications. Isn't ##x\in C_M(A\cup B)\iff x\notin(A\cup B)##? To me, all of these predicates are equivalent.
 
Last edited by a moderator:
plum356 said:
Good evening!
Have a look at the following part of a proof:
View attachment 293569
I don't understand the use of implications. Isn't $x\in C_M(A\cup B)\iff x\notin(A\cup B)$? To me, all of these predicates are equivalent.
Yes, these are all two-way implications.

For Latex you need double dollars or double hashes:$$x\in C_M(A\cup B)\iff x\notin(A\cup B)$$
Mentor note: Fixed the original post.
 
Last edited by a moderator:
PeroK said:
Yes, these are all two-way implications.

For Latex you need double dollars or double hashes:$$x\in C_M(A\cup B)\iff x\notin(A\cup B)$$
##\text{Aha!}##
Thank you. :)