proposition: Lemma stn_eq {n : nat} (i i' : stn n) (H : pr1 i = pr1 i') : i = i'.
proof: Proof. refine (subtypePath _ H). intro. apply isasetbool. Qed.
imports: UniMath.Foundations.NaturalNumbers UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.NegativePropositions