\indexentry{Set (sort)}{26}
\indexentry{Prop}{26}
\indexentry{Type}{26}
\indexentry{fun ... =\textgreater{} ...}{26}
\indexentry{forall}{27}
\indexentry{... : ... (type cast)}{27}
\indexentry{... \textless{}: ...}{27}
\indexentry{... \textless{}\textless{}: ...}{27}
\indexentry{\_}{27}
\indexentry{let ... := ... (term)}{27}
\indexentry{match ... with ...}{27}
\indexentry{fix}{29}
\indexentry{cofix}{29}
\indexentry{Parameter (cmd)}{30}
\indexentry{"@ident already exists. (Axiom) (err)}{30}
\indexentry{Local Parameter (cmdv)}{30}
\indexentry{Parameters (cmdv)}{30}
\indexentry{Axiom (cmdv)}{30}
\indexentry{Axioms (cmdv)}{30}
\indexentry{Conjecture (cmdv)}{30}
\indexentry{Conjectures (cmdv)}{30}
\indexentry{Variable (cmd)}{31}
\indexentry{"@ident already exists. (Variable) (err)}{31}
\indexentry{Variables (cmdv)}{31}
\indexentry{Hypothesis (cmdv)}{31}
\indexentry{Hypotheses (cmdv)}{31}
\indexentry{Definition (cmd)}{32}
\indexentry{"@ident already exists. (Definition) (err)}{32}
\indexentry{The term ‘term’ has type ‘type’ while it is expected to have type ‘type’' (err)}{32}
\indexentry{Local Definition (cmdv)}{32}
\indexentry{Example (cmdv)}{32}
\indexentry{Let (cmd)}{32}
\indexentry{"@ident already exists. (Let) (err)}{32}
\indexentry{Let Fixpoint (cmdv)}{32}
\indexentry{Let CoFixpoint (cmdv)}{32}
\indexentry{Inductive (cmd)}{33}
\indexentry{Non strictly positive occurrence of ‘ident’ in ‘type’ (err)}{33}
\indexentry{The conclusion of ‘type’ is not valid!it must be built from ‘ident’ (err)}{33}
\indexentry{Variant (cmd)}{36}
\indexentry{The ‘num’ th argument of ‘ident’ must be ‘ident’ in ‘type’ (err)}{36}
\indexentry{CoInductive (cmd)}{37}
\indexentry{Fixpoint (cmd)}{38}
\indexentry{CoFixpoint (cmd)}{41}
\indexentry{Theorem (cmd)}{42}
\indexentry{The term ‘term’ has type ‘type’ which should be Set, Prop or Type (err)}{42}
\indexentry{"@ident already exists. (Theorem) (err)}{42}
\indexentry{Lemma (cmdv)}{42}
\indexentry{Remark (cmdv)}{42}
\indexentry{Fact (cmdv)}{42}
\indexentry{Corollary (cmdv)}{42}
\indexentry{Proposition (cmdv)}{42}
\indexentry{Record (cmd)}{43}
\indexentry{Printing Records (flag)}{45}
\indexentry{Printing Record (table)}{45}
\indexentry{Printing Constructor (table)}{45}
\indexentry{Printing Projections (flag)}{45}
\indexentry{‘ident’ cannot be defined (warn)}{46}
\indexentry{Records declared with the keyword Record or Structure cannot be recursive (err)}{46}
\indexentry{Cannot handle mutually (co)inductive records (err)}{46}
\indexentry{Primitive Projections (flag)}{47}
\indexentry{Printing Primitive Projection Parameters (flag)}{47}
\indexentry{Printing Primitive Projection Compatibility (flag)}{47}
\indexentry{Printing Matching (flag)}{50}
\indexentry{Printing Factorizable Match Patterns (flag)}{50}
\indexentry{Printing Allow Match Default Clause (flag)}{51}
\indexentry{Printing Wildcard (flag)}{51}
\indexentry{Printing Synth (flag)}{51}
\indexentry{Printing Let (table)}{51}
\indexentry{Printing If (table)}{51}
\indexentry{Function (cmd)}{52}
\indexentry{The recursive argument must be specified (err)}{53}
\indexentry{No argument name ‘ident’ (err)}{53}
\indexentry{Cannot use mutual definition with well-founded recursion or measure (err)}{53}
\indexentry{Cannot define graph for ‘ident’ (warn)}{53}
\indexentry{Cannot define principle(s) for ‘ident’ (warn)}{53}
\indexentry{Cannot build functional inversion principle (warn)}{54}
\indexentry{Section (cmd)}{55}
\indexentry{End (cmd)}{55}
\indexentry{This is not the last opened section (err)}{55}
\indexentry{Module (cmd)}{56}
\indexentry{Include (cmd)}{57}
\indexentry{Include (cmd)}{57}
\indexentry{End (cmd)}{57}
\indexentry{No such label ‘ident’ (err)}{57}
\indexentry{Signature components for label ‘ident’ do not match (err)}{57}
\indexentry{This is not the last opened module (err)}{57}
\indexentry{Module (cmd)}{57}
\indexentry{Module Type (cmd)}{57}
\indexentry{Include (cmd)}{57}
\indexentry{Include (cmd)}{57}
\indexentry{Inline (cmd)}{57}
\indexentry{End (cmd)}{58}
\indexentry{This is not the last opened module type (err)}{58}
\indexentry{Module Type (cmd)}{58}
\indexentry{Declare Module (cmd)}{58}
\indexentry{Import (cmd)}{61}
\indexentry{Export (cmdv)}{63}
\indexentry{‘qualid’ is not a module (err)}{63}
\indexentry{Trying to mask the absolute name ‘qualid’"! (warn)}{63}
\indexentry{Print Module (cmd)}{63}
\indexentry{Print Module Type (cmd)}{63}
\indexentry{Short Module Printing (flag)}{63}
\indexentry{Cannot infer a term for this placeholder. (Casual use of implicit arguments) (err)}{67}
\indexentry{Arguments (implicits) (cmd)}{68}
\indexentry{Arguments (cmd)}{68}
\indexentry{Arguments (cmd)}{69}
\indexentry{Implicit Arguments (flag)}{71}
\indexentry{Strict Implicit (flag)}{71}
\indexentry{Strongly Strict Implicit (flag)}{71}
\indexentry{Contextual Implicit (flag)}{72}
\indexentry{Reversible Pattern Implicit (flag)}{72}
\indexentry{Maximal Implicit Insertion (flag)}{72}
\indexentry{Arguments (cmd)}{73}
\indexentry{Print Implicit (cmd)}{73}
\indexentry{Printing Implicit (flag)}{73}
\indexentry{Printing Implicit Defensive (flag)}{73}
\indexentry{Parsing Explicit (flag)}{74}
\indexentry{Canonical Structure (cmd)}{74}
\indexentry{Print Canonical Projections (cmd)}{75}
\indexentry{Implicit Types (cmd)}{75}
\indexentry{{}`\sphinxleftcurlybrace{} \sphinxrightcurlybrace{}}{76}
\indexentry{{}`( )}{76}
\indexentry{Generalizable All Variables (cmd)}{76}
\indexentry{Generalizable No Variables (cmd)}{77}
\indexentry{Generalizable (cmd)}{77}
\indexentry{Global Generalizable (cmd)}{77}
\indexentry{Printing All (flag)}{77}
\indexentry{Printing Universes (flag)}{78}
\indexentry{Print Universes (cmd)}{78}
\indexentry{Printing Existential Instances (flag)}{79}
\indexentry{Theories}{80}
\indexentry{Connectives}{82}
\indexentry{True (term)}{82}
\indexentry{I (term)}{82}
\indexentry{False (term)}{82}
\indexentry{not (term)}{82}
\indexentry{and (term)}{82}
\indexentry{conj (term)}{82}
\indexentry{proj1 (term)}{82}
\indexentry{proj2 (term)}{82}
\indexentry{or (term)}{82}
\indexentry{or\_introl (term)}{82}
\indexentry{or\_intror (term)}{82}
\indexentry{iff (term)}{82}
\indexentry{IF\_then\_else (term)}{82}
\indexentry{Quantifiers}{82}
\indexentry{all (term)}{82}
\indexentry{ex (term)}{82}
\indexentry{exists (term)}{82}
\indexentry{ex\_intro (term)}{82}
\indexentry{ex2 (term)}{82}
\indexentry{exists2 (term)}{82}
\indexentry{ex\_intro2 (term)}{82}
\indexentry{Equality}{82}
\indexentry{eq (term)}{82}
\indexentry{eq\_refl (term)}{82}
\indexentry{absurd (term)}{83}
\indexentry{eq\_sym (term)}{83}
\indexentry{eq\_trans (term)}{83}
\indexentry{f\_equal (term)}{83}
\indexentry{sym\_not\_eq (term)}{83}
\indexentry{eq\_ind\_r (term)}{83}
\indexentry{eq\_rec\_r (term)}{83}
\indexentry{eq\_rect (term)}{83}
\indexentry{eq\_rect\_r (term)}{83}
\indexentry{f\_equal2 ... f\_equal5 (term)}{83}
\indexentry{Datatypes}{83}
\indexentry{Programming}{83}
\indexentry{unit (term)}{83}
\indexentry{tt (term)}{83}
\indexentry{bool (term)}{83}
\indexentry{true (term)}{83}
\indexentry{false (term)}{83}
\indexentry{nat (term)}{83}
\indexentry{O (term)}{83}
\indexentry{S (term)}{83}
\indexentry{option (term)}{83}
\indexentry{Some (term)}{83}
\indexentry{None (term)}{83}
\indexentry{identity (term)}{83}
\indexentry{refl\_identity (term)}{83}
\indexentry{sum (term)}{84}
\indexentry{A+B (term)}{84}
\indexentry{+ (term)}{84}
\indexentry{inl (term)}{84}
\indexentry{inr (term)}{84}
\indexentry{prod (term)}{84}
\indexentry{A*B (term)}{84}
\indexentry{* (term)}{84}
\indexentry{pair (term)}{84}
\indexentry{fst (term)}{84}
\indexentry{snd (term)}{84}
\indexentry{\sphinxleftcurlybrace{}x:A \textbar{} P x\sphinxrightcurlybrace{} (term)}{84}
\indexentry{sig (term)}{84}
\indexentry{exist (term)}{84}
\indexentry{sig2 (term)}{84}
\indexentry{exist2 (term)}{84}
\indexentry{\sphinxleftcurlybrace{}x:A \& P x\sphinxrightcurlybrace{} (term)}{84}
\indexentry{sigT (term)}{84}
\indexentry{existT (term)}{84}
\indexentry{sigT2 (term)}{84}
\indexentry{existT2 (term)}{84}
\indexentry{projT1 (term)}{84}
\indexentry{projT2 (term)}{84}
\indexentry{sumbool (term)}{85}
\indexentry{left (term)}{85}
\indexentry{right (term)}{85}
\indexentry{\sphinxleftcurlybrace{}A\sphinxrightcurlybrace{}+\sphinxleftcurlybrace{}B\sphinxrightcurlybrace{} (term)}{85}
\indexentry{sumor (term)}{85}
\indexentry{inleft (term)}{85}
\indexentry{inright (term)}{85}
\indexentry{A+\sphinxleftcurlybrace{}B\sphinxrightcurlybrace{} (term)}{85}
\indexentry{Choice (term)}{85}
\indexentry{Choice2 (term)}{85}
\indexentry{bool\_choice (term)}{85}
\indexentry{Exc (term)}{85}
\indexentry{value (term)}{85}
\indexentry{error (term)}{85}
\indexentry{False\_rect (term)}{85}
\indexentry{False\_rec (term)}{85}
\indexentry{eq\_rect (term)}{85}
\indexentry{absurd\_set (term)}{85}
\indexentry{and\_rect (term)}{85}
\indexentry{eq\_S (term)}{86}
\indexentry{pred (term)}{86}
\indexentry{pred\_Sn (term)}{86}
\indexentry{eq\_add\_S (term)}{86}
\indexentry{not\_eq\_S (term)}{86}
\indexentry{IsSucc (term)}{86}
\indexentry{O\_S (term)}{86}
\indexentry{n\_Sn (term)}{86}
\indexentry{plus (term)}{86}
\indexentry{plus\_n\_O (term)}{86}
\indexentry{plus\_n\_Sm (term)}{86}
\indexentry{mult (term)}{86}
\indexentry{mult\_n\_O (term)}{86}
\indexentry{mult\_n\_Sm (term)}{86}
\indexentry{le (term)}{86}
\indexentry{le\_n (term)}{86}
\indexentry{le\_S (term)}{86}
\indexentry{lt (term)}{86}
\indexentry{ge (term)}{86}
\indexentry{gt (term)}{86}
\indexentry{nat\_case (term)}{87}
\indexentry{nat\_double\_ind (term)}{87}
\indexentry{Well foundedness}{87}
\indexentry{Recursion}{87}
\indexentry{Well founded induction}{87}
\indexentry{Acc (term)}{87}
\indexentry{Acc\_inv (term)}{87}
\indexentry{Acc\_rect (term)}{87}
\indexentry{well\_founded (term)}{87}
\indexentry{Fix\_F (term)}{87}
\indexentry{fix\_eq (term)}{87}
\indexentry{Fix\_F\_inv (term)}{87}
\indexentry{Fix\_F\_eq (term)}{87}
\indexentry{identity (term)}{88}
\indexentry{notT (term)}{88}
\indexentry{Peano's arithmetic}{89}
\indexentry{nat\_scope}{89}
\indexentry{Arithmetical notations}{89}
\indexentry{+ (term)}{89}
\indexentry{* (term)}{89}
\indexentry{- (term)}{89}
\indexentry{singel: / (term)}{89}
\indexentry{\textless{}= (term)}{89}
\indexentry{\textgreater{}= (term)}{89}
\indexentry{\textless{} (term)}{89}
\indexentry{\textgreater{} (term)}{89}
\indexentry{?= (term)}{89}
\indexentry{mod (term)}{89}
\indexentry{discrR (tacn)}{91}
\indexentry{split\_Rabs (tacn)}{92}
\indexentry{split\_Rmult (tacn)}{92}
\indexentry{Notations for lists}{93}
\indexentry{length (term)}{93}
\indexentry{head (term)}{93}
\indexentry{tail (term)}{93}
\indexentry{app (term)}{93}
\indexentry{rev (term)}{93}
\indexentry{nth (term)}{93}
\indexentry{map (term)}{93}
\indexentry{flat\_map (term)}{93}
\indexentry{fold\_left (term)}{93}
\indexentry{fold\_right (term)}{93}
\indexentry{Print (cmd)}{124}
\indexentry{‘qualid’ not a defined object (err)}{124}
\indexentry{Universe instance should have length ‘num’ (err)}{124}
\indexentry{This object does not support universe names (err)}{124}
\indexentry{Print Term (cmdv)}{124}
\indexentry{About (cmd)}{124}
\indexentry{Print All (cmd)}{124}
\indexentry{Inspect (cmdv)}{124}
\indexentry{Set (cmd)}{125}
\indexentry{Unset (cmd)}{125}
\indexentry{Test (cmd)}{125}
\indexentry{Set "@option (cmd)}{125}
\indexentry{Unset "@option (cmd)}{125}
\indexentry{Test (cmd)}{125}
\indexentry{Print Options (cmd)}{125}
\indexentry{Add "@table (cmd)}{125}
\indexentry{Remove "@table (cmd)}{125}
\indexentry{Test "@table for (cmd)}{125}
\indexentry{Print Table "@table (cmd)}{125}
\indexentry{Test (cmd)}{125}
\indexentry{Print Tables (cmd)}{125}
\indexentry{Check (cmd)}{126}
\indexentry{Eval (cmd)}{126}
\indexentry{Compute (cmd)}{126}
\indexentry{Print Assumptions (cmd)}{126}
\indexentry{Print Opaque Dependencies (cmdv)}{126}
\indexentry{Print Transparent Dependencies (cmdv)}{126}
\indexentry{Print All Dependencies (cmdv)}{126}
\indexentry{Search (cmd)}{126}
\indexentry{The reference ‘qualid’ was not found in the current environment (err)}{126}
\indexentry{SearchAbout (cmdv)}{127}
\indexentry{SearchHead (cmd)}{128}
\indexentry{Module/section ‘qualid’ not found (err)}{128}
\indexentry{SearchPattern (cmd)}{128}
\indexentry{SearchRewrite (cmd)}{130}
\indexentry{Search Blacklist ‘string’ (table)}{130}
\indexentry{Locate (cmd)}{130}
\indexentry{Load (cmd)}{131}
\indexentry{Can’t find file ‘ident’ on loadpath (err)}{132}
\indexentry{Load is not supported inside proofs (err)}{132}
\indexentry{Files processed by Load cannot leave open proofs (err)}{132}
\indexentry{Require (cmd)}{132}
\indexentry{Require Import (cmdv)}{132}
\indexentry{Require Export (cmdv)}{132}
\indexentry{Cannot load qualid: no physical path bound to dirpath (err)}{132}
\indexentry{Cannot find library foo in loadpath (err)}{132}
\indexentry{Compiled library ‘ident’.vo makes inconsistent assumptions over library qualid (err)}{132}
\indexentry{Bad magic number (err)}{133}
\indexentry{The file {}`ident.vo{}` contains library dirpath and not library dirpath’ (err)}{133}
\indexentry{Require is not allowed inside a module or a module type (err)}{133}
\indexentry{Print Libraries (cmd)}{133}
\indexentry{Declare ML Module (cmd)}{133}
\indexentry{File not found on loadpath: ‘string’ (err)}{133}
\indexentry{Loading of ML object file forbidden in a native Coq (err)}{133}
\indexentry{Print ML Modules (cmd)}{133}
\indexentry{Pwd (cmd)}{133}
\indexentry{Cd (cmd)}{133}
\indexentry{Add LoadPath (cmd)}{134}
\indexentry{Add Rec LoadPath (cmd)}{134}
\indexentry{Remove LoadPath (cmd)}{134}
\indexentry{Print LoadPath (cmd)}{134}
\indexentry{Add ML Path (cmd)}{134}
\indexentry{Add Rec ML Path (cmd)}{134}
\indexentry{Print ML Path (cmd)}{134}
\indexentry{Locate File (cmd)}{134}
\indexentry{Locate Library (cmd)}{134}
\indexentry{Reset (cmd)}{134}
\indexentry{‘ident’: no such entry (err)}{134}
\indexentry{Back (cmd)}{135}
\indexentry{Invalid backtrack (err)}{135}
\indexentry{BackTo (cmd)}{135}
\indexentry{Backtrack (cmdv)}{135}
\indexentry{Invalid backtrack (err)}{135}
\indexentry{Quit (cmd)}{135}
\indexentry{Drop (cmd)}{135}
\indexentry{Time (cmd)}{136}
\indexentry{Redirect (cmd)}{136}
\indexentry{Timeout (cmd)}{136}
\indexentry{Default Timeout (opt)}{136}
\indexentry{Fail (cmd)}{136}
\indexentry{The command has not failed"! (err)}{136}
\indexentry{Silent (flag)}{136}
\indexentry{Warnings (opt)}{136}
\indexentry{Search Output Name Only (flag)}{136}
\indexentry{Printing Width (opt)}{136}
\indexentry{Printing Depth (opt)}{136}
\indexentry{Printing Compact Contexts (flag)}{137}
\indexentry{Printing Unfocused (flag)}{137}
\indexentry{Printing Dependent Evars Line (flag)}{137}
\indexentry{Opaque (cmd)}{137}
\indexentry{Global Opaque (cmdv)}{137}
\indexentry{The reference ‘qualid’ was not found in the current environment (err)}{137}
\indexentry{Transparent (cmd)}{137}
\indexentry{Global Transparent (cmdv)}{137}
\indexentry{The reference ‘qualid’ was not found in the current environment (err)}{138}
\indexentry{Strategy (cmd)}{138}
\indexentry{Print Strategy (cmd)}{138}
\indexentry{The reference is not unfoldable (err)}{138}
\indexentry{Declare Reduction (cmd)}{138}
\indexentry{Local (cmd)}{139}
\indexentry{Global (cmd)}{139}
\indexentry{No focused proof (err)}{139}
\indexentry{Goal (cmd)}{140}
\indexentry{Qed (cmd)}{140}
\indexentry{Attempt to save an incomplete proof (err)}{140}
\indexentry{Defined (cmdv)}{140}
\indexentry{Save (cmdv)}{140}
\indexentry{Admitted (cmd)}{140}
\indexentry{Abort (cmd)}{140}
\indexentry{No focused proof (No proof-editing in progress) (err)}{140}
\indexentry{Proof {}`term{}` (cmd)}{140}
\indexentry{Proof (cmd)}{141}
\indexentry{Proof using (cmd)}{141}
\indexentry{Default Proof Using (opt)}{141}
\indexentry{Suggest Proof Using (flag)}{142}
\indexentry{Collection (cmd)}{142}
\indexentry{Existential (cmd)}{142}
\indexentry{Grab Existential Variables (cmd)}{142}
\indexentry{Undo (cmd)}{142}
\indexentry{Restart (cmdv)}{142}
\indexentry{No focused proof to restart (err)}{142}
\indexentry{Focus (cmd)}{143}
\indexentry{Unfocus (cmd)}{143}
\indexentry{Unfocused (cmd)}{143}
\indexentry{\sphinxleftcurlybrace{}}{143}
\indexentry{\sphinxrightcurlybrace{}}{143}
\indexentry{This proof is focused, but cannot be unfocused this way (err)}{143}
\indexentry{No such goal. (Focusing) (err)}{143}
\indexentry{Brackets only support the single numbered goal selector (err)}{143}
\indexentry{Wrong bullet ‘bullet’: Current bullet ‘bullet’ is not finished (err)}{147}
\indexentry{Wrong bullet ‘bullet’: Bullet ‘bullet’ is mandatory here (err)}{147}
\indexentry{No such goal. Focus next goal with bullet ‘bullet’ (err)}{147}
\indexentry{Bullet Behavior (opt)}{148}
\indexentry{Show (cmd)}{148}
\indexentry{No focused proof (err)}{148}
\indexentry{No such goal (err)}{148}
\indexentry{Show Script (cmdv)}{148}
\indexentry{Show Proof (cmdv)}{148}
\indexentry{Show Conjectures (cmdv)}{149}
\indexentry{Show Intro (cmdv)}{149}
\indexentry{Show Intros (cmdv)}{149}
\indexentry{Show Existentials (cmdv)}{149}
\indexentry{Unknown inductive type (err)}{149}
\indexentry{Show Universes (cmdv)}{149}
\indexentry{Guarded (cmd)}{149}
\indexentry{Hyps Limit (opt)}{149}
\indexentry{Automatic Introduction (flag)}{149}
\indexentry{Optimize Proof (cmd)}{150}
\indexentry{Optimize Heap (cmd)}{150}
\indexentry{Default Goal Selector (opt)}{151}
\indexentry{No such binder (err)}{151}
\indexentry{Not the right number of missing arguments (err)}{151}
\indexentry{exact (tacn)}{152}
\indexentry{Not an exact proof (err)}{152}
\indexentry{eexact (tacnv)}{152}
\indexentry{assumption (tacn)}{152}
\indexentry{No such assumption (err)}{152}
\indexentry{eassumption (tacnv)}{152}
\indexentry{refine (tacn)}{152}
\indexentry{Invalid argument (err)}{153}
\indexentry{Refine passed ill-formed term (err)}{153}
\indexentry{Cannot infer a term for this placeholder. (refine) (err)}{153}
\indexentry{simple refine (tacnv)}{153}
\indexentry{notypeclasses refine (tacnv)}{153}
\indexentry{simple notypeclasses refine (tacnv)}{153}
\indexentry{apply (tacn)}{153}
\indexentry{Unable to unify ‘term’ with ‘term’ (err)}{154}
\indexentry{Unable to find an instance for the variables ‘ident’…‘ident’ (err)}{154}
\indexentry{Not the right number of missing arguments (err)}{154}
\indexentry{eapply (tacnv)}{154}
\indexentry{simple apply (tacnv)}{155}
\indexentry{simple eapply (tacnv)}{155}
\indexentry{lapply (tacnv)}{155}
\indexentry{When ‘term’ contains more than one non dependent product the tactic lapply only takes into account the first product (warn)}{155}
\indexentry{Universal Lemma Under Conjunction (flag)}{157}
\indexentry{apply ... in (tacn)}{157}
\indexentry{Statement without assumptions (err)}{157}
\indexentry{Unable to apply (err)}{157}
\indexentry{apply ... in ... as (tacnv)}{157}
\indexentry{constructor (tacn)}{158}
\indexentry{Not an inductive product (err)}{158}
\indexentry{Not enough constructors (err)}{158}
\indexentry{split (tacnv)}{158}
\indexentry{exists (tacnv)}{158}
\indexentry{Not an inductive goal with 1 constructor (err)}{158}
\indexentry{left (tacnv)}{158}
\indexentry{right (tacnv)}{158}
\indexentry{Not an inductive goal with 2 constructors (err)}{158}
\indexentry{econstructor (tacnv)}{158}
\indexentry{eexists (tacnv)}{158}
\indexentry{esplit (tacnv)}{158}
\indexentry{eleft (tacnv)}{158}
\indexentry{eright (tacnv)}{158}
\indexentry{intro (tacn)}{159}
\indexentry{No product even after head-reduction (err)}{159}
\indexentry{‘ident’ is already used (err)}{159}
\indexentry{intros (tacnv)}{159}
\indexentry{No such hypothesis in current goal (err)}{159}
\indexentry{No such hypothesis in current goal (err)}{160}
\indexentry{No such hypothesis: ‘ident’ (err)}{160}
\indexentry{intros ... (tacn)}{160}
\indexentry{Bracketing Last Introduction Pattern (flag)}{162}
\indexentry{clear (tacn)}{162}
\indexentry{No such hypothesis (err)}{162}
\indexentry{‘ident’ is used in the conclusion (err)}{162}
\indexentry{‘ident’ is used in the hypothesis ‘ident’ (err)}{162}
\indexentry{clearbody (tacnv)}{163}
\indexentry{‘ident’ is not a local definition (err)}{163}
\indexentry{revert (tacn)}{163}
\indexentry{No such hypothesis (err)}{163}
\indexentry{‘ident’ is used in the hypothesis ‘ident’ (err)}{163}
\indexentry{revert dependent (tacnv)}{163}
\indexentry{move ... after ... (tacn)}{163}
\indexentry{move ... before ... (tacnv)}{163}
\indexentry{move ... at top (tacnv)}{163}
\indexentry{move ... at bottom (tacnv)}{163}
\indexentry{No such hypothesis (err)}{163}
\indexentry{Cannot move ‘ident’ after ‘ident’: it occurs in the type of ‘ident’ (err)}{163}
\indexentry{Cannot move ‘ident’ after ‘ident’: it depends on ‘ident’ (err)}{163}
\indexentry{rename (tacn)}{165}
\indexentry{No such hypothesis (err)}{165}
\indexentry{‘ident’ is already used (err)}{165}
\indexentry{set (tacn)}{165}
\indexentry{The variable ‘ident’ is already defined (err)}{165}
\indexentry{eset (tacnv)}{166}
\indexentry{remember (tacn)}{166}
\indexentry{eremember (tacnv)}{166}
\indexentry{pose (tacn)}{166}
\indexentry{epose (tacnv)}{166}
\indexentry{decompose (tacn)}{166}
\indexentry{assert (tacn)}{167}
\indexentry{Not a proposition or a type (err)}{167}
\indexentry{Proof is not complete. (assert) (err)}{168}
\indexentry{Variable ‘ident’ is already declared (err)}{168}
\indexentry{eassert (tacnv)}{168}
\indexentry{pose proof (tacnv)}{168}
\indexentry{enough (tacnv)}{168}
\indexentry{eenough (tacnv)}{168}
\indexentry{cut (tacnv)}{169}
\indexentry{specialize (tacnv)}{169}
\indexentry{‘ident’ is used in hypothesis ‘ident’ (err)}{169}
\indexentry{‘ident’ is used in conclusion (err)}{169}
\indexentry{generalize (tacn)}{169}
\indexentry{evar (tacn)}{170}
\indexentry{instantiate (tacn)}{170}
\indexentry{admit (tacn)}{170}
\indexentry{absurd (tacn)}{170}
\indexentry{contradiction (tacn)}{171}
\indexentry{No such assumption (err)}{171}
\indexentry{contradict (tacn)}{171}
\indexentry{exfalso (tacn)}{171}
\indexentry{destruct (tacn)}{171}
\indexentry{destruct ... eqn: (tacnv)}{172}
\indexentry{edestruct (tacnv)}{172}
\indexentry{case (tacn)}{172}
\indexentry{ecase (tacnv)}{172}
\indexentry{simple destruct (tacnv)}{173}
\indexentry{induction (tacn)}{173}
\indexentry{Not an inductive product (err)}{174}
\indexentry{Unable to find an instance for the variables ‘ident’ ... ‘ident’ (err)}{174}
\indexentry{einduction (tacnv)}{174}
\indexentry{induction ... using ... (tacnv)}{174}
\indexentry{elim (tacnv)}{175}
\indexentry{elim ... with (tacnv)}{175}
\indexentry{eelim (tacnv)}{175}
\indexentry{elimtype (tacnv)}{176}
\indexentry{simple induction (tacnv)}{176}
\indexentry{double induction (tacn)}{176}
\indexentry{dependent induction (tacn)}{176}
\indexentry{dependent destruction (tacnv)}{177}
\indexentry{function induction (tacn)}{178}
\indexentry{Cannot find induction information on ‘qualid’ (err)}{179}
\indexentry{Not the right number of induction arguments (err)}{179}
\indexentry{discriminate (tacn)}{179}
\indexentry{No primitive equality found (err)}{179}
\indexentry{Not a discriminable equality (err)}{179}
\indexentry{ediscriminate (tacnv)}{179}
\indexentry{No discriminable equalities (err)}{180}
\indexentry{injection (tacn)}{180}
\indexentry{Not a projectable equality but a discriminable one (err)}{181}
\indexentry{Nothing to do, it is an equality between convertible ‘terms’ (err)}{181}
\indexentry{Not a primitive equality (err)}{181}
\indexentry{Nothing to inject (err)}{181}
\indexentry{einjection (tacnv)}{181}
\indexentry{goal does not satisfy the expected preconditions (err)}{181}
\indexentry{Structural Injection (flag)}{181}
\indexentry{Keep Proof Equalities (flag)}{182}
\indexentry{inversion (tacn)}{182}
\indexentry{dependent inversion (tacnv)}{183}
\indexentry{dependent inversion ... with ... (tacnv)}{184}
\indexentry{simple inversion (tacnv)}{184}
\indexentry{fix (tacn)}{188}
\indexentry{cofix (tacn)}{189}
\indexentry{rewrite (tacn)}{189}
\indexentry{The ‘term’ provided does not end with an equation (err)}{189}
\indexentry{Tactic generated a subgoal identical to the original goal. This happens if ‘term’ does not occur in the goal (err)}{189}
\indexentry{erewrite (tacnv)}{190}
\indexentry{replace (tacn)}{190}
\indexentry{Terms do not have convertible types (err)}{190}
\indexentry{cutrewrite (tacnv)}{191}
\indexentry{subst (tacn)}{191}
\indexentry{Regular Subst Tactic (flag)}{191}
\indexentry{stepl (tacn)}{191}
\indexentry{Declare Left Step (cmd)}{192}
\indexentry{stepr (tacnv)}{192}
\indexentry{Declare Right Step (cmd)}{192}
\indexentry{change (tacn)}{192}
\indexentry{Not convertible (err)}{192}
\indexentry{Too few occurrences (err)}{192}
\indexentry{cbv (tacn)}{193}
\indexentry{lazy (tacn)}{193}
\indexentry{compute (tacn)}{193}
\indexentry{vm\_compute (tacnv)}{194}
\indexentry{native\_compute (tacnv)}{194}
\indexentry{NativeCompute Profiling (flag)}{194}
\indexentry{NativeCompute Profile Filename (opt)}{194}
\indexentry{Debug Cbv (flag)}{194}
\indexentry{red (tacn)}{194}
\indexentry{Not reducible (err)}{194}
\indexentry{No head constant to reduce (err)}{194}
\indexentry{hnf (tacn)}{194}
\indexentry{cbn (tacn)}{195}
\indexentry{simpl (tacn)}{195}
\indexentry{Too few occurrences (err)}{196}
\indexentry{Debug RAKAM (flag)}{197}
\indexentry{unfold (tacn)}{197}
\indexentry{‘qualid’ does not denote an evaluable constant (err)}{197}
\indexentry{Bad occurrence number of ‘qualid’ (err)}{197}
\indexentry{‘qualid’ does not occur (err)}{197}
\indexentry{fold (tacn)}{197}
\indexentry{pattern (tacn)}{198}
\indexentry{No such hypothesis: ‘ident’ (err)}{198}
\indexentry{auto (tacn)}{199}
\indexentry{debug auto (tacnv)}{199}
\indexentry{trivial (tacnv)}{199}
\indexentry{debug trivial (tacnv)}{199}
\indexentry{info\_trivial (tacnv)}{199}
\indexentry{Info Auto (flag)}{199}
\indexentry{Debug Auto (flag)}{199}
\indexentry{Info Trivial (flag)}{199}
\indexentry{Debug Trivial (flag)}{199}
\indexentry{eauto (tacn)}{200}
\indexentry{Info Eauto (flag)}{200}
\indexentry{Debug Eauto (flag)}{200}
\indexentry{autounfold (tacn)}{200}
\indexentry{autorewrite (tacn)}{200}
\indexentry{easy (tacn)}{201}
\indexentry{now (tacnv)}{201}
\indexentry{Print Hint (cmd)}{201}
\indexentry{Create HintDb (cmd)}{202}
\indexentry{Hint (cmd)}{202}
\indexentry{Hint Resolve (cmdv)}{202}
\indexentry{‘term’ cannot be used as a hint (err)}{202}
\indexentry{Hint Immediate (cmdv)}{203}
\indexentry{‘term’ cannot be used as a hint (err)}{203}
\indexentry{Hint Constructors (cmdv)}{203}
\indexentry{‘ident’ is not an inductive type (err)}{203}
\indexentry{Hint Unfold (cmdv)}{203}
\indexentry{Hint ( Transparent \textbar{} Opaque ) (cmdv)}{203}
\indexentry{Hint Extern (cmdv)}{203}
\indexentry{Remove Hints (cmd)}{205}
\indexentry{Print Hint (cmd)}{205}
\indexentry{Print Hint (cmd)}{206}
\indexentry{Print Hint (cmd)}{206}
\indexentry{Print HintDb (cmd)}{206}
\indexentry{Hint Rewrite (cmd)}{206}
\indexentry{Hint Rewrite (cmd)}{206}
\indexentry{Hint Rewrite (cmd)}{206}
\indexentry{Hint Rewrite (cmd)}{206}
\indexentry{Print Rewrite HintDb (cmd)}{206}
\indexentry{Loose Hint Behavior (opt)}{207}
\indexentry{Proof with (cmd)}{207}
\indexentry{Declare Implicit Tactic (cmd)}{207}
\indexentry{tauto (tacn)}{208}
\indexentry{dtauto (tacnv)}{209}
\indexentry{intuition (tacn)}{209}
\indexentry{dintuition (tacnv)}{209}
\indexentry{Intuition Negation Unfolding (flag)}{209}
\indexentry{rtauto (tacn)}{210}
\indexentry{firstorder (tacn)}{210}
\indexentry{Firstorder Solver (opt)}{210}
\indexentry{Print Firstorder Solver (cmd)}{210}
\indexentry{Firstorder Depth (opt)}{210}
\indexentry{congruence (tacn)}{210}
\indexentry{congruence with (tacnv)}{212}
\indexentry{I don’t know how to handle dependent equality (err)}{212}
\indexentry{Goal is solvable by congruence but some arguments are missing. Try congruence with ‘term’…‘term’, replacing metavariables by arbitrary terms (err)}{212}
\indexentry{Congruence Verbose (flag)}{212}
\indexentry{constr\_eq (tacn)}{212}
\indexentry{Not equal (err)}{212}
\indexentry{unify (tacn)}{212}
\indexentry{Unable to unify ‘term’ with ‘term’ (err)}{212}
\indexentry{is\_evar (tacn)}{212}
\indexentry{Not an evar (err)}{212}
\indexentry{has\_evar (tacn)}{212}
\indexentry{No evars (err)}{212}
\indexentry{is\_var (tacn)}{212}
\indexentry{Not a variable or hypothesis (err)}{213}
\indexentry{f\_equal (tacn)}{213}
\indexentry{reflexivity (tacn)}{213}
\indexentry{The conclusion is not a substitutive equation (err)}{213}
\indexentry{Unable to unify ... with ... (err)}{213}
\indexentry{symmetry (tacn)}{213}
\indexentry{transitivity (tacn)}{213}
\indexentry{decide equality (tacn)}{213}
\indexentry{compare (tacn)}{213}
\indexentry{simplify\_eq (tacn)}{213}
\indexentry{esimplify\_eq (tacnv)}{214}
\indexentry{dependent rewrite -\textgreater{} (tacn)}{214}
\indexentry{dependent rewrite \textless{}- (tacnv)}{214}
\indexentry{functional inversion (tacn)}{214}
\indexentry{Hypothesis ‘ident’ must contain at least one Function (err)}{214}
\indexentry{Cannot find inversion information for hypothesis ‘ident’ (err)}{214}
\indexentry{quote (tacn)}{214}
\indexentry{quote: not a simple fixpoint (err)}{214}
\indexentry{classical\_left (tacn)}{215}
\indexentry{classical\_right (tacnv)}{215}
\indexentry{btauto (tacn)}{215}
\indexentry{Cannot recognize a boolean equality (err)}{215}
\indexentry{omega (tacn)}{215}
\indexentry{ring (tacn)}{215}
\indexentry{ring\_simplify (tacn)}{215}
\indexentry{field (tacn)}{216}
\indexentry{field\_simplify (tacn)}{216}
\indexentry{field\_simplify\_eq (tacn)}{216}
\indexentry{fourier (tacn)}{217}
\indexentry{cycle (tacn)}{217}
\indexentry{swap (tacn)}{218}
\indexentry{revgoals (tacn)}{219}
\indexentry{shelve (tacn)}{220}
\indexentry{shelve\_unifiable (tacnv)}{220}
\indexentry{Unshelve (cmd)}{221}
\indexentry{give\_up (tacn)}{221}
\indexentry{ltac-seq (tacn)}{224}
\indexentry{{[}\textgreater{} ... \textbar{} ... \textbar{} ... {]} (dispatch) (tacn)}{224}
\indexentry{... : ... (goal selector) (tacn)}{225}
\indexentry{only ... : ... (tacnv)}{225}
\indexentry{all: ... (tacnv)}{225}
\indexentry{par: ... (tacnv)}{225}
\indexentry{No such goal. (Goal selector) (err)}{225}
\indexentry{do (tacn)}{226}
\indexentry{repeat (tacn)}{226}
\indexentry{try (tacn)}{226}
\indexentry{progress (tacn)}{226}
\indexentry{Failed to progress (err)}{226}
\indexentry{+ (backtracking branching) (tacn)}{226}
\indexentry{first (tacn)}{227}
\indexentry{No applicable tactic (err)}{227}
\indexentry{\textbar{}\textbar{} (left-biased branching) (tacn)}{227}
\indexentry{tryif (tacn)}{227}
\indexentry{once (tacn)}{227}
\indexentry{exactly\_once (tacn)}{228}
\indexentry{This tactic has more than one success (err)}{228}
\indexentry{assert\_fails (tacn)}{228}
\indexentry{assert\_succeeds (tacn)}{228}
\indexentry{solve (tacn)}{228}
\indexentry{Cannot solve the goal (err)}{228}
\indexentry{idtac (tacn)}{228}
\indexentry{fail (tacn)}{229}
\indexentry{gfail (tacnv)}{229}
\indexentry{Tactic Failure message (level ‘num’) (err)}{229}
\indexentry{No such goal. (fail) (err)}{229}
\indexentry{timeout (tacn)}{232}
\indexentry{time (tacn)}{232}
\indexentry{time\_constr (tacn)}{232}
\indexentry{restart\_timer (tacn)}{232}
\indexentry{finish\_timing (tacn)}{232}
\indexentry{let ... := ... (tacn)}{233}
\indexentry{No matching clauses for match (err)}{234}
\indexentry{Argument of match does not evaluate to a term (err)}{234}
\indexentry{match goal (tacn)}{235}
\indexentry{No matching clauses for match goal (err)}{236}
\indexentry{Not a context variable (err)}{236}
\indexentry{Unbound context identifier ‘ident’ (err)}{236}
\indexentry{guard (tacn)}{238}
\indexentry{Condition not satisfied (err)}{238}
\indexentry{abstract (tacn)}{238}
\indexentry{transparent\_abstract (tacnv)}{238}
\indexentry{Proof is not complete. (abstract) (err)}{239}
\indexentry{Ltac (cmd)}{239}
\indexentry{Print Ltac (cmd)}{239}
\indexentry{Print Ltac Signatures (cmd)}{239}
\indexentry{Info (cmd)}{239}
\indexentry{Info Level (opt)}{240}
\indexentry{Ltac Debug (flag)}{240}
\indexentry{Debug mode not available in the IDE (err)}{240}
\indexentry{Ltac Batch Debug (flag)}{240}
\indexentry{Ltac Profiling (flag)}{241}
\indexentry{Show Ltac Profile (cmd)}{241}
\indexentry{Reset Ltac Profile (cmd)}{241}
\indexentry{start ltac profiling (tacn)}{242}
\indexentry{stop ltac profiling (tacn)}{242}
\indexentry{reset ltac profile (tacn)}{242}
\indexentry{show ltac profile (tacn)}{242}
\indexentry{show ltac profile (tacn)}{242}
\indexentry{optimize\_heap (tacn)}{243}
\indexentry{Prenex Implicits (cmd)}{265}
\indexentry{pose (ssreflect) (tacn)}{266}
\indexentry{set (ssreflect) (tacn)}{267}
\indexentry{move (tacn)}{277}
\indexentry{elim (ssreflect) (tacn)}{278}
\indexentry{apply (ssreflect) (tacn)}{278}
\indexentry{... : ... (ssreflect) (tacn)}{280}
\indexentry{abstract (ssreflect) (tacn)}{282}
\indexentry{=\textgreater{} (tacn)}{282}
\indexentry{case (ssreflect) (tacnv)}{286}
\indexentry{by (tacn)}{290}
\indexentry{done (tacn)}{290}
\indexentry{last (tacn)}{291}
\indexentry{first (ssreflect) (tacn)}{292}
\indexentry{last first (tacn)}{292}
\indexentry{first last (tacn)}{292}
\indexentry{do (ssreflect) (tacn)}{293}
\indexentry{in (tacn)}{294}
\indexentry{have (tacn)}{295}
\indexentry{SsrHave NoTCResolution (flag)}{302}
\indexentry{wlog (tacn)}{303}
\indexentry{without loss (tacnv)}{303}
\indexentry{rewrite (ssreflect) (tacn)}{307}
\indexentry{unlock (tacn)}{321}
\indexentry{congr (tacn)}{322}
\indexentry{Hint View for move (cmd)}{344}
\indexentry{Hint View for apply (cmd)}{344}
\indexentry{Hint View for apply (cmd)}{345}
\indexentry{Search (ssreflect) (cmd)}{346}
\indexentry{generally have (tacnv)}{349}
\indexentry{suff (tacn)}{349}
\indexentry{suffices (tacnv)}{349}
\indexentry{Hint View for (cmd)}{351}
\indexentry{Hint View for apply (cmd)}{351}
\indexentry{Prenex Implicits (cmd)}{351}
\indexentry{Notation (cmd)}{352}
\indexentry{Print Grammar constr (cmd)}{354}
\indexentry{Print Grammar pattern (cmd)}{354}
\indexentry{Infix (cmd)}{356}
\indexentry{Printing Notations (flag)}{357}
\indexentry{Local Notation (cmd)}{363}
\indexentry{Open Scope (cmd)}{363}
\indexentry{Close Scope (cmd)}{363}
\indexentry{Local Open Scope (cmd)}{363}
\indexentry{Local Close Scope (cmd)}{363}
\indexentry{Global Open Scope (cmd)}{363}
\indexentry{Global Close Scope (cmd)}{363}
\indexentry{Delimit Scope (cmd)}{364}
\indexentry{Undelimit Scope (cmd)}{364}
\indexentry{Arguments (scopes) (cmd)}{364}
\indexentry{Bind Scope (cmd)}{365}
\indexentry{type\_scope}{366}
\indexentry{function\_scope}{366}
\indexentry{Print Visibility (cmd)}{367}
\indexentry{Print Scopes (cmd)}{367}
\indexentry{Print Scope (cmdv)}{368}
\indexentry{Tactic Notation (cmd)}{369}
\indexentry{Print Grammar tactic (cmd)}{369}
\indexentry{Scheme (cmd)}{370}
\indexentry{Scheme Equality (cmdv)}{370}
\indexentry{Elimination Schemes (flag)}{372}
\indexentry{Nonrecursive Elimination Schemes (flag)}{372}
\indexentry{Case Analysis Schemes (flag)}{372}
\indexentry{Boolean Equality Schemes (flag)}{372}
\indexentry{Decidable Equality Schemes (flag)}{372}
\indexentry{Rewriting Schemes (flag)}{372}
\indexentry{Combined Scheme (cmd)}{372}
\indexentry{Functional Scheme (cmd)}{373}
\indexentry{Derive Inversion (cmd)}{378}
\indexentry{Asymmetric Patterns (flag)}{408}
\indexentry{The constructor ‘ident’ expects ‘num’ arguments (err)}{413}
\indexentry{Non exhaustive pattern matching (err)}{413}
\indexentry{The elimination predicate term should be of arity ‘num’ (for non dependent case) or ‘num’ (for dependent case) (err)}{413}
\indexentry{Unable to infer a match predicate (err)}{413}
\indexentry{Either there is a type incompatibility or the problem involves dependencies (err)}{413}
\indexentry{Coercion (cmd)}{415}
\indexentry{‘qualid’ not declared (err)}{415}
\indexentry{‘qualid’ is already a coercion (err)}{415}
\indexentry{Funclass cannot be a source class (err)}{415}
\indexentry{‘qualid’ is not a function (err)}{415}
\indexentry{Cannot find the source class of ‘qualid’ (err)}{415}
\indexentry{Cannot recognize ‘class’ as a source class of ‘qualid’ (err)}{415}
\indexentry{‘qualid’ does not respect the uniform inheritance condition (err)}{415}
\indexentry{Found target class ... instead of ... (err)}{415}
\indexentry{Ambiguous path (warn)}{415}
\indexentry{Identity Coercion (cmd)}{416}
\indexentry{‘class’ must be a transparent constant (err)}{416}
\indexentry{Print Classes (cmd)}{416}
\indexentry{Print Coercions (cmd)}{416}
\indexentry{Print Graph (cmd)}{416}
\indexentry{Print Coercion Paths (cmd)}{417}
\indexentry{Printing Coercions (flag)}{417}
\indexentry{Printing Coercion (table)}{417}
\indexentry{Structure (cmdv)}{417}
\indexentry{Automatic Coercions Import (flag)}{417}
\indexentry{Class (cmd)}{436}
\indexentry{Class (cmd)}{437}
\indexentry{Existing Class (cmd)}{437}
\indexentry{Instance (cmd)}{437}
\indexentry{Program Instance (cmdv)}{437}
\indexentry{Declare Instance (cmdv)}{437}
\indexentry{Existing Instance (cmd)}{437}
\indexentry{Context (cmd)}{437}
\indexentry{typeclasses eauto (tacn)}{437}
\indexentry{autoapply (tacn)}{438}
\indexentry{Typeclasses Transparent (cmd)}{438}
\indexentry{Typeclasses Opaque (cmd)}{438}
\indexentry{Typeclasses Dependency Order (flag)}{439}
\indexentry{Typeclasses Filtered Unification (flag)}{439}
\indexentry{Typeclasses Limit Intros (flag)}{439}
\indexentry{Typeclass Resolution For Conversion (flag)}{439}
\indexentry{Typeclasses Strict Resolution (flag)}{439}
\indexentry{Typeclasses Unique Solutions (flag)}{439}
\indexentry{Typeclasses Unique Instances (flag)}{439}
\indexentry{Typeclasses Debug (flag)}{439}
\indexentry{Typeclasses Debug Verbosity (opt)}{440}
\indexentry{Refine Instance Mode (flag)}{440}
\indexentry{Typeclasses eauto (cmd)}{440}
\indexentry{romega (tacnv)}{440}
\indexentry{omega can't solve this system (err)}{441}
\indexentry{omega: Not a quantifier-free goal (err)}{441}
\indexentry{omega: Unrecognized predicate or connective: ‘ident’ (err)}{441}
\indexentry{omega: Unrecognized atomic proposition: ... (err)}{441}
\indexentry{omega: Can't solve a goal with proposition variables (err)}{441}
\indexentry{omega: Unrecognized proposition (err)}{441}
\indexentry{omega: Can't solve a goal with non-linear products (err)}{441}
\indexentry{omega: Can't solve a goal with equality on type ... (err)}{441}
\indexentry{Stable Omega (flag)}{442}
\indexentry{Omega UseLocalDefs (flag)}{442}
\indexentry{Omega System (flag)}{442}
\indexentry{Omega Action (flag)}{442}
\indexentry{lra (tacn)}{444}
\indexentry{lia (tacn)}{445}
\indexentry{nra (tacn)}{446}
\indexentry{nia (tacn)}{446}
\indexentry{psatz (tacn)}{446}
\indexentry{Extraction (cmd)}{447}
\indexentry{Recursive Extraction (cmd)}{447}
\indexentry{Extraction (cmd)}{447}
\indexentry{Extraction Library (cmd)}{448}
\indexentry{Recursive Extraction Library (cmd)}{448}
\indexentry{Separate Extraction (cmd)}{448}
\indexentry{Extraction TestCompile (cmd)}{448}
\indexentry{Extraction Language OCaml (cmd)}{448}
\indexentry{Extraction Language Haskell (cmd)}{448}
\indexentry{Extraction Language Scheme (cmd)}{448}
\indexentry{Extraction Optimize (flag)}{449}
\indexentry{Extraction Conservative Types (flag)}{449}
\indexentry{Extraction KeepSingleton (flag)}{449}
\indexentry{Extraction AutoInline (flag)}{449}
\indexentry{Extraction Inline (cmd)}{449}
\indexentry{Extraction NoInline (cmd)}{449}
\indexentry{Print Extraction Inline (cmd)}{449}
\indexentry{Reset Extraction Inline (cmd)}{449}
\indexentry{Extraction Implicit (cmd)}{449}
\indexentry{Extraction SafeImplicits (flag)}{450}
\indexentry{Extract Constant (cmd)}{450}
\indexentry{Extract Inlined Constant (cmd)}{450}
\indexentry{Extract Inductive (cmd)}{451}
\indexentry{Extraction Blacklist (cmd)}{452}
\indexentry{Print Extraction Blacklist (cmd)}{452}
\indexentry{Reset Extraction Blacklist (cmd)}{452}
\indexentry{Program Cases (flag)}{457}
\indexentry{Program Generalized Coercion (flag)}{457}
\indexentry{Program Definition (cmd)}{458}
\indexentry{"@ident already exists. (Program Definition) (err)}{458}
\indexentry{In environment … the term: ‘term’ does not have type ‘type’. Actually, it has type ... (err)}{458}
\indexentry{Program Fixpoint (cmd)}{458}
\indexentry{Program Lemma (cmd)}{459}
\indexentry{Obligation Tactic (cmd)}{459}
\indexentry{Show Obligation Tactic (cmd)}{459}
\indexentry{Obligations (cmd)}{459}
\indexentry{Obligation num (cmd)}{460}
\indexentry{Next Obligation (cmd)}{460}
\indexentry{Solve Obligations (cmd)}{460}
\indexentry{Solve All Obligations (cmd)}{460}
\indexentry{Admit Obligations (cmd)}{460}
\indexentry{Preterm (cmd)}{460}
\indexentry{Transparent Obligations (flag)}{460}
\indexentry{Hide Obligations (flag)}{460}
\indexentry{Shrink Obligations (flag)}{460}
\indexentry{Ill-formed recursive definition (err)}{460}
\indexentry{Not a valid ring equation (err)}{463}
\indexentry{Arguments of ring\_simplify do not have all the same type (err)}{463}
\indexentry{Cannot find a declared ring structure over ‘term’ (err)}{463}
\indexentry{Cannot find a declared ring structure for equality ‘term’ (err)}{464}
\indexentry{Add Ring (cmd)}{465}
\indexentry{Bad ring structure (err)}{466}
\indexentry{Bad lemma for decidability of equality (err)}{466}
\indexentry{Ring operation should be declared as a morphism (err)}{466}
\indexentry{Add Field (cmd)}{470}
\indexentry{nsatz (tacn)}{472}
\indexentry{Add Parametric Relation (cmd)}{475}
\indexentry{Add Relation (cmd)}{475}
\indexentry{Add Parametric Morphism (cmd)}{476}
\indexentry{setoid\_reflexivity (tacnv)}{480}
\indexentry{setoid\_symmetry (tacnv)}{480}
\indexentry{setoid\_transitivity (tacnv)}{480}
\indexentry{setoid\_rewrite (tacnv)}{480}
\indexentry{setoid\_replace (tacnv)}{480}
\indexentry{Print Instances (cmd)}{481}
\indexentry{Add Setoid (cmd)}{481}
\indexentry{Add Morphism (cmd)}{481}
\indexentry{rewrite\_strat (tacn)}{484}
\indexentry{Nothing to rewrite (err)}{484}
\indexentry{No progress made (err)}{484}
\indexentry{Unable to satisfy the rewriting constraints (err)}{485}
\indexentry{Derive (cmd)}{488}
\indexentry{Polymorphic (cmd)}{491}
\indexentry{Universe Polymorphism (flag)}{491}
\indexentry{Monomorphic (cmd)}{492}
\indexentry{Cumulative (cmd)}{492}
\indexentry{NonCumulative (cmd)}{492}
\indexentry{Polymorphic Inductive Cumulativity (flag)}{492}
\indexentry{Cumulativity Weak Constraints (flag)}{494}
\indexentry{Universe Minimization ToSet (flag)}{495}
\indexentry{Universe (cmd)}{495}
\indexentry{Constraint (cmd)}{495}
\indexentry{Undeclared universe ‘ident’ (err)}{495}
\indexentry{Universe inconsistency (err)}{495}
\indexentry{Strict Universe Declaration (flag)}{496}
