It is trivial to see that P.
Whenever this occurs in a proof, it is essentially making a (meta-logical) claim that the statement "P" is easily implied by the preceding statements. This is usually one of the following types:
Example of the first type
It is easy to see that by symmetry we can assume P.
One usually verifies this by observing (meta-logically) that the preceding statements are invariant under a symmetry (usually a permutation of variables) and P is true in one of the cases under the symmetry. For example, if we have reals $x,y$ such that every statement we have proven still holds when we swap $x,y$, then we know that we can choose whether to swap or not such that $x \le y$. So we can say "By symmetry we can assume $x \le y$".
If you think about it, this reasoning about symmetry is not at all a short deduction in the sense that you have to check every single preceding statement. But yet it is such a standard technique that it is not worth writing out all the details to avoid the symmetry argument. An alternative is to show one case and state that the other is similar, which is essentially the same claim of triviality.
Example of the second type
It is trivial to check that P(0) holds.
This is often used in an induction argument, regardless of what P is, since usually it is the case that the intended audience can easily figure out how to prove it on their own and it would be a waste of space and time to write out the details.
Example of both types
A uniformly continuous function on $[0,1]$ is trivially continuous.
The triviality comes down to the basic meta-logical fact that an "$\exists \forall$" statement always implies the corresponding "$\forall \exists$" statement where the quantifiers are swapped. Every reader trained in basic mathematics is expected to know this, and so it is fine to consider it trivial.