-- Lean 4 proof step from Mathlib.Computability.PartrecCode (goal)
Goal:
α : Type u_1
σ : Type u_2
inst : Primcodable α
inst_1 : Primcodable σ
c : α → Code
hc : Computable c
z : α → σ
hz : Computable z
s : α → σ
hs : Computable s
l : α → σ
hl : Computable l
r : α → σ
hr : Computable r
pr : α → Code × Code × σ × σ → σ
hpr : Computable₂ pr
co : α → Code × Code × σ × σ → σ
hco : Computable₂ co
pc : α → Code × Code × σ × σ → σ
hpc : Computable₂ pc
rf : α → Code × σ → σ
hrf : Computable₂ rf
PR : (a : α) → (cf cg : Code) → (hf hg : σ) → σ := fun (a : α) (cf cg : Code) (hf hg : σ) ↦ pr a (cf, cg, hf, hg)
CO : (a : α) → (cf cg : Code) → (hf hg : σ) → σ := fun (a : α) (cf cg : Code) (hf hg : σ) ↦ co a (cf, cg, hf, hg)
PC : (a : α) → (cf cg : Code) → (hf hg : σ) → σ := fun (a : α) (cf cg : Code) (hf hg : σ) ↦ pc a (cf, cg, hf, hg)
RF : (a : α) → (cf : Code) → (hf : σ) → σ := fun (a : α) (cf : Code) (hf : σ) ↦ rf a (cf, hf)
F : (a : α) → (c : Code) → σ :=
  fun (a : α) (c : Code) ↦
    Code.recOn (motive := fun (x : Code) ↦ σ) c (z a) (s a) (l a) (r a) (PR a) (CO a) (PC a) (RF a)
G₁ : Prod.{u_1, u_2} α (List σ) × ℕ × ℕ → Option σ :=
  fun (p : Prod.{u_1, u_2} α (List σ) × ℕ × ℕ) ↦
    (getElem? (valid := fun (as : List σ) (i : ℕ) ↦ i < as.length) p.1.2 p.2.2).bind fun (s : σ) ↦
      (getElem? (valid := fun (as : List σ) (i : ℕ) ↦ i < as.length) p.1.2 (unpair p.2.2).1).bind fun (s₁ : σ) ↦
        Option.map
          (fun (s₂ : σ) ↦
            bif p.2.1.bodd then
              bif p.2.1.div2.bodd then rf p.1.1 (ofNat Code p.2.2, s)
              else pc p.1.1 (ofNat Code (unpair p.2.2).1, ofNat Code (unpair p.2.2).2, s₁, s₂)
            else
              bif p.2.1.div2.bodd then co p.1.1 (ofNat Code (unpair p.2.2).1, ofNat Code (unpair p.2.2).2, s₁, s₂)
              else pr p.1.1 (ofNat Code (unpair p.2.2).1, ofNat Code (unpair p.2.2).2, s₁, s₂))
          (getElem? (valid := fun (as : List σ) (i : ℕ) ↦ i < as.length) p.1.2 (unpair p.2.2).2)
this_1 : Computable G₁
G : α → List σ → Option σ :=
  fun (a : α) (IH : List σ) ↦
    Nat.casesOn (motive := fun (x : ℕ) ↦ Option σ) IH.length (some (z a)) fun (n : ℕ) ↦
      Nat.casesOn (motive := fun (x : ℕ) ↦ Option σ) n (some (s a)) fun (n : ℕ) ↦
        Nat.casesOn (motive := fun (x : ℕ) ↦ Option σ) n (some (l a)) fun (n : ℕ) ↦
          Nat.casesOn (motive := fun (x : ℕ) ↦ Option σ) n (some (r a)) fun (n : ℕ) ↦ G₁ ((a, IH), n, n.div2.div2)
this : Computable₂ G
a : α
n : ℕ
succ :
  G (a, List.map ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a) (List.range (HAdd.hAdd (α := ℕ) 0 1 + 1))).1
      (a, List.map ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a) (List.range (HAdd.hAdd (α := ℕ) 0 1 + 1))).2 =
    some ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a (HAdd.hAdd (α := ℕ) 0 1 + 1))
⊢ G (a, List.map ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a) (List.range (n + 1 + 1))).1
      (a, List.map ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a) (List.range (n + 1 + 1))).2 =
    some ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a (n + 1 + 1))
have succ₁ : ∀ (n : ℕ),
  G (a, List.map ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a) (List.range (n + 1 + 1 + 1))).1
      (a, List.map ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a) (List.range (n + 1 + 1 + 1))).2 =
    some ((fun (a : α) (n : ℕ) ↦ F a (ofNat Code n)) a (n + 1 + 1 + 1))
Tactic: rcases n with - | n
Cleared hypotheses: n