proposition: Lemma isaprop_stn_eq_or_neq {n} (i j : ⟦n⟧%stn) : isaprop ((i = j) ⨿ (i ≠ j)).
proof: Proof. refine (@isaprop_dec_with_negProp (_,,_) (stnneq _ _)). apply isasetstn. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.Maybe UniMath.Combinatorics.StandardFiniteSets UniMath.Algebra.Domains_and_Fields UniMath.Algebra.RigsAndRings