proposition: Lemma stn_eq {k : nat} (i j : stn k) (eq : pr1 i = pr1 j) : i = j.
proof: Proof. now apply subtypePath_prop. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.Maybe UniMath.Combinatorics.StandardFiniteSets UniMath.Algebra.Domains_and_Fields UniMath.Algebra.RigsAndRings