Exact expanded PA statement
forall b c a l. l = 0 -> (forall ff_i_empty. (exists ff_lt_empty_bound. ff_lt_empty_bound + S ff_i_empty = l) -> (((exists ff_h_empty_decoded. ff_h_empty_decoded + S (a + ff_i_empty) = S ((S (ff_i_empty)) * c)) /\ exists ff_q_empty_decoded. b = ff_q_empty_decoded * S ((S (ff_i_empty)) * c) + (a + ff_i_empty))))Structural proof guide
Every consecutive beta range of length zero is vacuous.
Direct prerequisites: add_eq_zero_right, succ_ne_zero. The authored body proceeds by case analysis (1), intermediate claims (1), equality transport (1).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 0001
intro b - 0002
intro c - 0003
intro a - 0004
intro l - 0005
intro hl - 0006
intro i - 0007
intro hi - 0008
rewrite hl at hi - 0009
exfalso - 0010
cases hi - 0011
have hsi : S i = 0 - 0012
specialize add_eq_zero_right x - 0013
specialize add_eq_zero_right (S i) - 0014
apply add_eq_zero_right - 0015
exact hi_witness - 0016
specialize succ_ne_zero i - 0017
apply succ_ne_zero - 0018
exact hsi