From d3436bbbdb009818e32e80385ee62803222c0567 Mon Sep 17 00:00:00 2001 From: Josia Pietsch Date: Tue, 9 Jan 2024 05:05:25 +0100 Subject: [PATCH] fix small typo --- inputs/lecture_10.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/inputs/lecture_10.tex b/inputs/lecture_10.tex index 7ff994c..96b666f 100644 --- a/inputs/lecture_10.tex +++ b/inputs/lecture_10.tex @@ -134,7 +134,7 @@ Applications of induction and recursion: on a class $A$. Then there is a function $F\colon A \to \OR$, such that for all $x,y \in A$ - \[(x,y) \in R \implies F(x) < F(y) F(x) < F(y).\] + \[(x,y) \in R \implies F(x) < F(y).\] \end{lemma} \begin{proof} By the recursion theorem,