Mathlib Map

Theorems · Definition · logic and foundations

Nat.unpaired

{α : Sort u_1} → (ℕ → ℕ → α) → ℕ → α

Calls the given function on a pair of entries n, encoded via the pairing function.

Defined in
Mathlib.Computability.Primrec.Basic
Cited by
20 results in Mathlib
Foundations
Depth 24 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Primrec₂.unpaired' · cited by 5Primrec₂.unpaired'Nat.Partrec.Code.exists_code · cited by 5Code.exists_codeNat.Primrec.casesOn' · cited by 3Primrec.casesOn'Primrec₂.ofNat_iff · cited by 3Primrec₂.ofNat_iffPrimrec₂.unpaired · cited by 2Primrec₂.unpairedNat.Primrec.add · cited by 2Primrec.addNat.Primrec.mul · cited by 2Primrec.mulPrimrec₂.nat_iff · cited by 2Primrec₂.nat_iffNat.Partrec.prec' · cited by 1Partrec.prec'Nat.Partrec.rfind' · cited by 1Partrec.rfind'Nat.Partrec.Code.evaln_bound · cited by 1Code.evaln_boundNat.Primrec.sub · cited by 1Primrec.subNat.Primrec.swap · cited by 1Primrec.swapPartrec₂.unpaired · cited by 1Partrec₂.unpairedPartrec₂.unpaired' · cited by 1Partrec₂.unpaired'Nat.unpair · cited by 67Nat.unpairNat.unpairedCITED BYCITES

Cites1

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by26

Results whose statement or proof uses this declaration.