From 56a2994e2ecc931836fb4ef8b2bdb027a705cfcd Mon Sep 17 00:00:00 2001
From: pboutill
Date: Tue, 28 Sep 2010 16:27:28 +0000
Subject: Minor fixes of 'make doc'

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@13472 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 doc/faq/FAQ.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'doc/faq/FAQ.tex')

diff --git a/doc/faq/FAQ.tex b/doc/faq/FAQ.tex
index baf3d49911..0e5b00d37d 100644
--- a/doc/faq/FAQ.tex
+++ b/doc/faq/FAQ.tex
@@ -1688,7 +1688,7 @@ Lemma Rwf : well_founded R.
 \item Define the step function (which needs proofs that recursive
 calls are on smaller arguments).
 
-\begin{coq_example*}
+\begin{verbatim}
 Definition split (l : list nat) 
    : {l1: list nat | R l1 l} * {l2 : list nat | R l2 l}
    := (* ... *) .
@@ -1698,7 +1698,7 @@ Definition merge_step (l : list nat) (f: forall l':list nat, R l' l -> list nat)
   let (l1,H1) := lH1 in
   let (l2,H2) := lH2 in
   concat (f l1 H1) (f l2 H2).
-\end{coq_example*}
+\end{verbatim}
 
 \item Define the recursive function by fixpoint on the step function.
 
-- 
cgit v1.2.3

