proposition: Lemma freshfUn_phantT U D fr (f : @morphism U (nat_mapPCM A) D) of phantom (_ -> _) f : forall x y : U, valid (x \+ y) -> D x y -> fresh (f (x \+ y)) <= fr -> fresh (f x) <= fr.
proof: Proof. by apply: freshfUnT. Qed.
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq path interval) pcm(options prelude pred finmap rtc seqext useqord uslice uconsec)