Here is my go at making it a bit more rigorous:
First note : 1/1 > 1/2,
In general, given 1/n, note (where n is a positive integer):
n + 1 > n
1/(n+1) < 1/n
By induction, we now that every term in this sequence is of smaller magnitude than the previous term.
However, we have not proven that the limit is zero, for there are many sequences, e.g. 2^(1/n), for which the above induction would hold but for which the sequence does not approach 0.
In this case, the limit of 1/n can be found by analyzing the limit of the sequence "n". This is because, if a sequence diverges when take at infinity, we also get to know something about it's reciprocal, namely it must be converging to a very specific value: 0.
To further justify, note a sequence defined by the converging series K. Clearly, the addition of each consecutive term to the series increases the magnitude of the sum by a steadily decreasing bit, however the rate of decrease is set so that a limit exists (consider the series for 2^(1/x) and apply the laws of geometric series to find the limit) . Since this limit takes the form of a number which we can denote by m, its reciprocal must exist (this is based on the axiom of inverse elements). Therefore, the reciprocal 1/m has a definite value (ascertainable or not).
However, in the case of a diverging sequence, i.e. like the natural numbers (the divergence of which relies on the fact that the natural number sequence can be defined by an arithmetic series, so that the difference between each consecutive term, by virtue of definition is constant), there is no upper limit to the highest element n, as in this case, the number n + 1, which can be demonstrated to be a member of this sequence by recursion, would be greater than n.
So, by the same step with reciprocals, no 1/n (where n is an element of the natural numbers) term will be the smallest member of its sequence. Yet it is clear that any magnitude bound, e.g. finding a 1/k smaller than 5^(-43544), can be satisfied by considering something like 1/(1+5^43544). Hence, no bound of magnitude will be the minimal bound, no matter of large the denominator; so finally, the magnitude of this sequence, as it does not converge to a non-0 number (otherwise there would be a bound on magnitude), must be going to well nothing. The idea is that the magnitudes get steadily smaller and smaller, and well, the smallest magnitude that would be approached if we kept doing this for an infinitely long time, would be "nothingness", 0 itself.
Alternatively, we can define the limit at infinity as the magnitude which the sequence will approach, but never reach, under finite conditions. So since any arbitrary positive bound (let's say less than 1) can be satisfied in with finitely many recursions, the ultimate bound which cannot be finitely satisfied must be 0 itself. Hence, the limit is 0.
I think the real point of any "justification" would be to demonstrate that 1/n indeed does not converge to a non-zero positive real number.
Have a nice day! :)