Tactics Index

# Coq Reference Manual

# Tactics Index

+, 9.2 ∣∣, 9.2 ;, 9.2 ;[…∣…∣…], 9.2 [>…∣…∣…], 9.2 … : … (ssreflect), 11.5.3 … => … (ssreflect), 11.5.4 … in … (ssreflect), 11.5.1, 11.6.5 :, 9.2 abstract, 9.2 abstract: … (ssreflect), 11.5.3 absurd, 8.4.6 admit, 8.4.5 apply, 8.2.4 apply … in, 8.2.5 apply … with, 8.2.4 apply/… (ssreflect), 11.9.6 apply/…/… (ssreflect), 11.9.7 apply: … (ssreflect), 11.5.2 assert, 8.4.1 assert as, 8.4.1 assert by, 8.4.1 assumption, 8.2.2 auto, 8.8.1 autoapply, 20.6.6 autorewrite, 8.8.4 autounfold, 8.8.3 btauto, 8.16.1 by … (ssreflect), 11.6.2 case, 8.5.1 case: … (ssreflect), 11.5.2 case: … / … (ssreflect), 11.5.6 case_eq, 8.5.1 cbn, 8.7.4 cbv, 8.7.1 change, 8.6.5 change … in, 8.6.5 classical_left, 8.15.1 classical_right, 8.15.1 clear, 8.3.3 clear dependent, 8.3.3 clearbody, 8.3.3 cofix, 8.5.10 compare, 8.13.2 compute, 8.7.1, 8.7.1 congruence, 8.10.5 constr_eq, 8.11.1 constructor, 8.2.6 contradict, 8.4.8 contradiction, 8.4.7 cut, 8.4.1 cutrewrite, 8.6.2, 8.6.2 cycle, 8.17.1 decide equality, 8.13.1 decompose, 8.3.8 decompose record, 8.3.8 decompose sum, 8.3.8 dependent destruction, 8.5.4 dependent induction, 8.5.4 dependent induction … generalizing, 8.5.4 dependent inversion, 8.5.8 dependent inversion … as , 8.5.8 dependent inversion … as … with, 8.5.8 dependent inversion … with, 8.5.8 dependent inversion_clear, 8.5.8 dependent inversion_clear … as, 8.5.8 dependent inversion_clear … as … with, 8.5.8 dependent inversion_clear … with, 8.5.8 dependent rewrite ->, 8.13.4 dependent rewrite <-, 8.13.4 destruct, 8.5.1 dintuition, 8.10.2 discriminate, 8.5.6 discrR, 3.2.4 do, 9.2 do … [ … ] (ssreflect), 11.6.4 double induction, 8.5.3 dtauto, 8.10.1 eapply, 8.2.4 eapply … in, 8.2.5 eassert, 8.4.1 eassert as, 8.4.1 eassert by, 8.4.1 eassumption, 8.2.2 eauto, 8.8.2 ecase, 8.5.1 econstructor, 8.2.6 edestruct, 8.5.1 ediscriminate, 8.5.6 eelim, 8.5.2 eenough, 8.4.1 eenough as, 8.4.1 eenough by, 8.4.1 eexact, 8.2.1 eexists, 8.2.6 einduction, 8.5.2 einjection, 8.5.7 eleft, 8.2.6 elim … using, 8.5.2 elim/… (ssreflect), 11.9.1 elim: … (ssreflect), 11.5.2 elimtype, 8.5.2 enough, 8.4.1, 8.4.1 enough as, 8.4.1 enough by, 8.4.1, 8.4.1, 8.4.1 epose, 8.3.7 epose proof, 8.4.1 eremember, 8.3.7 erewrite, 8.6.1 eright, 8.2.6 eset, 8.3.7 esimplify_eq, 8.13.3 esplit, 8.2.6 evar, 8.4.3 exact, 8.2.1 exactly_once, 9.2 exfalso, 8.4.9 exists, 8.2.6 f_equal, 8.12.1 fail, 9.2 field, 8.16.4, 25.7 field_simplify, 8.16.4, 25.7 field_simplify_eq, 8.16.4, 25.7 first, 9.2 first … last (ssreflect), 11.6.3 firstorder, 8.10.4 firstorder tactic, 8.10.4 firstorder using, 8.10.4 firstorder with, 8.10.4 fix, 8.5.9 fold, 8.7.6 fourier, 8.16.5 functional induction, 8.5.5, 13.2 functional inversion, 8.14.1 generalize, 8.4.2 generalize dependent, 8.4.2 gfail, 9.2 give_up, 8.4.5, 8.17.6 | has_evar, 8.11.4 have: … (ssreflect), 11.6.6 have: … := … (ssreflect), 11.6.6 hnf, 8.7.3 idtac, 9.2 induction, 8.5.2 injection, 8.5.7 injection … as, 8.5.7 instantiate, 8.4.4 intro, 8.3.1 intro after, 8.3.1 intro at bottom, 8.3.1 intro at top, 8.3.1 intro before, 8.3.1 intros, 8.3.1 intros intro_pattern, 8.3.2 intros until, 8.3.1, 8.3.1 intuition, 8.10.2 inversion, 8.5.8 inversion … as, 8.5.8 inversion … as … in, 8.5.8 inversion … in, 8.5.8 inversion … using, 8.5.8, 13.3 inversion … using … in, 8.5.8 inversion_clear, 8.5.8 inversion_clear … as, 8.5.8 inversion_clear … as … in, 8.5.8 inversion_clear … in, 8.5.8 inversion_sigma, 8.5.8 is_evar, 8.11.3 is_var, 8.11.5 lapply, 8.2.4 last … first (ssreflect), 11.6.3 lazy, 8.7.1 left, 8.2.6 lia, 22.1, 22.4 lra, 22.1 move, 8.3.5 move (ssreflect), 11.5.2 move eq : … (ssreflect), 11.5.5 move/… (ssreflect), 11.9.2, 11.9.2, 11.9.6 move: … (ssreflect), 11.5.1 move: … => … (ssreflect), 11.5.1 move=> … (ssreflect), 11.5.1 native_compute, 8.7.1, 8.7.1 nia, 22.1, 22.6 notypeclasses refine, 8.2.3 nra, 22.1, 22.5 nsatz, 26.1 omega, 8.16.2, 21.1 once, 9.2 pattern, 8.7.7 pose, 8.3.7 pose … := … (ssreflect), 11.4.1 pose cofix … := … (ssreflect), 11.4.1 pose fix … := … (ssreflect), 11.4.1 pose proof, 8.4.1 progress, 9.2 psatz, 22.1 quote, 8.14.2, 10.3 red, 8.7.2 refine, 8.2.3 reflexivity, 8.12.2 remember, 8.3.7 rename, 8.3.6 repeat, 9.2 replace … with, 8.6.2 revert, 8.3.4 revert dependent, 8.3.4 revgoals, 8.17.3 rewrite, 8.6.1 rewrite ->, 8.6.1 rewrite <-, 8.6.1 rewrite … at, 8.6.1 rewrite … by, 8.6.1 rewrite … in, 8.6.1 rewrite … (ssreflect), 11.7 rewrite_strat, 27.4.2 right, 8.2.6 ring, 8.16.3, 25, 25.4 ring_simplify, 8.16.3, 25.4 rtauto, 8.10.3 set, 8.3.7 set … := … (ssreflect), 11.4.2 setoid_reflexivity, 27.2.2 setoid_replace, 27.2.2 setoid_rewrite, 27.2.2 setoid_symmetry, 27.2.2 setoid_transitivity, 27.2.2 shelve, 8.17.4 shelve_unifiable, 8.17.4 simpl, 8.7.4 simpl … in, 8.7.4 simple notypeclasses refine, 8.2.3 simple apply, 8.2.4 simple apply … in, 8.2.5 simple destruct, 8.5.1 simple eapply … in, 8.2.5 simple induction, 8.5.2 simple inversion, 8.5.8 simple inversion … as, 8.5.8 simple refine, 8.2.3 simplify_eq, 8.13.3 solve, 9.2 specialize, 8.4.1 split, 8.2.6 split_Rabs, 3.2.4 split_Rmult, 3.2.4 start ltac profiling, 9.4.3 stepl, 8.6.4 stepr, 8.6.4 stop ltac profiling, 9.4.3 subst, 8.6.3 suff: … (ssreflect), 11.6.6 suffices: … (ssreflect), 11.6.6 swap, 8.17.2 symmetry, 8.12.3 symmetry in, 8.12.3 tauto, 8.10.1 time, 9.2 timeout, 9.2 transitivity, 8.12.4 transparent_abstract, 9.2 trivial, 8.8.1 try, 9.2 tryif, 9.2 typeclasses eauto, 20.6.5 unfold, 8.7.5 unfold … in, 8.7.5 unify, 8.11.2 vm_compute, 8.7.1, 8.7.1 without loss: … / … (ssreflect), 11.6.6 wlog: … / … (ssreflect), 11.6.6