proposition: Lemma is_incr_impl_strincr {m : nat} (f : ⟦m⟧ → nat) : isincl f -> is_stn_increasing f -> is_stn_strictly_increasing f.
proof: Proof. intros incl incr i j e. assert (d : i ≤ j). { apply natlthtoleh. assumption. } assert (c := incr _ _ d); clear d. assert (b : i != j). { intro p. induction p. exact (isirreflnatlth _ e). } induction (natlehchoice _ _ c) as [T|U]. - exact T. - apply fromempty. unfold isincl,isofhlevel,isofhlevelf in incl. assert (V := invmaponpathsincl f incl i j U). induction V. exact (isirreflnatlth _ e). Defined.
imports: UniMath.Foundations.NaturalNumbers UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.NegativePropositions