#(A △B)∩C = (A ∩C)△(B ∩C) proof
30 messages · Page 1 of 1 (latest)
$(A \Delta B)={x:((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B))}$
FirstNameLastName
$A \cap B = {x : (x \in A ∧ x \in B)}$
FirstNameLastName
$(A \Delta B) \cap C = {x:(((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B)) ∧ x \in C)}$
FirstNameLastName
$(A \cap C) \Delta (B \cap C) = {x : (((x \in A ∧ x \in C) ∧ ¬(x \in B ∧ x \in C)) ∨ (¬(x \in A ∧ x \in C) ∧ (x \in B ∧ x \in C)))}$
FirstNameLastName
De Morgan’s Law: $(A \cap C) \Delta (B \cap C) = {x : (((x \in A ∧ x \in C) ∧ (x \notin B ∨ x \notin C)) ∨ ((x \notin A ∨ x \notin C) ∧ (x \in B ∧ x \in C)))}$
FirstNameLastName
The conjunctions show us that $x \in C$
FirstNameLastName
$(A \cap C) \Delta (B \cap C) = {x : (((x \in A ∧ x \in C) ∧ (x \notin B ∧ x \in C)) ∨ ((x \notin A ∧ x \in C) ∧ (x \in B ∧ x \in C)))}$
FirstNameLastName
Now we just factor out the $x \in C$ and get: $(A \cap C) \Delta (B \cap C) = {x:(((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B)) ∧ x \in C)}$
FirstNameLastName
Rules of inference (not including the most obvious ones):
De Morgan’s Law
((¬P ∨ ¬R) ∧ (Q ∧ R)) ⇔ ((¬P ∧ R) ∧ (Q ∧ R))
((P ∧ R) ∨ (Q ∧ R)) ⇔ ((P ∨ Q) ∧ R)
@idle totem have fun
Definitions:
$A \Delta B={x:((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B))}$
$A \cap B = {x : (x \in A ∧ x \in B)}$
Proof:
(1) $(A \Delta B) \cap C = {x:(((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B)) ∧ x \in C)}$
(2) $(A \cap C) \Delta (B \cap C) = {x : (((x \in A ∧ x \in C) ∧ ¬(x \in B ∧ x \in C)) ∨ (¬(x \in A ∧ x \in C) ∧ (x \in B ∧ x \in C)))}$
(3) $(A \cap C) \Delta (B \cap C) = {x : (((x \in A ∧ x \in C) ∧ (x \notin B ∨ x \notin C)) ∨ ((x \notin A ∨ x \notin C) ∧ (x \in B ∧ x \in C)))}$
(4) $(A \cap C) \Delta (B \cap C) = {x : (((x \in A ∧ x \in C) ∧ (x \notin B ∧ x \in C)) ∨ ((x \notin A ∧ x \in C) ∧ (x \in B ∧ x \in C)))}$
(5) $(A \cap C) \Delta (B \cap C) = {x:(((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B)) ∧ x \in C)}$
Rules of inference (not including the most obvious ones):
(2) ⇒ (3): De Morgan’s Law
(3) ⇒ (4): ((¬P ∨ ¬R) ∧ (Q ∧ R)) ⇔ ((¬P ∧ R) ∧ (Q ∧ R))
(4) ⇒ (5): ((P ∧ R) ∨ (Q ∧ R)) ⇔ ((P ∨ Q) ∧ R)
Each of those inference rules are easy to prove using truth tables
I hope formal logic is allowed in your assignment @idle totem
FirstNameLastName
@idle totem if you have any questions feel free to ask
Thank you so much 😮
I was motivated enough to invest time into formatting this so I might as well send it in here
I would expand on it a bit if I needed to send this in, but I think most of the implied steps here are obvious enough as to not necessitate being explicitly stated in a less formal setting
Prove that
[(A \Delta B) \cap C = (A \cap C) \Delta (B \cap C)]
\
Definitions:
[A \Delta B={x:((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B))}]
[A \cap B = {x : (x \in A ∧ x \in B)}]
\
Proof:
(1) $(A \Delta B) \cap C = \ {x:(((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B)) ∧ x \in C)}$
\
(2) $(A \cap C) \Delta (B \cap C) = \ {x : (((x \in A ∧ x \in C) ∧ ¬(x \in B ∧ x \in C)) \ ∨ (¬(x \in A ∧ x \in C) ∧ (x \in B ∧ x \in C)))}$
\
(3) $(A \cap C) \Delta (B \cap C) = \ {x : (((x \in A ∧ x \in C) ∧ (x \notin B ∨ x \notin C)) \ ∨ ((x \notin A ∨ x \notin C) ∧ (x \in B ∧ x \in C)))}$
\
(4) $(A \cap C) \Delta (B \cap C) = \ {x : (((x \in A ∧ x \in C) ∧ (x \notin B ∧ x \in C)) \ ∨ ((x \notin A ∧ x \in C) ∧ (x \in B ∧ x \in C)))}$
\
(5) $(A \cap C) \Delta (B \cap C) = \ {x:(((x \in A ∧ x \notin B) ∨ (x \notin A ∧ x \in B)) ∧ x \in C)}$
\
From (1) and (5), we can see that $(A \Delta B) \cap C = (A \cap C) \Delta (B \cap C)$
\
\
Rules of inference:
(2) ⇒ (3): De Morgan’s Law
(3) ⇒ (4): ((¬P ∨ ¬R) ∧ (Q ∧ R)) ⇔ ((¬P ∧ R) ∧ (Q ∧ R))
(4) ⇒ (5): ((P ∧ R) ∨ (Q ∧ R)) ⇔ ((P ∨ Q) ∧ R)\
In case you want to use my text as a draft