Let S(X,Y)={x+y−⌊x+y⌋:x∈X and y∈Y} and proceed by induction on ∣Y∣.
If ∣Y∣=1, the statement is clear.
Assume henceforth ∣Y∣>1 and let y0∈Y, y0=0. The conditions y0=0 and x+y0=1 for no x∈X imply that 0∈/S(X,y0). Since 0∈X, and X and S(X,y0) have the same cardinality, there are elements that lie in S(X,y0) but not in X; that is, x0+y0−⌊x0+y0⌋ for some x0∈X.
Let
Y0={y:y∈Y and x0+y−⌊x0+y⌋∈/X}
and
X0={x0+y−⌊x0+y⌋:y∈Y0}.
Clearly, 0∈/Y0, X0 and Y0 are both non-empty and have the same cardinality, so 0<∣X0∣=∣Y0∣<∣Y∣.
Let further X′=X∪X0 (notice that this is a disjoint union) and Y′=Y∖Y0, so X is a proper non-empty subset of X′, Y′ is a proper non-empty subset of Y, and
∣X′∣+∣Y′∣=∣X∣+∣X0∣+∣Y∣−∣Y0∣=∣X∣+∣Y∣.(∗)
Obviously, X′ and Y′ both contain 0 and we now show that S(X′,Y′)⊆S(X,Y) and x′+y′=1 for no x′∈X′ and no y′∈Y′.
Clearly, we need consider only the case x′∈X0; that is, x′=x0+y−⌊x0+y⌋ for some y∈Y0. Thus, if y′∈Y′, then
x′+y′−⌊x′+y′⌋=x0+y−⌊x0+y⌋+y′−⌊x0+y−⌊x0+y⌋+y′⌋=x0+y+y′−⌊x0+y+y′⌋=(x0+y′−⌊x0+y′⌋)+y−⌊(x0+y′−⌊x0+y′⌋)+y⌋.
Notice that x0+y′−⌊x0+y′⌋∈X, by the definition of Y′, to infer that x′+y′−⌊x′+y′⌋∈S(X,Y0)⊆S(X,Y), and thereby S(X′,Y′)⊆S(X,Y).
Finally, write
x′+y′=x0+y−⌊x0+y⌋+y′=(x0+y′−⌊x0+y′⌋)+y−⌊x0+y⌋+⌊x0+y′⌋,
recall that x0+y′−⌊x0+y′⌋∈X and consider the possible values of ⌊x0+y⌋ and ⌊x0+y′⌋ to conclude that x′+y′=1.
Consequently,
∣S(X,Y)∣≥∣S(X′,Y′)∣≥∣X′∣+∣Y′∣−1=∣X∣+∣Y∣−1.for S(X′,Y′)⊆S(X,Y)by the induction hypothesisby (∗)