$$ 2^n<(n+1)! \quad \text{for all integers} \quad n \ge 2$$
Base Case: $$ 2^2< (2+1)! = 4< 6 $$ Correct
Assumption: $$ P(k): 2^k<(k+1)!$$ $$P(k+1)= 2^{k+1}<(k+2)!$$
Now we start with the Assumption : $$ 2^k<(k+1)!$$ $$ \text{Multiply 2 on both sides} \quad 2^{k+1}<2(k+1)! $$
$$ \text{Now we can say} \quad (k+2)!> 2(k+1)! \quad \text{to prove this inequality}$$
$$ (k+2)(k+1)! > 2(k+1)! $$
So now all we must prove is that $$ k+2 > 2 \quad \text{Which is True for} \quad k\ge 2$$
Your proof is correct, but could be more clearly written. In general in a proof, you should start with what you know, and move to what you are trying to prove. In yours, in the middle you jump to what you are trying to prove, then proceed to work backwards. This is always harder to follow. (Also, you list what you are trying to prove under the title "Assumption". That is just plain bad, even though it isn't what you meant.) Rewrite the last part as :
Assumption: $$2^k<(k+1)!$$ To be proved: $$2^{k+1}<(k+2)!$$
Since $0 < 2 < k+2$ and $0 < 2^k < (k+1)!$, $$(2)(2^k) < (k+2)(k+1)!$$ $$2^{k+1} < (k+2)!$$
Hence by induction $2^n < (n+1)!$ for all $n \ge 2$