proposition: Lemma lfun_invr_out f : lker f != 0%VS -> lfun_invr f = f.
proof: Proof. by rewrite /lfun_invr => /negPf->. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(choice fintype div tuple finfun bigop ssralg) mathcomp(finalg zmodp matrix vector poly)