Lemma ne : ¬ (i = j). Proof. apply stnneq_to_nopath. exact tt. Defined.
Require Import UniMath.Foundations.Preamble. Require Import UniMath.Combinatorics.StandardFiniteSets. Require Import UniMath.MoreFoundations.NegativePropositions. Require Import UniMath.Combinatorics.Lists. Import UniMath.Combinatorics.FiniteSets. Import UniMath.MoreFoundations.DecidablePropositions. Import UniMath.Combinatorics.FiniteSequences. Import UniMath.Combinatorics.FiniteSets. Import UniMath.MoreFoundations.DecidablePropositions. Import UniMath.OrderTheory.OrderedSets.OrderedSets. Import UniMath.Combinatorics.StandardFiniteSets. Import UniMath.MoreFoundations.DecidablePropositions. Import UniMath.MoreFoundations.DecidablePropositions. Import UniMath.Combinatorics.BoundedSearch. Import UniMath.Foundations.Propositions.