Is it possible to prove that -(-A)=A using the concept of set subtraction?

  • Thread starter Thread starter Kamataat
  • Start date Start date
  • Tags Tags
    Set
AI Thread Summary
The discussion centers around proving that the complement of the complement of a set A, denoted as -(-A), is equal to A. Participants clarify that -A refers to the complement of A with respect to a universal set S. They explore the logical steps involved in the proof, emphasizing the equivalence of membership in the sets. Questions arise regarding the necessity of intermediate logical steps in the proof process. The conversation concludes with a light-hearted acknowledgment of differing approaches to the proof.
Kamataat
Messages
137
Reaction score
0
I need to prove that -(-A)=A. I guess it's the same as S-(S-A)=A, where S is the space. So is it true, that if x \in S-(S-A) then x \notin S-A?

- Kamataat
 
Physics news on Phys.org
I take it -A means the complement of A (with respect to some universe)? The following are equivalent (~ means "not"):

x \in -(-A)
x \notin -A
~(x \in -A)
~(x \notin A)
~(~(x \in A))
x \in A

That establishes the two inclusions -(-A) \subseteq A and A \subseteq -(-A).
 
Thanks, Muzza, I get your proof. Still, why are the NOT steps neccessary? Why not this instead:

x \in -(-A)
x \notin -A
x \in A?

If you go (in your post) from step #1 to step #2 directly, then why don't you go from #2 to #6 (e.g. skip #3, #4 and #5)? I mean, if from #1 follows #2, then doesn't #6 follow from #1 and #2 combined (w/o the intermediate steps)?

- Kamataat
 
*shrug* Do as you please :P
 
ok, tnx

- Kamataat
 
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