Is it possible to prove `forall n: nat, le n 0 -> n = 0.` in Coq without using inversion?

Question

In the official coq tutorial they define the following inductive definition of less than or equal to:

Inductive le (n : nat) : nat -> Prop :=
          | le_n