If $P \iff Q$ is true, does any proof of $Q$ need to use the fact that $P$ is true?
I am asking this because my course notes say that because a stable matching does not always exist with only one group, and any proof of a stable matching always existing must use the fact that there are two different groups of people where people of the the same group cannot match with each other. My understanding is that here, (there being two distinct groups of people to match) $\iff$ (there will always be a stable matching).
When trying to prove that a stable matching always exists, I am trying to see why we must use the condition that is sufficient and necessary for it. More generally, when $P \iff Q$ is true and trying to prove that $Q$ is true, why we must use the fact that $P$ is true? It seems that when $P \iff Q$ is true, we can prove $Q$ using the fact that $P$ is either true or false, and if $P$ is false then the principle of explosion can help us prove $Q,$ so we don't need to use the fact that it's true.
In the stable marriage problem, there is always a stable matching.
In the stable roommate problem, there isn't always a stable matching.
So any proof of the existence of a stable matching in the marriage situation has to assume something that is true of marriage, but false for roommates. Otherwise the marriage proof would also apply to the roommate proof. And so one has to use the assumptions that in marriage, the preferences form a bipartite graph. Or something weaker than that but that still distinguishes the two scenarios.
Something similar used to be common to quickly rule out bad proofs of Fermat's Last Theorem, solutions to $x^n + y^n = z^n$ do not exist iff $n > 2$. Those who would submit annoying amateur proofs would be asked "where do you use the assumption that $n > 2$?", and if they couldn't say, then the proof was rejected because it also would have been a proof of the nonexistence of pythagorean triples.