fact: Definition seq_key_eq_lemma {X :UU}( g g' : Sequence X)(e_len : length g = length g') (e_el : forall ( i : nat )(ltg : i < length g )(ltg' : i < length g' ), g (i ,, ltg) = g' (i ,, ltg')) : g=g'.
imports: UniMath.Combinatorics.FiniteSets UniMath.Combinatorics.Lists UniMath.Combinatorics.Vectors UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Tactics