proposition: Lemma dualelement_lt_comp {n : nat} (i j : ⟦ n ⟧%stn) : i < j -> (dualelement i) > (dualelement j).
proof: Proof. intros lt. do 2 rewrite dualelement_defs_eq; unfold dualelement'. apply minusgth0inv; simpl. rewrite natminusminusassoc, natpluscomm, <- natminusminusassoc, minusminusmmn. 2: { apply (natgthtogehm1 _ _ (pr2 j)). } apply (minusgth0 _ _ lt). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.Maybe UniMath.Combinatorics.StandardFiniteSets UniMath.Algebra.Domains_and_Fields UniMath.Algebra.RigsAndRings