proposition: Lemma umcomp_fundef g : um_comp g undef = undef.
proof: Proof. by rewrite /um_comp umfoldl_undef. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path bigop) pcm(options prelude finmap seqperm pred seqext) pcm(pcm morphism)