proposition: Lemma dualelement_eq {n : nat} (i j : ⟦ n ⟧%stn) : dualelement i = j -> i = dualelement j.
proof: Proof. do 2 rewrite dualelement_defs_eq; unfold dualelement'. intros H; apply subtypePath_prop; revert H; simpl. intros eq; rewrite <- eq; simpl. rewrite minusminusmmn; try reflexivity. apply natlthsntoleh. apply natgthtogehm1, (pr2 i). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.Maybe UniMath.Combinatorics.StandardFiniteSets UniMath.Algebra.Domains_and_Fields UniMath.Algebra.RigsAndRings