Theorems · Theorem · logic and foundations
ComputableIn.unpair
∀ {O : Set (ℕ →. ℕ)}, ComputableIn O Nat.unpair- Defined in
- Mathlib.Computability.RecursiveIn
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- PFunstatement and proof · cited by 207
- Nat.unpairstatement · cited by 67
- ComputableInstatement · cited by 11
- Primrec.computableInproof · cited by 9
- Primrec.unpairproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.