⊢ Q.E.D
∀ theorem → ∃ proof — LLM-guided formal verification, powered by Modal.
Enter a theorem in Lean 4 syntax (∀ ∃ ¬ ∧ ∨ → ↔ ℕ ℤ α all supported). The agent proposes tactics, Lean's kernel verifies each step, and kernel errors feed back into the next proposal. Watch it prove a true theorem — or correctly conclude a false one is unprovable.
∀ n m · n + m = m + n — addition is commutative
5 30
Examples — click to load
∀ provable ones first, then a false one ↓