Standard Library | The Coq Proof Assistant

Global Index

(18818 entries)

Instance Index

G

J

V

X

Y

_

other

(548 entries)

Projection Index

G

H

K

L

V

X

Y

_

other

(206 entries)

Record Index

G

J

K

L

V

X

Y

_

other

(68 entries)

Lemma Index

Y

other

(8939 entries)

Section Index

H

J

Q

X

Y

_

other

(338 entries)

Constructor Index

K

V

Y

_

other

(422 entries)

Notation Index

F

J

K

T

U

X

Y

_

(644 entries)

Abbreviation Index

J

V

Y

_

other

(1243 entries)

Inductive Index

K

Q

V

X

Y

_

other

(209 entries)

Definition Index

J

_

other

(2935 entries)

Module Index

J

X

Y

_

other

(703 entries)

Axiom Index

K

V

X

Y

_

other

(699 entries)

Variable Index

H

J

Q

V

X

Y

_

other

(1456 entries)

Library Index

K

X

Y

_

other

(408 entries)

I

i [projection, in Coq.Logic.Berardi]
I [definition, in Coq.Logic.Hurkens]
I [constructor, in Coq.Init.Logic]
IAF [lemma, in Coq.Reals.MVT]
IAF_var [lemma, in Coq.Reals.MVT]
id [definition, in Coq.Init.Datatypes]
ID [definition, in Coq.Init.Datatypes]
id [definition, in Coq.Reals.Ranalysis1]
identity [inductive, in Coq.Init.Datatypes]
identity_refl [constructor, in Coq.Init.Datatypes]
identity_rect_r [definition, in Coq.Init.Logic_Type]
identity_rec_r [definition, in Coq.Init.Logic_Type]
identity_ind_r [definition, in Coq.Init.Logic_Type]
identity_congr [lemma, in Coq.Init.Logic_Type]
identity_trans [lemma, in Coq.Init.Logic_Type]
identity_sym [lemma, in Coq.Init.Logic_Type]
identity_is_a_congruence.z [variable, in Coq.Init.Logic_Type]
identity_is_a_congruence.y [variable, in Coq.Init.Logic_Type]
identity_is_a_congruence.x [variable, in Coq.Init.Logic_Type]
identity_is_a_congruence.f [variable, in Coq.Init.Logic_Type]
identity_is_a_congruence.B [variable, in Coq.Init.Logic_Type]
identity_is_a_congruence.A [variable, in Coq.Init.Logic_Type]
identity_is_a_congruence [section, in Coq.Init.Logic_Type]
ifb [definition, in Coq.Bool.Bool]
ifdec [definition, in Coq.Bool.DecBool]
ifdec_right [lemma, in Coq.Bool.DecBool]
ifdec_left [lemma, in Coq.Bool.DecBool]
iff [definition, in Coq.Init.Logic]
Iffalse [constructor, in Coq.Bool.IfProp]
Iffalse_inv [lemma, in Coq.Bool.IfProp]
iff_inverse_impl_subrelation [instance, in Coq.Classes.Morphisms]
iff_impl_subrelation [instance, in Coq.Classes.Morphisms]
iff_setoid [instance, in Coq.Classes.SetoidClass]
iff_iff_iff_impl_morphism [instance, in Coq.Classes.Morphisms_Prop]
iff_equivalence [instance, in Coq.Classes.RelationClasses]
iff_Transitive [instance, in Coq.Classes.RelationClasses]
iff_Symmetric [instance, in Coq.Classes.RelationClasses]
iff_Reflexive [instance, in Coq.Classes.RelationClasses]
iff_reflect [lemma, in Coq.Bool.Bool]
iff_stepl [lemma, in Coq.Init.Logic]
iff_to_and [lemma, in Coq.Init.Logic]
iff_and [lemma, in Coq.Init.Logic]
iff_sym [lemma, in Coq.Init.Logic]
iff_trans [lemma, in Coq.Init.Logic]
iff_refl [lemma, in Coq.Init.Logic]
IFProp [definition, in Coq.Logic.Berardi]
IfProp [inductive, in Coq.Bool.IfProp]
IfProp [library]
IfProp_sum [lemma, in Coq.Bool.IfProp]
IfProp_or [lemma, in Coq.Bool.IfProp]
IfProp_false [lemma, in Coq.Bool.IfProp]
IfProp_true [lemma, in Coq.Bool.IfProp]
Iftrue [constructor, in Coq.Bool.IfProp]
Iftrue_inv [lemma, in Coq.Bool.IfProp]
if_eqA_rewrite_r [lemma, in Coq.Sorting.PermutSetoid]
if_eqA_rewrite_l [lemma, in Coq.Sorting.PermutSetoid]
if_eqA [instance, in Coq.Sorting.PermutSetoid]
if_eqA_refl [lemma, in Coq.Sorting.PermutSetoid]
if_eqA_else [lemma, in Coq.Sorting.PermutSetoid]
if_eqA_then [lemma, in Coq.Sorting.PermutSetoid]
if_negb [lemma, in Coq.Bool.Bool]
IF_then_else [definition, in Coq.Init.Logic]
Im [inductive, in Coq.Sets.Image]
Image [section, in Coq.Sets.Image]
Image [library]
image_empty [lemma, in Coq.Sets.Image]
Image_set_continuous' [lemma, in Coq.Sets.Infinite_sets]
Image_set_continuous [lemma, in Coq.Sets.Infinite_sets]
image_dir [definition, in Coq.Reals.Rtopology]
image_rec [definition, in Coq.Reals.Rtopology]
Image.U [variable, in Coq.Sets.Image]
Image.V [variable, in Coq.Sets.Image]
imemo_get_correct [lemma, in Coq.Lists.StreamMemo]
imemo_list [definition, in Coq.Lists.StreamMemo]
imemo_make [definition, in Coq.Lists.StreamMemo]
impl [definition, in Coq.Program.Basics]
implb [definition, in Coq.Init.Datatypes]
imply_and_or2 [lemma, in Coq.Logic.Classical_Prop]
imply_and_or [lemma, in Coq.Logic.Classical_Prop]
imply_to_and [lemma, in Coq.Logic.Classical_Prop]
imply_to_or [lemma, in Coq.Logic.Classical_Prop]
impl_Transitive [instance, in Coq.Classes.RelationClasses]
impl_Reflexive [instance, in Coq.Classes.RelationClasses]
imp_not_l [lemma, in Coq.Logic.Decidable]
imp_simp [lemma, in Coq.Logic.Decidable]
Im_inv [lemma, in Coq.Sets.Image]
Im_add [lemma, in Coq.Sets.Image]
Im_def [lemma, in Coq.Sets.Image]
Im_intro [constructor, in Coq.Sets.Image]
In [definition, in Coq.Lists.List]
In [definition, in Coq.Sets.Uniset]
In [definition, in Coq.Sets.Ensembles]
IN [module, in Coq.MSets.MSetInterface]
In [definition, in Coq.Reals.RList]
In [inductive, in Coq.Vectors.VectorDef]
In [definition, in Coq.Numbers.Cyclic.Int31.Int31]
InA [inductive, in Coq.Lists.SetoidList]
InA_InfA [lemma, in Coq.Lists.SetoidList]
InA_dec [lemma, in Coq.Lists.SetoidList]
InA_app_idem [lemma, in Coq.Lists.SetoidList]
InA_permute_heads [lemma, in Coq.Lists.SetoidList]
InA_double_head [lemma, in Coq.Lists.SetoidList]
InA_singleton [lemma, in Coq.Lists.SetoidList]
InA_rev [lemma, in Coq.Lists.SetoidList]
InA_app_iff [lemma, in Coq.Lists.SetoidList]
InA_app [lemma, in Coq.Lists.SetoidList]
InA_split [lemma, in Coq.Lists.SetoidList]
InA_eqA [lemma, in Coq.Lists.SetoidList]
InA_compat [instance, in Coq.Lists.SetoidList]
InA_alt [lemma, in Coq.Lists.SetoidList]
InA_nil [lemma, in Coq.Lists.SetoidList]
InA_cons [lemma, in Coq.Lists.SetoidList]
InA_altdef [lemma, in Coq.Lists.SetoidList]
InA_cons_tl [constructor, in Coq.Lists.SetoidList]
InA_cons_hd [constructor, in Coq.Lists.SetoidList]
incl [definition, in Coq.Lists.List]
incl [definition, in Coq.Sets.Uniset]
inclA [definition, in Coq.Lists.SetoidList]
Included [definition, in Coq.Sets.Ensembles]
included [definition, in Coq.Reals.Rtopology]
Included_Empty [lemma, in Coq.Sets.Constructive_sets]
Included_Strict_Included [lemma, in Coq.Sets.Classical_sets]
Included_Add [lemma, in Coq.Sets.Powerset_Classical_facts]
included_trans [lemma, in Coq.Reals.Rtopology]
inclusion [definition, in Coq.Relations.Relation_Definitions]
Inclusion [library]
Inclusion_is_transitive [lemma, in Coq.Sets.Powerset]
Inclusion_is_an_order [lemma, in Coq.Sets.Powerset]
incl_app [lemma, in Coq.Lists.List]
incl_cons [lemma, in Coq.Lists.List]
incl_appr [lemma, in Coq.Lists.List]
incl_appl [lemma, in Coq.Lists.List]
incl_tran [lemma, in Coq.Lists.List]
incl_tl [lemma, in Coq.Lists.List]
incl_refl [lemma, in Coq.Lists.List]
incl_card_le [lemma, in Coq.Sets.Finite_sets_facts]
incl_st_card_lt [lemma, in Coq.Sets.Finite_sets_facts]
incl_right [lemma, in Coq.Sets.Uniset]
incl_left [lemma, in Coq.Sets.Uniset]
incl_add_x [lemma, in Coq.Sets.Powerset_facts]
incl_add [lemma, in Coq.Sets.Powerset_facts]
incl_clos_trans [lemma, in Coq.Wellfounded.Transitive_Closure]
incl_st_add_soustr [lemma, in Coq.Sets.Powerset_Classical_facts]
incl_soustr_add_r [lemma, in Coq.Sets.Powerset_Classical_facts]
incl_soustr_add_l [lemma, in Coq.Sets.Powerset_Classical_facts]
incl_soustr [lemma, in Coq.Sets.Powerset_Classical_facts]
incl_soustr_in [lemma, in Coq.Sets.Powerset_Classical_facts]
incl_nil [lemma, in Coq.Lists.SetoidList]
incr [definition, in Coq.Numbers.Cyclic.Int31.Int31]
incrbis_aux_equiv [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incrbis_aux [definition, in Coq.Numbers.Cyclic.Int31.Cyclic31]
increasing [definition, in Coq.Reals.Ranalysis1]
increasing_decreasing [lemma, in Coq.Reals.MVT]
increasing_decreasing_opp [lemma, in Coq.Reals.MVT]
incr_inv [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incr_firstr [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incr_twice_plus_one [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incr_twice_plus_one_firstl [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incr_twice [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incr_eqn2 [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
incr_eqn1 [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
ind [projection, in Coq.Reals.Rtopology]
IndefiniteDescription [library]
IndependenceOfGeneralPremises [definition, in Coq.Logic.ClassicalFacts]
IndependenceOfGeneralPremises [definition, in Coq.Logic.ChoiceFacts]
independence_general_premises_drinker [lemma, in Coq.Logic.ClassicalFacts]
independence_general_premises_Godel_Dummett [lemma, in Coq.Logic.ClassicalFacts]
independence_general_premises_right_distr_implication_over_disjunction [lemma, in Coq.Logic.ClassicalFacts]
index [definition, in Coq.Strings.String]
index_correct4 [lemma, in Coq.Strings.String]
index_correct3 [lemma, in Coq.Strings.String]
index_correct2 [lemma, in Coq.Strings.String]
index_correct1 [lemma, in Coq.Strings.String]
induct [definition, in Coq.Logic.Hurkens]
induction_gtof2 [lemma, in Coq.Arith.Wf_nat]
induction_ltof2 [lemma, in Coq.Arith.Wf_nat]
induction_gtof1 [lemma, in Coq.Arith.Wf_nat]
induction_ltof1 [lemma, in Coq.Arith.Wf_nat]
ind_0_1_SS [lemma, in Coq.Arith.Div2]
InfA [abbreviation, in Coq.Lists.SetoidList]
InfA_app [lemma, in Coq.Lists.SetoidList]
InfA_alt [lemma, in Coq.Lists.SetoidList]
InfA_eqA [lemma, in Coq.Lists.SetoidList]
InfA_compat [instance, in Coq.Lists.SetoidList]
InfA_ltA [lemma, in Coq.Lists.SetoidList]
infinite_sum [definition, in Coq.Reals.Rfunctions]
Infinite_sets.V [variable, in Coq.Sets.Infinite_sets]
Infinite_sets.U [variable, in Coq.Sets.Infinite_sets]
Infinite_sets [section, in Coq.Sets.Infinite_sets]
Infinite_sets [library]
infinit_sum [abbreviation, in Coq.Reals.Rfunctions]
InfoTyp [module, in Coq.MSets.MSetGenTree]
InfoTyp.t [axiom, in Coq.MSets.MSetGenTree]
infty [constructor, in Coq.NArith.Ndist]
Inhabited [inductive, in Coq.Sets.Ensembles]
inhabited [abbreviation, in Coq.Logic.ClassicalDescription]
inhabited [abbreviation, in Coq.Logic.Diaconescu]
inhabited [abbreviation, in Coq.Logic.ClassicalFacts]
inhabited [inductive, in Coq.Init.Logic]
Inhabited_intro [constructor, in Coq.Sets.Ensembles]
Inhabited_not_empty [lemma, in Coq.Sets.Constructive_sets]
Inhabited_add [lemma, in Coq.Sets.Constructive_sets]
Inhabited_Setminus [lemma, in Coq.Sets.Classical_sets]
inhabits [constructor, in Coq.Init.Logic]
inh_card_gt_O [lemma, in Coq.Sets.Finite_sets_facts]
Init [library]
injective [definition, in Coq.Sets.Image]
injective_projections [lemma, in Coq.Init.Datatypes]
injective_preserves_cardinal [lemma, in Coq.Sets.Image]
inject_Z_opp [lemma, in Coq.QArith.QArith_base]
inject_Z_mult [lemma, in Coq.QArith.QArith_base]
inject_Z_plus [lemma, in Coq.QArith.QArith_base]
inject_Z_injective [lemma, in Coq.QArith.QArith_base]
inject_Z [definition, in Coq.QArith.QArith_base]
injs [definition, in Coq.Numbers.Natural.BigN.Nbasic]
inj_pair2_eq_dec [lemma, in Coq.Logic.Eqdep_dec]
inj_right_pair [lemma, in Coq.Logic.Eqdep_dec]
inj_Zabs_nat [abbreviation, in Coq.ZArith.Zabs]
inj_pairT2_refl [lemma, in Coq.Program.Equality]
Inj_dep_pairT [abbreviation, in Coq.Logic.EqdepFacts]
Inj_dep_pairS [abbreviation, in Coq.Logic.EqdepFacts]
Inj_dep_pair [definition, in Coq.Logic.EqdepFacts]
inj_minus2 [lemma, in Coq.ZArith.Znat]
inj_max [abbreviation, in Coq.ZArith.Znat]
inj_min [abbreviation, in Coq.ZArith.Znat]
inj_minus [abbreviation, in Coq.ZArith.Znat]
inj_minus1 [abbreviation, in Coq.ZArith.Znat]
inj_mult [abbreviation, in Coq.ZArith.Znat]
inj_plus [abbreviation, in Coq.ZArith.Znat]
inj_gt_rev [abbreviation, in Coq.ZArith.Znat]
inj_ge_rev [abbreviation, in Coq.ZArith.Znat]
inj_lt_rev [abbreviation, in Coq.ZArith.Znat]
inj_le_rev [abbreviation, in Coq.ZArith.Znat]
inj_gt_iff [abbreviation, in Coq.ZArith.Znat]
inj_ge_iff [abbreviation, in Coq.ZArith.Znat]
inj_lt_iff [abbreviation, in Coq.ZArith.Znat]
inj_le_iff [abbreviation, in Coq.ZArith.Znat]
inj_eq_iff [abbreviation, in Coq.ZArith.Znat]
inj_eq_rev [abbreviation, in Coq.ZArith.Znat]
inj_compare [abbreviation, in Coq.ZArith.Znat]
inj_S [abbreviation, in Coq.ZArith.Znat]
inj_0 [abbreviation, in Coq.ZArith.Znat]
inj_gt [definition, in Coq.ZArith.Znat]
inj_ge [definition, in Coq.ZArith.Znat]
inj_lt [definition, in Coq.ZArith.Znat]
inj_le [definition, in Coq.ZArith.Znat]
inj_eq [definition, in Coq.ZArith.Znat]
inj_neq [lemma, in Coq.ZArith.Znat]
inl [constructor, in Coq.Init.Datatypes]
inleft [constructor, in Coq.Init.Specif]
inr [constructor, in Coq.Init.Datatypes]
INR [definition, in Coq.Reals.Raxioms]
inright [constructor, in Coq.Init.Specif]
INR_fact_lt_0 [lemma, in Coq.Reals.Rprod]
INR_fact_neq_0 [lemma, in Coq.Reals.Rfunctions]
INR_pos [abbreviation, in Coq.Reals.RIneq]
INR_lt_1 [abbreviation, in Coq.Reals.RIneq]
INR_IZR_INZ [lemma, in Coq.Reals.RIneq]
INR_le [lemma, in Coq.Reals.RIneq]
INR_eq [lemma, in Coq.Reals.RIneq]
INR_not_0 [lemma, in Coq.Reals.RIneq]
INR_lt [lemma, in Coq.Reals.RIneq]
insert [definition, in Coq.Reals.RList]
insert [lemma, in Coq.Sorting.Heap]
insert_exist [constructor, in Coq.Sorting.Heap]
insert_spec [inductive, in Coq.Sorting.Heap]
inser_trans_R [lemma, in Coq.Reals.RIneq]
inst [lemma, in Coq.Init.Logic]
Int [module, in Coq.ZArith.Int]
Int [library]
Integers [inductive, in Coq.Sets.Integers]
Integers [library]
Integers_infinite [lemma, in Coq.Sets.Integers]
Integers_has_no_ub [lemma, in Coq.Sets.Integers]
Integers_defn [constructor, in Coq.Sets.Integers]
Integers_sect [section, in Coq.Sets.Integers]
Integration [library]
interior [definition, in Coq.Reals.Rtopology]
interior_P3 [lemma, in Coq.Reals.Rtopology]
interior_P2 [lemma, in Coq.Reals.Rtopology]
interior_P1 [lemma, in Coq.Reals.Rtopology]
interp_carry [definition, in Coq.Numbers.Cyclic.DoubleCyclic.DoubleType]
Intersection [inductive, in Coq.Sets.Ensembles]
Intersection_preserves_finite [lemma, in Coq.Sets.Finite_sets_facts]
Intersection_intro [constructor, in Coq.Sets.Ensembles]
Intersection_inv [lemma, in Coq.Sets.Constructive_sets]
Intersection_commutative [lemma, in Coq.Sets.Powerset_facts]
Intersection_is_Glb [lemma, in Coq.Sets.Powerset]
Intersection_decreases_r [lemma, in Coq.Sets.Powerset]
Intersection_decreases_l [lemma, in Coq.Sets.Powerset]
Intersection_maximal [lemma, in Coq.Sets.Powerset]
intersection_vide_finite_in [definition, in Coq.Reals.Rtopology]
intersection_vide_in [definition, in Coq.Reals.Rtopology]
intersection_family [definition, in Coq.Reals.Rtopology]
intersection_domain [definition, in Coq.Reals.Rtopology]
IntMake [module, in Coq.FSets.FMapFullAVL]
IntMake [module, in Coq.FSets.FSetAVL]
IntMake_ord.lt_not_eq [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.lt_trans [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq_trans [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq_sym [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq_refl [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.lt_slt [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq_seq [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.slt [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.seq [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.selements [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.compare [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.lt [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.eq [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.compare_Cmp [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.compare_aux_Cmp [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.cons_Cmp [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.Cmp [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.cardinal_e_2 [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.cons_cardinal_e [lemma, in Coq.FSets.FMapFullAVL]
IntMake_ord.cardinal_e [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.elements [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.cmp [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.t [definition, in Coq.FSets.FMapFullAVL]
IntMake_ord.LO [module, in Coq.FSets.FMapFullAVL]
IntMake_ord.MD [module, in Coq.FSets.FMapFullAVL]
IntMake_ord.MapS [module, in Coq.FSets.FMapFullAVL]
IntMake_ord.Data [module, in Coq.FSets.FMapFullAVL]
IntMake_ord [module, in Coq.FSets.FMapFullAVL]
IntMake.add [definition, in Coq.FSets.FMapFullAVL]
IntMake.add_3 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.add_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.add_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.AvlProofs [module, in Coq.FSets.FMapFullAVL]
IntMake.bbst [record, in Coq.FSets.FMapFullAVL]
IntMake.Bbst [constructor, in Coq.FSets.FMapFullAVL]
IntMake.cardinal [definition, in Coq.FSets.FMapFullAVL]
IntMake.cardinal_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.E [module, in Coq.FSets.FMapFullAVL]
IntMake.elements [definition, in Coq.FSets.FMapFullAVL]
IntMake.elements_3w [lemma, in Coq.FSets.FMapFullAVL]
IntMake.elements_3 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.elements_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.elements_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.Elt [section, in Coq.FSets.FMapFullAVL]
IntMake.Elt.elt [variable, in Coq.FSets.FMapFullAVL]
IntMake.Elt.elt' [variable, in Coq.FSets.FMapFullAVL]
IntMake.Elt.elt'' [variable, in Coq.FSets.FMapFullAVL]
IntMake.Empty [definition, in Coq.FSets.FMapFullAVL]
IntMake.empty [definition, in Coq.FSets.FMapFullAVL]
IntMake.empty_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.Equal [definition, in Coq.FSets.FMapFullAVL]
IntMake.equal [definition, in Coq.FSets.FMapFullAVL]
IntMake.equal_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.equal_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.Equiv [definition, in Coq.FSets.FMapFullAVL]
IntMake.Equivb [definition, in Coq.FSets.FMapFullAVL]
IntMake.Equivb_Equivb [lemma, in Coq.FSets.FMapFullAVL]
IntMake.eq_key_elt [definition, in Coq.FSets.FMapFullAVL]
IntMake.eq_key [definition, in Coq.FSets.FMapFullAVL]
IntMake.find [definition, in Coq.FSets.FMapFullAVL]
IntMake.find_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.find_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.fold [definition, in Coq.FSets.FMapFullAVL]
IntMake.fold_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.In [definition, in Coq.FSets.FMapFullAVL]
IntMake.is_empty_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.is_empty_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.is_empty [definition, in Coq.FSets.FMapFullAVL]
IntMake.is_avl [projection, in Coq.FSets.FMapFullAVL]
IntMake.is_bst [projection, in Coq.FSets.FMapFullAVL]
IntMake.key [definition, in Coq.FSets.FMapFullAVL]
IntMake.lt_key [definition, in Coq.FSets.FMapFullAVL]
IntMake.map [definition, in Coq.FSets.FMapFullAVL]
IntMake.mapi [definition, in Coq.FSets.FMapFullAVL]
IntMake.mapi_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.mapi_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.MapsTo [definition, in Coq.FSets.FMapFullAVL]
IntMake.MapsTo_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.map_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.map_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.map2 [definition, in Coq.FSets.FMapFullAVL]
IntMake.map2_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.map2_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.mem [definition, in Coq.FSets.FMapFullAVL]
IntMake.mem_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.mem_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.MSet [module, in Coq.FSets.FSetAVL]
IntMake.remove [definition, in Coq.FSets.FMapFullAVL]
IntMake.remove_3 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.remove_2 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.remove_1 [lemma, in Coq.FSets.FMapFullAVL]
IntMake.t [definition, in Coq.FSets.FMapFullAVL]
IntMake.this [projection, in Coq.FSets.FMapFullAVL]
IntMake.X' [module, in Coq.FSets.FSetAVL]
Int_part_INR [lemma, in Coq.Reals.R_Ifp]
Int_part [definition, in Coq.Reals.R_Ifp]
Int_SF [definition, in Coq.Reals.RiemannInt_SF]
Int.eq_dec [axiom, in Coq.ZArith.Int]
Int.ge_lt_dec [axiom, in Coq.ZArith.Int]
Int.gt_le_dec [axiom, in Coq.ZArith.Int]
Int.i2z [axiom, in Coq.ZArith.Int]
Int.i2z_max [axiom, in Coq.ZArith.Int]
Int.i2z_mult [axiom, in Coq.ZArith.Int]
Int.i2z_minus [axiom, in Coq.ZArith.Int]
Int.i2z_opp [axiom, in Coq.ZArith.Int]
Int.i2z_plus [axiom, in Coq.ZArith.Int]
Int.i2z_3 [axiom, in Coq.ZArith.Int]
Int.i2z_2 [axiom, in Coq.ZArith.Int]
Int.i2z_1 [axiom, in Coq.ZArith.Int]
Int.i2z_0 [axiom, in Coq.ZArith.Int]
Int.i2z_eq [axiom, in Coq.ZArith.Int]
Int.max [axiom, in Coq.ZArith.Int]
Int.minus [axiom, in Coq.ZArith.Int]
Int.mult [axiom, in Coq.ZArith.Int]
Int.opp [axiom, in Coq.ZArith.Int]
Int.plus [axiom, in Coq.ZArith.Int]
Int.t [axiom, in Coq.ZArith.Int]
Int._3 [axiom, in Coq.ZArith.Int]
Int._2 [axiom, in Coq.ZArith.Int]
Int._1 [axiom, in Coq.ZArith.Int]
Int._0 [axiom, in Coq.ZArith.Int]
_ < _ <= _ (Int_scope) [notation, in Coq.ZArith.Int]
_ < _ < _ (Int_scope) [notation, in Coq.ZArith.Int]
_ <= _ < _ (Int_scope) [notation, in Coq.ZArith.Int]
_ <= _ <= _ (Int_scope) [notation, in Coq.ZArith.Int]
_ > _ (Int_scope) [notation, in Coq.ZArith.Int]
_ >= _ (Int_scope) [notation, in Coq.ZArith.Int]
_ < _ (Int_scope) [notation, in Coq.ZArith.Int]
_ <= _ (Int_scope) [notation, in Coq.ZArith.Int]
_ == _ (Int_scope) [notation, in Coq.ZArith.Int]
- _ (Int_scope) [notation, in Coq.ZArith.Int]
_ * _ (Int_scope) [notation, in Coq.ZArith.Int]
_ - _ (Int_scope) [notation, in Coq.ZArith.Int]
_ + _ (Int_scope) [notation, in Coq.ZArith.Int]
3 (Int_scope) [notation, in Coq.ZArith.Int]
2 (Int_scope) [notation, in Coq.ZArith.Int]
1 (Int_scope) [notation, in Coq.ZArith.Int]
0 (Int_scope) [notation, in Coq.ZArith.Int]
int31 [inductive, in Coq.Numbers.Cyclic.Int31.Int31]
Int31 [library]
Int31Cyclic [module, in Coq.Numbers.Cyclic.Int31.Cyclic31]
Int31Cyclic.ops [definition, in Coq.Numbers.Cyclic.Int31.Cyclic31]
Int31Cyclic.specs [definition, in Coq.Numbers.Cyclic.Int31.Cyclic31]
Int31Cyclic.t [definition, in Coq.Numbers.Cyclic.Int31.Cyclic31]
Int31Ring [lemma, in Coq.Numbers.Cyclic.Int31.Ring31]
Int31ring [module, in Coq.Numbers.Cyclic.Int31.Ring31]
int31_specs [instance, in Coq.Numbers.Cyclic.Int31.Cyclic31]
[|| _ ||] [notation, in Coq.Numbers.Cyclic.Int31.Cyclic31]
[-| _ |] [notation, in Coq.Numbers.Cyclic.Int31.Cyclic31]
[+| _ |] [notation, in Coq.Numbers.Cyclic.Int31.Cyclic31]
[| _ |] [notation, in Coq.Numbers.Cyclic.Int31.Cyclic31]
Int31_Specs [section, in Coq.Numbers.Cyclic.Int31.Cyclic31]
int31_ops [instance, in Coq.Numbers.Cyclic.Int31.Cyclic31]
int31_ind_twice [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
int31_ind_sneakl [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
Int31_canonic [lemma, in Coq.Numbers.Cyclic.Int31.Ring31]
inv [projection, in Coq.Logic.Berardi]
Inverse [module, in Coq.Numbers.Natural.Abstract.NIso]
inverse [abbreviation, in Coq.Classes.RelationClasses]
inverse_arrow [lemma, in Coq.Classes.Morphisms]
inverse_atom [lemma, in Coq.Classes.Morphisms]
inverse_respectful [lemma, in Coq.Classes.Morphisms]
inverse_pointwise_relation [lemma, in Coq.Classes.Morphisms_Relations]
Inverse_Image.RoF [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image.F [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image.Rof [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image.f [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image.R [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image.B [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image.A [variable, in Coq.Wellfounded.Inverse_Image]
Inverse_Image [section, in Coq.Wellfounded.Inverse_Image]
inverse_image_of_eq [lemma, in Coq.Relations.Relations]
inverse_image_of_equivalence [lemma, in Coq.Relations.Relations]
Inverse_Image [library]
Inverse.Hom12 [module, in Coq.Numbers.Natural.Abstract.NIso]
Inverse.Hom21 [module, in Coq.Numbers.Natural.Abstract.NIso]
Inverse.h12 [abbreviation, in Coq.Numbers.Natural.Abstract.NIso]
Inverse.h21 [abbreviation, in Coq.Numbers.Natural.Abstract.NIso]
Inverse.inverse_nat_iso [lemma, in Coq.Numbers.Natural.Abstract.NIso]
Inverse.NBasePropMod1 [module, in Coq.Numbers.Natural.Abstract.NIso]
_ == _ [notation, in Coq.Numbers.Natural.Abstract.NIso]
inverse1 [lemma, in Coq.Classes.Morphisms]
inverse2 [lemma, in Coq.Classes.Morphisms]
invert_heap [lemma, in Coq.Sorting.Heap]
inv_before_witness [definition, in Coq.Logic.ConstructiveEpsilon]
inv_fct [definition, in Coq.Reals.Ranalysis1]
inv_lt_rel [definition, in Coq.Arith.Wf_nat]
inv2 [projection, in Coq.Logic.Berardi]
In_dec [abbreviation, in Coq.Lists.List]
In_rev [abbreviation, in Coq.Lists.List]
In_split [abbreviation, in Coq.Lists.List]
in_prod_iff [lemma, in Coq.Lists.List]
in_prod [lemma, in Coq.Lists.List]
in_prod_aux [lemma, in Coq.Lists.List]
in_combine_r [lemma, in Coq.Lists.List]
in_combine_l [lemma, in Coq.Lists.List]
in_split_r [lemma, in Coq.Lists.List]
in_split_l [lemma, in Coq.Lists.List]
in_flat_map [lemma, in Coq.Lists.List]
in_map_iff [lemma, in Coq.Lists.List]
in_map [lemma, in Coq.Lists.List]
in_rev [lemma, in Coq.Lists.List]
in_app_iff [lemma, in Coq.Lists.List]
in_or_app [lemma, in Coq.Lists.List]
in_app_or [lemma, in Coq.Lists.List]
in_dec [lemma, in Coq.Lists.List]
in_inv [lemma, in Coq.Lists.List]
in_split [lemma, in Coq.Lists.List]
in_nil [lemma, in Coq.Lists.List]
in_cons [lemma, in Coq.Lists.List]
in_eq [lemma, in Coq.Lists.List]
In_singleton [constructor, in Coq.Sets.Ensembles]
In_cons_tl [constructor, in Coq.Vectors.VectorDef]
In_cons_hd [constructor, in Coq.Vectors.VectorDef]
In_Image_elim [lemma, in Coq.Sets.Image]
in_int_exists [lemma, in Coq.Arith.Between]
in_int_between [lemma, in Coq.Arith.Between]
in_int_Sp_q [lemma, in Coq.Arith.Between]
in_int_S [lemma, in Coq.Arith.Between]
in_int_p_Sq [lemma, in Coq.Arith.Between]
in_int_lt [lemma, in Coq.Arith.Between]
in_int_intro [lemma, in Coq.Arith.Between]
in_int [definition, in Coq.Arith.Between]
In_InfA [lemma, in Coq.Lists.SetoidList]
In_InA [lemma, in Coq.Lists.SetoidList]
in_right [abbreviation, in Coq.Program.Utils]
in_left [abbreviation, in Coq.Program.Utils]
in_int [definition, in Coq.Reals.Ratan]
IN.Empty [definition, in Coq.MSets.MSetInterface]
IN.Equal [definition, in Coq.MSets.MSetInterface]
IN.In [axiom, in Coq.MSets.MSetInterface]
IN.In_compat [instance, in Coq.MSets.MSetInterface]
IN.t [axiom, in Coq.MSets.MSetInterface]
iota [definition, in Coq.Logic.ClassicalDescription]
iota [definition, in Coq.Logic.Epsilon]
IotaStatement [abbreviation, in Coq.Logic.ChoiceFacts]
IotaStatement_on [definition, in Coq.Logic.ChoiceFacts]
iota_spec [definition, in Coq.Logic.ClassicalDescription]
iota_imp_constructive_definite_description [lemma, in Coq.Logic.ChoiceFacts]
iota_spec [definition, in Coq.Logic.Epsilon]
iota_statement [lemma, in Coq.Logic.Epsilon]
Irreflexive [record, in Coq.Classes.RelationClasses]
Irreflexive [inductive, in Coq.Classes.RelationClasses]
irreflexivity [projection, in Coq.Classes.RelationClasses]
irreflexivity [constructor, in Coq.Classes.RelationClasses]
IsAddSubMul [module, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.add_succ_l [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.add_0_l [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.add_wd [instance, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.mul_succ_l [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.mul_0_l [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.mul_wd [instance, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.sub_succ_r [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.sub_0_r [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsAddSubMul.sub_wd [instance, in Coq.Numbers.NatInt.NZAxioms]
IsEq [module, in Coq.Structures.Equalities]
IsEqOrig [module, in Coq.Structures.Equalities]
IsEqOrig.eq_trans [axiom, in Coq.Structures.Equalities]
IsEqOrig.eq_sym [axiom, in Coq.Structures.Equalities]
IsEqOrig.eq_refl [axiom, in Coq.Structures.Equalities]
Isequence [section, in Coq.Reals.Rseries]
Isequence.An [variable, in Coq.Reals.Rseries]
IsEq.eq_equiv [instance, in Coq.Structures.Equalities]
IsNeg [abbreviation, in Coq.PArith.BinPos]
IsNul [abbreviation, in Coq.PArith.BinPos]
IsNZDomain [module, in Coq.Numbers.NatInt.NZAxioms]
IsNZDomain.bi_induction [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsNZDomain.pred_succ [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsNZDomain.pred_wd [instance, in Coq.Numbers.NatInt.NZAxioms]
IsNZDomain.succ_wd [instance, in Coq.Numbers.NatInt.NZAxioms]
IsNZOrd [module, in Coq.Numbers.NatInt.NZAxioms]
IsNZOrd.lt_succ_r [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsNZOrd.lt_irrefl [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsNZOrd.lt_eq_cases [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsNZOrd.lt_wd [instance, in Coq.Numbers.NatInt.NZAxioms]
isometric_trans_rot [lemma, in Coq.Reals.Rgeom]
isometric_rot_trans [lemma, in Coq.Reals.Rgeom]
isometric_rotation [lemma, in Coq.Reals.Rgeom]
isometric_rotation_0 [lemma, in Coq.Reals.Rgeom]
isometric_translation [lemma, in Coq.Reals.Rgeom]
Isomorphism [module, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.Hom12 [module, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.Hom21 [module, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.h12 [abbreviation, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.h21 [abbreviation, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.Inverse12 [module, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.Inverse21 [module, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.isomorphism [definition, in Coq.Numbers.Natural.Abstract.NIso]
Isomorphism.iso_nat_iso [lemma, in Coq.Numbers.Natural.Abstract.NIso]
IsOneTwo [module, in Coq.Numbers.NatInt.NZAxioms]
IsOneTwo.one_succ [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsOneTwo.two_succ [axiom, in Coq.Numbers.NatInt.NZAxioms]
IsOpp [module, in Coq.Numbers.Integer.Abstract.ZAxioms]
IsOpp.opp_succ [axiom, in Coq.Numbers.Integer.Abstract.ZAxioms]
IsOpp.opp_0 [axiom, in Coq.Numbers.Integer.Abstract.ZAxioms]
IsOpp.opp_wd [instance, in Coq.Numbers.Integer.Abstract.ZAxioms]
IsPos [abbreviation, in Coq.PArith.BinPos]
IsStepFun [definition, in Coq.Reals.RiemannInt_SF]
IsStrOrder [module, in Coq.Structures.Orders]
IsStrOrder.lt_compat [instance, in Coq.Structures.Orders]
IsStrOrder.lt_strorder [instance, in Coq.Structures.Orders]
IsSucc [definition, in Coq.Init.Peano]
IsTotalOrder [module, in Coq.Structures.OrdersTac]
iszero [definition, in Coq.Numbers.Cyclic.Int31.Int31]
iszero_not_eq0 [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
iszero_eq0 [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
is_true [definition, in Coq.Init.Datatypes]
is_eq_true [constructor, in Coq.Init.Datatypes]
is_inverse [definition, in Coq.Logic.ExtensionalityFacts]
is_eq [definition, in Coq.Lists.StreamMemo]
is_one_one [lemma, in Coq.Numbers.Natural.BigN.Nbasic]
is_one [definition, in Coq.Numbers.Natural.BigN.Nbasic]
Is_power_or [lemma, in Coq.ZArith.Zlogarithm]
Is_power_correct [lemma, in Coq.ZArith.Zlogarithm]
Is_power [definition, in Coq.ZArith.Zlogarithm]
is_subrelation [projection, in Coq.Classes.RelationClasses]
is_subrelation [constructor, in Coq.Classes.RelationClasses]
is_heap_rec [lemma, in Coq.Sorting.Heap]
is_heap_rect [lemma, in Coq.Sorting.Heap]
is_heap [inductive, in Coq.Sorting.Heap]
Is_true_eq_true2 [abbreviation, in Coq.Bool.Bool]
Is_true_eq_right [lemma, in Coq.Bool.Bool]
Is_true_eq_left [lemma, in Coq.Bool.Bool]
Is_true_eq_true [lemma, in Coq.Bool.Bool]
Is_true [definition, in Coq.Bool.Bool]
is_even [definition, in Coq.Numbers.Cyclic.ZModulo.ZModulo]
is_lub_u [lemma, in Coq.Reals.Rtopology]
is_subdivision [definition, in Coq.Reals.RiemannInt_SF]
is_lub [definition, in Coq.Reals.Raxioms]
is_upper_bound [definition, in Coq.Reals.Raxioms]
iter [abbreviation, in Coq.ZArith.Zmisc]
ITERATORS [section, in Coq.Vectors.VectorDef]
iter_pos_invariant [abbreviation, in Coq.PArith.BinPos]
iter_pos_plus [abbreviation, in Coq.PArith.BinPos]
iter_pos_succ [abbreviation, in Coq.PArith.BinPos]
iter_pos_swap [abbreviation, in Coq.PArith.BinPos]
iter_pos_swap_gen [abbreviation, in Coq.PArith.BinPos]
iter_pos [abbreviation, in Coq.PArith.BinPos]
iter_int31_iter_nat [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
iter_nat_of_P [abbreviation, in Coq.PArith.Pnat]
iter_nat_of_Z [lemma, in Coq.ZArith.Zmisc]
iter_int31 [definition, in Coq.Numbers.Cyclic.Int31.Int31]
iter_nat_invariant [abbreviation, in Coq.Arith.Wf_nat]
iter_nat_plus [abbreviation, in Coq.Arith.Wf_nat]
iter_nat [abbreviation, in Coq.Arith.Wf_nat]
iter31_sqrt_correct [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
iter31_sqrt [definition, in Coq.Numbers.Cyclic.Int31.Int31]
iter312_sqrt_correct [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
iter312_sqrt [definition, in Coq.Numbers.Cyclic.Int31.Int31]
IVT [lemma, in Coq.Reals.Rsqrt_def]
IVT_interv [lemma, in Coq.Reals.Ranalysis5]
IVT_interv_prelim1 [lemma, in Coq.Reals.Ranalysis5]
IVT_interv_prelim0 [lemma, in Coq.Reals.Ranalysis5]
IVT_cor [lemma, in Coq.Reals.Rsqrt_def]
IZN [lemma, in Coq.Reals.RIneq]
IZN_var [lemma, in Coq.Reals.RiemannInt_SF]
IZR [definition, in Coq.Reals.Raxioms]
IZR_nz [lemma, in Coq.QArith.Qreals]
IZR_lt [lemma, in Coq.Reals.RIneq]
IZR_le [lemma, in Coq.Reals.RIneq]
IZR_ge [lemma, in Coq.Reals.RIneq]
IZR_neq [lemma, in Coq.Reals.DiscrR]
IZR_eq [lemma, in Coq.Reals.DiscrR]
i2 [projection, in Coq.Logic.Berardi]
i2l [definition, in Coq.Numbers.Cyclic.Int31.Cyclic31]
i2l_nshiftl [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
i2l_l2i [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
i2l_sneakl [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
i2l_sneakr [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
i2l_length [lemma, in Coq.Numbers.Cyclic.Int31.Cyclic31]
I31 [constructor, in Coq.Numbers.Cyclic.Int31.Int31]

Global Index

(18818 entries)

Instance Index

G

J

V

X

Y

_

other

(548 entries)

Projection Index

G

H

K

L

V

X

Y

_

other

(206 entries)

Record Index

G

J

K

L

V

X

Y

_

other

(68 entries)

Lemma Index

Y

other

(8939 entries)

Section Index

H

J

Q

X

Y

_

other

(338 entries)

Constructor Index

K

V

Y

_

other

(422 entries)

Notation Index

F

J

K

T

U

X

Y

_

(644 entries)

Abbreviation Index

J

V

Y

_

other

(1243 entries)

Inductive Index

K

Q

V

X

Y

_

other

(209 entries)

Definition Index

J

_

other

(2935 entries)

Module Index

J

X

Y

_

other

(703 entries)

Axiom Index

K

V

X

Y

_

other

(699 entries)

Variable Index

H

J

Q

V

X

Y

_

other

(1456 entries)

Library Index

K

X

Y

_

other

(408 entries)