Verifying Identity: Easier Way to Solve?

  • Thread starter Thread starter autre
  • Start date Start date
  • Tags Tags
    Identity
AI Thread Summary
The discussion focuses on verifying the identity involving symmetric differences and intersections in set theory. The original poster finds the brute force method cumbersome and seeks a simpler solution. A participant suggests using a Venn diagram, which effectively illustrates the sets involved. The use of Venn diagrams simplifies the problem by visually representing the relationships between the sets. Overall, visual aids like Venn diagrams can provide a clearer understanding of complex set identities.
autre
Messages
116
Reaction score
0
I need to verify this identity:

(A\B)\DeltaC = (A\DeltaC)\Delta(A\bigcapB)

(with delta standing for the symmetric difference, I don't know the proper latex code) I've tried it "brute force" several times, working out each side and simplifying it until the sides are equal (it's likely that I'm messing up a negation somewhere) and I've found this method rather cumbersome. Is there any simpler way to solve this?
 
Physics news on Phys.org
Hi autre! :smile:

Have you tried drawing a so called Venn diagram?
 
I used Venn diagrams and got the result you are looking for. There are 7 disjoint sets involved. Is that the brute force you tried?
 
That's it, mathman. Thanks guys.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top