Say I am trying to prove the statement $$1\cdot1! + 2\cdot 2! + \cdots + n \cdot n! = (n+1)!-1$$ by mathematical induction. I start by declaring that $P(n)$ is the statement given by $$1\cdot1! + 2\cdot 2! + \cdots + n \cdot n! = (n+1)!-1.$$ Now, I want to show that the base case, $P(1)$ is true. In other words, I want to show that $$1\cdot 1! = (1+1)!-1$$ is true. "Doing math" on both sides shows that $1=1$, a true statement. Thus, I conclude that $P(1)$ is a true statement.
However, I was told by my professor that I cannot simply plug $1$ into both sides of the equation from $P(n)$ since this starts by assuming that $P(1)$ is true. I am confused by this. I never actually asserted the true value of $P(1)$. Yes, I plugged $1$ into $P(n)$, but only in order to show that $P(n)$ holds for $n=1$. Is what I did incorrect? And if so, how would I correctly show this base case?