A growth bound by induction
The sum 0 + 1 + … + n is at least n.
0/6 completed in this course
Lean workspaceWrite only the proof steps. The theorem above is fixed.
Enter after constructor adds both goal bulletsLoading editor…
Type
\to, \and, \< … to insert symbols while typingNo problems detected so far. Run a check to hear from Lean.
ReadyLn 1, Col 1Pre-check passedLean 4