[FMFP] First rework complete

2026-07-27 21:29:09 +02:00 · 2026-07-06 15:23:34 +02:00
parent 0065a7be05
commit 2227f8ac63
10 changed files with 52 additions and 24 deletions
@@ -7,5 +7,3 @@ To prove $P$ for all $xs$ in \texttt{[T]}, we do the following:
 \shade{green}{Step case} We prove that $\forall y :: T, ys :: [T]. P[xs \mapsto ys] \rightarrow P[xs \mapsto y : ys]$, or in other words:
 We fix arbitrary $y :: T$ and $ys :: [T]$, which both are not free in $P$.
 We then apply our induction hypothesis $P[xs \mapsto ys]$ to prove $P[xs \mapsto y : ys]$
-
-