Mathlib Map

Theorems · Definition · logic and foundations

Nat.Partrec.Code.casesOn

{motive : Nat.Partrec.Code → Sort u} →
  (t : Nat.Partrec.Code) →
    motive Nat.Partrec.Code.zero →
      motive Nat.Partrec.Code.succ →
        motive Nat.Partrec.Code.left →
          motive Nat.Partrec.Code.right →
            ((a a_1 : Nat.Partrec.Code) → motive (a.pair a_1)) →
              ((a a_1 : Nat.Partrec.Code) → motive (a.comp a_1)) →
                ((a a_1 : Nat.Partrec.Code) → motive (a.prec a_1)) →
                  ((a : Nat.Partrec.Code) → motive a.rfind') → motive t
Defined in
Mathlib.Computability.PartrecCode
Cited by
3 results in Mathlib
Foundations
Depth 3 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Nat.Partrec.Code.primrec_evaln · cited by 3Code.primrec_evalnNat.Partrec.Code.brecOn.eq · cited by 2brecOn.eqNat.Partrec.Code.evaln_bound · cited by 1Code.evaln_boundNat.Partrec.Code.ctorIdx · cited by 0Code.ctorIdxNat.Partrec.Code.noConfusion · cited by 0Code.noConfusionNat.Partrec.Code.noConfusionType · cited by 0Code.noConfusionTypeNat.Partrec.Code.ctorElim · cited by 0Code.ctorElimNat.Partrec.Code · cited by 66Partrec.CodeCode.casesOnCITED BYCITES

Cites1

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

Cited by7

Results whose statement or proof uses this declaration.