proposition: Lemma stn_eq_nat_eq { n : nat } (i j : ⟦ n ⟧%stn) : i = j <-> (pr1 i = pr1 j).
proof: Proof. split. - apply maponpaths. - 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