proposition: Lemma ℕeq_realizer2 : forall e, ℤeq↓e ⊩ ∀₂n,m∈ℕ×ℕ, ∀A, (n = m ↦ A) → (~n = m ↦ A) → A.
proof: Proof. intro e. start. destruct (Z.eq_dec (Z.of_nat n) (Z.of_nat m)); rewrite Nat2Z.inj_iff in *; Ksolve. Qed.
imports: ZArith ClassicalRealizability.Kbase