strong-induction

What problem does it solve?

Proves statements about natural numbers using strong induction to establish P(n) from P(k) for all k < n.

Core Features & Use Cases

• Applicable to recurrences and well-ordering arguments where the inductive step depends on all smaller cases.
• Clear inductive framework: base case, strong IH, and a constructive proof of P(n).
• Lean formalization: includes guidance and templates for encoding strong induction in Lean.

Quick Start

Prove a target property P(n) for natural numbers by assuming P(k) holds for all k < n and deriving P(n).