case succ n h_ind =>
  cases k
  case zero =>
    dsimp [recComplete.aux]; unfold recCompleteWF
    apply congrArg; funext k hk; cases hk
  case succ k =>
    dsimp [recComplete.aux]; unfold recCompleteWF
    apply congrArg; funext k hk; rw [h_ind]
motive : Nat → Sort u
ind : (n : Nat) → ((k : Nat) → k < n → motive k) → motive n
n : Nat
h_ind : ∀ (k : Nat) (hk : k ≤ n), recComplete.aux ind n k hk = recCompleteWF ind k
k : Nat
hk : k ≤ succ n
⊢ recComplete.aux ind (succ n) k hk = recCompleteWF ind k
no goals