Lemma from_natneq_eq {X : UU} (m n : nat) : (m = n) -> (m ≠ n) -> X. Proof. intros m_eq_n m_neq_n. apply fromempty. destruct m_eq_n. eapply isirrefl_natneq. exact (m_neq_n). 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.