How should I go about proving P(x,y) $\forall x,y$ using complete induction? I couldn't find an example for this kind yet. (Some posts in here used normal induction, something like. a) P(0,0), b) for some x, y: $P(x,y) \rightarrow P(x+1,y)$ and c) for some x, y: $P(x,y) \rightarrow P(x,y+1)$. )
In my case, with P(x,y) alone I can not conclude P(x+1,y) or P(x, y+1). Thus, I wish to assume P(u,v) $\forall u,v < x, y$ in order to prove P(x,y).
Would the following scheme valid?
- prove P(0,0)
- prove P(0,y) $\forall y$
- prove P(x,0) $\forall x$
- assume P(u,y) $\forall u < x$ and $\forall y$, prove P(x,y)
- assume P(x,v) $\forall x$ and $\forall v < y$, prove P(x,y)
then conclude from 1-5 that P(x,y) $\forall x,y$.
Thanks