Lemma stn_eq_or_neq_right {n} {i j : (⟦ n ⟧)%stn} : forall (p : i ≠ j), stn_eq_or_neq i j = inr p. Proof. intros; apply isaprop_stn_eq_or_neq. Defined.
Require Import UniMath.Foundations.All. Require Import UniMath.MoreFoundations.All. Require Import UniMath.Combinatorics.Maybe. Require Import UniMath.Combinatorics.StandardFiniteSets. Require Import UniMath.Algebra.Domains_and_Fields. Require Import UniMath.Algebra.RigsAndRings.