Recent content by Tokenfreak

So would it be safe to assume that an equivalence relation ~ on a set s is a relation satisfying a,b in s. If [a] != [b], then there must be an element in a that's not in b or vice versa. Therefore, this contradicts that [a] = [b].Is this close? I am pretty much clueless on this proof.

I am trying to prove this as I am practicing for a test but I am pretty much clueless on this problem: Prove that if ~ is an equivalence relation on a set s and [a] denotes the equivalence class of a in s under ~, then a ~ b if and only if [a] = [b]. If anyone can give me some points on...

Homework Statement I am suppose to use Boolean algebra to show that the following expressions are true. Homework Equations w'z' + w'xy + wx'z + wxyz = w'z' + xyz + wx'y'z + wyz The Attempt at a Solution I have tried to figure out how to get to that answer above but I am stuck...