I haven't really found a solution to this confusion I currently have.
I know in certain cases, we can use "without loss of generality" to proceed in a proof. For example, to prove that "if a|b or a|c -> a|bc", we can assume without loss of generality that a|b and show that a|bc follows.
But let's say I have a theorem of the form: ∃a∈Z,∀b∈Z,(P(a)∧Q(b))
Doing a proof by contradiction, we would assume: ∀a∈Z,∃b∈Z,¬P(a)∨¬Q(b)
My question is would my proof be able to legitimately proceed this way? Assume ~P(a) Show this leads to a contradiction. Then, assuming the negation of the theorem leads to a contradiction so the original statement holds?
I have a suspicion that I can't do that, and instead the approach should be: Case 1: Assume ~P(a) Show this leads to a contradiction
Case 2: Assume ~Q(b) Show this leads to a contradiction
I appreciate any help!