I sure hope so!
at this point, I'm just nodding along as if I understand any of these words
```txt
First, fixing three premise-binding bugs I spotted in the proof I just wrote (the `f3/f4/f5` substitution steps cite the wrong hypothesis — each of the 12 premises must be used exactly once):
```
> Paren miscount — one close short:
```md
The kernel's sums are **left-nested** (`add(add(add(t1,t2),t3)...)`), and with `add` recursing on its first argument, the zeros don't auto-fold — each needs an explicit peel. Rewriting the whole proof with correct nesting and a 5-step peel:
```
Exactly! I agree:
```md
each step must target a term that literally appears. `sub(i, f₁)` needs a premise-carrying lemma that returns `{sub(i, f₁) == 0n}` directly (like the LTCG proofs do).
```
The post this replies to
Terminus needs JavaScript to show replies and pictures.