English
If h is a Results for think s, there exists m such that s has Results a m and n = m+1.
Русский
Если h — результаты think s, существует m, что s имеет Results a m и n = m+1.
LaTeX
$$$\forall {s} {a} {n}\; (\text{Results } (\text{think } s) a n) \rightarrow \exists m,\; \text{Results } s a m \land n = m + 1$$$
Lean4
theorem of_results_think {s : Computation α} {a n} (h : Results (think s) a n) : ∃ m, Results s a m ∧ n = m + 1 :=
by
haveI := of_think_terminates h.terminates
have := results_of_terminates' _ (of_think_mem h.mem)
exact ⟨_, this, Results.len_unique h (results_think this)⟩