proposition: Lemma from_natneq_eq {X : UU} (m n : nat) : (m = n) -> (m ≠ n) -> X.
proof: Proof. intros m_eq_n m_neq_n. apply fromempty. destruct m_eq_n. eapply isirrefl_natneq. exact (m_neq_n). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.Maybe UniMath.Combinatorics.StandardFiniteSets UniMath.Algebra.Domains_and_Fields UniMath.Algebra.RigsAndRings