This is no homework for me. I am working as a teaching assistant in a lecture about logic and discrete structures for Informatics students. This should be a piece of cake, but I am not exactly sure of the logic behind. 1. The problem statement, all variables and given/known data Translate into words ∃c . ∀a ∈ A . ∀b ∈ B . ¬(a = b) ∨ c = b 3. The attempt at a solution So obviously this means that there is a c such that for all a element of A and all b element of B either a is different than b or c is b or both. The problem is that they also said that this means that the intersection of A and B has maximally one Element, 1 ≥ |A ∩ B|. My questions is how exactly can one conclude the last part. ∃c means that there is at least one, not necessarily only one. Obviously for the statement to be true whenever a equals b c has to equal b and thus a, so either ¬(a = b) or a = b = c. But if there can be two cs this statement can be true for two different bs and as and so the intersection needs not be maximally 1... Could you help me out? PS: I am not sure if this has to be here... I can move it to another sub-forum if necessary.