We have to find the negation (logical NOT) of the Boolean statement x↔∼y and then express the result in a simplified disjunctive form so that it can be matched with one of the given options.
First of all, let us recall the standard equivalence for a biconditional. The formula for any two propositions p and q is:
p↔q=(p∧q)∨(∼p∧∼q).
Now we apply this rule to the concrete biconditional x↔∼y by replacing p with x and q with ∼y. Doing so gives:
x↔∼y=(x∧∼y)∨(∼x∧∼(∼y)).
The double negation inside the second conjunct can be removed with the rule ∼(∼y)=y. Hence we get:
x↔∼y=(x∧∼y)∨(∼x∧y).
We must now take the negation of the whole expression. So we write:
∼(x↔∼y)=∼[(x∧∼y)∨(∼x∧y)].
To push the negation inside the parentheses, we invoke De Morgan’s law, which states:
∼(A∨B)=(∼A)∧(∼B).
Here A is x∧∼y and B is ∼x∧y. Therefore:
∼[(x∧∼y)∨(∼x∧y)]=[∼(x∧∼y)]∧[∼(∼x∧y)].
The next step is to remove each inner negation. Again, we apply De Morgan’s law, this time in the form ∼(A∧B)=(∼A)∨(∼B). For the first bracket we have A=x and B=∼y:
∼(x∧∼y)=(∼x)∨(∼(∼y))=(∼x)∨y.
For the second bracket we have A=∼x and B=y:
∼(∼x∧y)=(∼(∼x))∨(∼y)=x∨(∼y).
So the entire expression is now
[(∼x)∨y]∧[x∨(∼y)].
To simplify, we distribute the conjunction across the disjunctions. The distributive law tells us:
(A∨B)∧(C∨D)=(A∧C)∨(A∧D)∨(B∧C)∨(B∧D).
Letting A=∼x,B=y,C=x,D=∼y, we compute each product term one by one:
1. (∼x)∧x=False, because a proposition and its negation cannot both be true.
2. (∼x)∧(∼y)=∼x∧∼y.
3. y∧x=x∧y.
4. y∧(∼y)=False, again because a variable and its negation cannot both be true.
Combining the surviving non-false terms under disjunction gives:
(∼x∧∼y)∨(x∧y).
Conventionally we write the positive term first, so we obtain the final simplified negation as:
(x∧y)∨(∼x∧∼y).
Now we match this with the options provided. Option B is exactly
(x∧y)∨(∼x∧∼y).
Hence, the correct answer is Option 2.