The issue that you raised occurs frequently in Algebra.
One starts with Constraint-1.
Then one determines that if Constraint-1 is satisfied, then Constraint-2 must also be satisfied.
Then, you determine all of the ways that Constraint-2 can be satisfied, and you discover that there is a way of satisfying Constraint-2 without satisfying Constraint-1.
Some people refer to this as Constraint-2 having extraneous roots.
My wording is simply that the navigation between Constraint-1 and (the derived) Constraint-2 is often a one way implication.
That is, Constraint-1 $~\implies~$ Constraint-2,
rather than Constraint-1 $~\iff~$ Constraint-2.
The classic example of this is
- Constraint-1 : $x = 2.$
- Constraint-2 : $x^2 = 4.$
So, when starting with Constraint-1, and deriving Constraint-2, and then determining all of the solutions to Constraint-2, these solutions are each merely candidate solutions to Constraint-1. Each candidate solution must be manually checked against Constraint-1.
However, assuming that Constraint-2 has been derived from Constraint-1, you do know that no solution to Constraint-1 is possible unless it is one of the candidate solutions to Constraint-2.