Standard Library | The Coq Proof Assistant

Global Index

(25958 entries)

Notation Index

F

J

K

T

X

Y

_

(999 entries)

Module Index

J

X

Y

_

other

(811 entries)

Variable Index

J

Q

V

X

Y

_

other

(1769 entries)

Library Index

K

X

Y

_

other

(587 entries)

Lemma Index

other

(11879 entries)

Constructor Index

K

Y

_

other

(960 entries)

Axiom Index

J

K

V

X

Y

_

other

(508 entries)

Inductive Index

X

Y

_

other

(307 entries)

Projection Index

G

K

X

Y

_

other

(479 entries)

Section Index

J

Q

X

Y

_

other

(495 entries)

Instance Index

J

V

X

Y

_

other

(905 entries)

Abbreviation Index

J

Y

_

other

(1199 entries)

Definition Index

_

other

(4894 entries)

Record Index

J

X

Y

_

other

(166 entries)

G

g [definition, in Coq.Logic.Berardi]
Gauss [lemma, in Coq.ZArith.Znumtheory]
gcd [definition, in Coq.Init.Nat]
Gcd [module, in Coq.Numbers.NatInt.NZGcd]
gcd [definition, in Coq.Numbers.Cyclic.Int63.Uint63]
gcd_spec [lemma, in Coq.Numbers.Cyclic.Int63.Uint63]
gcd_rec [definition, in Coq.Numbers.Cyclic.Int63.Uint63]
Gcd.gcd [axiom, in Coq.Numbers.NatInt.NZGcd]
ge [definition, in Coq.Init.Peano]
gen [lemma, in Coq.Init.Logic]
genCuttingPlane [definition, in Coq.micromega.ZMicromega]
genCuttingPlaneNone [lemma, in Coq.micromega.ZMicromega]
GeneralizedSetoidFunctionalChoice [abbreviation, in Coq.Logic.ChoiceFacts]
GeneralizedSetoidFunctionalChoice_on [definition, in Coq.Logic.ChoiceFacts]
Generalized_induction_on_finite_sets [lemma, in Coq.Sets.Finite_sets_facts]
generalized_excluded_middle [definition, in Coq.Logic.ClassicalFacts]
Generic [section, in Coq.Logic.Classical_Pred_Type]
Generic [module, in Coq.Logic.Hurkens]
GenericAbs [module, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericAbs.abs [definition, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericAbs.abs_neq [lemma, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericAbs.abs_eq [lemma, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericInstances [section, in Coq.Classes.Morphisms]
GenericInstances [section, in Coq.Classes.CMorphisms]
GenericInstances.A [variable, in Coq.Classes.Morphisms]
GenericInstances.B [variable, in Coq.Classes.Morphisms]
GenericInstances.C [variable, in Coq.Classes.Morphisms]
GenericInstances.U [variable, in Coq.Classes.Morphisms]
GenericMinMax [module, in Coq.Structures.GenericMinMax]
GenericMinMax [library]
GenericMinMax.ge_not_lt [lemma, in Coq.Structures.GenericMinMax]
GenericMinMax.max [definition, in Coq.Structures.GenericMinMax]
GenericMinMax.max_r [lemma, in Coq.Structures.GenericMinMax]
GenericMinMax.max_l [lemma, in Coq.Structures.GenericMinMax]
GenericMinMax.min [definition, in Coq.Structures.GenericMinMax]
GenericMinMax.min_r [lemma, in Coq.Structures.GenericMinMax]
GenericMinMax.min_l [lemma, in Coq.Structures.GenericMinMax]
GenericSgn [module, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericSgn.sgn [definition, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericSgn.sgn_neg [lemma, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericSgn.sgn_pos [lemma, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
GenericSgn.sgn_null [lemma, in Coq.Numbers.Integer.Abstract.ZSgnAbs]
Generic.I [definition, in Coq.Logic.Hurkens]
Generic.induct [definition, in Coq.Logic.Hurkens]
Generic.le [definition, in Coq.Logic.Hurkens]
Generic.lemma1 [lemma, in Coq.Logic.Hurkens]
Generic.lemma2 [lemma, in Coq.Logic.Hurkens]
Generic.le' [definition, in Coq.Logic.Hurkens]
Generic.Omega [lemma, in Coq.Logic.Hurkens]
Generic.paradox [lemma, in Coq.Logic.Hurkens]
Generic.Paradox [section, in Coq.Logic.Hurkens]
Generic.Paradox.appU0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.appU1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.app0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.app1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.betaU1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.beta1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.El0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.El1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.F [variable, in Coq.Logic.Hurkens]
Generic.Paradox.ForallU0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.ForallU1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.Forall0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.Forall1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.lamU0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.lamU1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.lam0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.lam1 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.u0 [variable, in Coq.Logic.Hurkens]
Generic.Paradox.U1 [variable, in Coq.Logic.Hurkens]
_ ·₀ [ _ ] [notation, in Coq.Logic.Hurkens]
_ ·₀ _ [notation, in Coq.Logic.Hurkens]
_ ⟶₀ _ [notation, in Coq.Logic.Hurkens]
_ ·₁ [ _ ] [notation, in Coq.Logic.Hurkens]
_ ·₁ _ [notation, in Coq.Logic.Hurkens]
_ ⟶₁ _ [notation, in Coq.Logic.Hurkens]
λ₀ _ , _ [notation, in Coq.Logic.Hurkens]
λ₀¹ _ , _ [notation, in Coq.Logic.Hurkens]
λ₁ _ , _ [notation, in Coq.Logic.Hurkens]
λ₂ _ , _ [notation, in Coq.Logic.Hurkens]
∀₀ _ : _ , _ [notation, in Coq.Logic.Hurkens]
∀₀¹ _ : _ , _ [notation, in Coq.Logic.Hurkens]
∀₁ _ : _ , _ [notation, in Coq.Logic.Hurkens]
∀₂ _ , _ [notation, in Coq.Logic.Hurkens]
Generic.sb [definition, in Coq.Logic.Hurkens]
Generic.U [variable, in Coq.Logic.Classical_Pred_Type]
Generic.U [definition, in Coq.Logic.Hurkens]
Generic.U0 [abbreviation, in Coq.Logic.Hurkens]
Generic.V [definition, in Coq.Logic.Hurkens]
Generic.WF [definition, in Coq.Logic.Hurkens]
gen_phiZ_morph [instance, in Coq.setoid_ring.Ncring_initial]
gen_phiZ_ext [lemma, in Coq.setoid_ring.Ncring_initial]
gen_phiZ_mul [lemma, in Coq.setoid_ring.Ncring_initial]
gen_phiZ_opp [lemma, in Coq.setoid_ring.Ncring_initial]
gen_phiZ_add [lemma, in Coq.setoid_ring.Ncring_initial]
gen_phiZ1_add_pos_neg [lemma, in Coq.setoid_ring.Ncring_initial]
gen_Zeqb_ok [lemma, in Coq.setoid_ring.Ncring_initial]
gen_phiZ [definition, in Coq.setoid_ring.Ncring_initial]
gen_phiZ1 [definition, in Coq.setoid_ring.Ncring_initial]
gen_phiPOS [definition, in Coq.setoid_ring.Ncring_initial]
gen_phiPOS1 [definition, in Coq.setoid_ring.Ncring_initial]
gen_setoid_fun_choice_imp_setoid_fun_choice [lemma, in Coq.Logic.ChoiceFacts]
gen_phiZ_complete [lemma, in Coq.setoid_ring.Field_theory]
gen_phiZ_inj [lemma, in Coq.setoid_ring.Field_theory]
gen_phiPOS_discr_sgn [lemma, in Coq.setoid_ring.Field_theory]
gen_phiN_complete [lemma, in Coq.setoid_ring.Field_theory]
gen_phiN_inj [lemma, in Coq.setoid_ring.Field_theory]
gen_phiPOS_inj [lemma, in Coq.setoid_ring.Field_theory]
GEN_DIV.nphi [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.zphi [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.morph [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.ARth [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.Reqe [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.Rsth [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.phi [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.ceqb [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.copp [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.csub [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.cmul [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.cadd [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.cI [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.cO [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.C [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.req [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.ropp [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.rsub [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.rmul [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.radd [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.rI [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.rO [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV.R [variable, in Coq.setoid_ring.InitialRing]
GEN_DIV [section, in Coq.setoid_ring.InitialRing]
gen_phiNword_morph [lemma, in Coq.setoid_ring.InitialRing]
gen_phiNword_ok [lemma, in Coq.setoid_ring.InitialRing]
gen_phiNword_Nwcons [lemma, in Coq.setoid_ring.InitialRing]
gen_phiNword_cons [lemma, in Coq.setoid_ring.InitialRing]
gen_phiNword0_ok [lemma, in Coq.setoid_ring.InitialRing]
gen_phiNword [definition, in Coq.setoid_ring.InitialRing]
gen_phiN_morph [lemma, in Coq.setoid_ring.InitialRing]
gen_phiN_sub [lemma, in Coq.setoid_ring.InitialRing]
gen_phiN_mult [lemma, in Coq.setoid_ring.InitialRing]
gen_phiN_add [lemma, in Coq.setoid_ring.InitialRing]
gen_phiN [definition, in Coq.setoid_ring.InitialRing]
gen_phiN1 [definition, in Coq.setoid_ring.InitialRing]
gen_phiZ_morph [lemma, in Coq.setoid_ring.InitialRing]
gen_phiZ_ext [lemma, in Coq.setoid_ring.InitialRing]
gen_phiZ_mul [lemma, in Coq.setoid_ring.InitialRing]
gen_phiZ_add [lemma, in Coq.setoid_ring.InitialRing]
gen_phiZ1_pos_sub [lemma, in Coq.setoid_ring.InitialRing]
gen_Zeqb_ok [lemma, in Coq.setoid_ring.InitialRing]
gen_phiZ [definition, in Coq.setoid_ring.InitialRing]
gen_phiZ1 [definition, in Coq.setoid_ring.InitialRing]
gen_phiPOS [definition, in Coq.setoid_ring.InitialRing]
gen_phiPOS1 [definition, in Coq.setoid_ring.InitialRing]
gen_st [definition, in Coq.Setoids.Setoid]
gen_order_phi_Z [definition, in Coq.micromega.ZCoeff]
GeoCvZero [lemma, in Coq.Reals.Abstract.ConstructivePower]
GeoFiniteSum [lemma, in Coq.Reals.Abstract.ConstructivePower]
GeoHalfBelowTwo [lemma, in Coq.Reals.Abstract.ConstructivePower]
GeoHalfTwo [lemma, in Coq.Reals.Abstract.ConstructivePower]
get [definition, in Coq.Strings.String]
get [axiom, in Coq.Array.PArray]
get [definition, in Coq.rtauto.Bintree]
get [axiom, in Coq.Strings.PrimString]
get_signZ [definition, in Coq.setoid_ring.Ncring_initial]
get_PEopp [definition, in Coq.setoid_ring.Ring_polynom]
get_sign [definition, in Coq.Floats.PrimFloat]
get_correct [lemma, in Coq.Strings.String]
get_PEopp [definition, in Coq.micromega.EnvRing]
get_signZ_th [lemma, in Coq.setoid_ring.InitialRing]
get_signZ [definition, in Coq.setoid_ring.InitialRing]
get_not_default_lt [lemma, in Coq.Array.PArray]
get_set_same_default [lemma, in Coq.Array.PArray]
get_copy [axiom, in Coq.Array.PArray]
get_make [axiom, in Coq.Array.PArray]
get_set_other [axiom, in Coq.Array.PArray]
get_set_same [axiom, in Coq.Array.PArray]
get_out_of_bounds [axiom, in Coq.Array.PArray]
get_char63_valid [lemma, in Coq.Strings.PString]
get_spec_not_in_bounds [lemma, in Coq.Strings.PString]
get_spec_in_bounds [lemma, in Coq.Strings.PString]
get_map [lemma, in Coq.rtauto.Bintree]
get_In [lemma, in Coq.rtauto.Bintree]
get_push_Full [lemma, in Coq.rtauto.Bintree]
get_Full_Eq [lemma, in Coq.rtauto.Bintree]
get_Full_Gt [lemma, in Coq.rtauto.Bintree]
get_empty [lemma, in Coq.rtauto.Bintree]
get_sign_None_th [lemma, in Coq.setoid_ring.Ring_theory]
get_sign_None [definition, in Coq.setoid_ring.Ring_theory]
get_spec [axiom, in Coq.Strings.PrimStringAxioms]
get_digit [definition, in Coq.Numbers.Cyclic.Int63.Uint63]
ge_bool_cases [lemma, in Coq.micromega.RingMicromega]
ge_bool [definition, in Coq.micromega.RingMicromega]
ge_dec [lemma, in Coq.Arith.Compare_dec]
GFormula [inductive, in Coq.micromega.Tauto]
GFormula_sind [definition, in Coq.micromega.Tauto]
GFormula_rec [definition, in Coq.micromega.Tauto]
GFormula_ind [definition, in Coq.micromega.Tauto]
GFormula_rect [definition, in Coq.micromega.Tauto]
Glb [inductive, in Coq.Sets.Cpo]
glb [definition, in Coq.Reals.SeqProp]
glb_dec_Q [lemma, in Coq.Reals.Abstract.ConstructiveLUB]
Glb_sind [definition, in Coq.Sets.Cpo]
Glb_rec [definition, in Coq.Sets.Cpo]
Glb_ind [definition, in Coq.Sets.Cpo]
Glb_rect [definition, in Coq.Sets.Cpo]
Glb_definition [constructor, in Coq.Sets.Cpo]
gmax [definition, in Coq.Structures.GenericMinMax]
gmin [definition, in Coq.Structures.GenericMinMax]
GodelDummett [definition, in Coq.Logic.ClassicalFacts]
Godel_Dummett_weak_excluded_middle [lemma, in Coq.Logic.ClassicalFacts]
Godel_Dummett_iff_right_distr_implication_over_disjunction [lemma, in Coq.Logic.ClassicalFacts]
GP_finite [lemma, in Coq.Reals.Rfunctions]
GP_infinite [lemma, in Coq.Reals.Rseries]
growing_prop [lemma, in Coq.Reals.Rseries]
growing_ineq [lemma, in Coq.Reals.Abstract.ConstructiveLimits]
growing_ineq [lemma, in Coq.Reals.SeqProp]
growing_cv [lemma, in Coq.Reals.SeqProp]
gt [definition, in Coq.Init.Peano]
GT [record, in Coq.micromega.DeclConstant]
GT [constructor, in Coq.Structures.OrderedType]
Gt [constructor, in Coq.Init.Datatypes]
gtof [definition, in Coq.Arith.Wf_nat]
gt_dec [lemma, in Coq.Arith.Compare_dec]
gt_eq_gt_dec [definition, in Coq.Arith.Compare_dec]
gt_wf_ind [lemma, in Coq.Arith.Wf_nat]
gt_wf_rec [lemma, in Coq.Arith.Wf_nat]
gt_wf_rect [lemma, in Coq.Arith.Wf_nat]
Gt_Psucc [lemma, in Coq.rtauto.Bintree]
GT_APP2 [instance, in Coq.micromega.DeclConstant]
GT_APP1 [instance, in Coq.micromega.DeclConstant]
GT_O [instance, in Coq.micromega.DeclConstant]
gt_le_trans_stt [definition, in Coq.Arith.Arith_base]
gt_trans_S_stt [definition, in Coq.Arith.Arith_base]
gt_le_S_stt [definition, in Coq.Arith.Arith_base]
gt_S_le_stt [definition, in Coq.Arith.Arith_base]
gt_not_le_stt [definition, in Coq.Arith.Arith_base]
gt_asym_stt [definition, in Coq.Arith.Arith_base]
gt_irrefl_stt [definition, in Coq.Arith.Arith_base]
gt_pred_stt [definition, in Coq.Arith.Arith_base]
gt_S_n_stt [definition, in Coq.Arith.Arith_base]
gt_n_S_stt [definition, in Coq.Arith.Arith_base]
gt_Sn_n_stt [definition, in Coq.Arith.Arith_base]
gt_Sn_O_stt [definition, in Coq.Arith.Arith_base]
GuardedFunctionalChoice [abbreviation, in Coq.Logic.ChoiceFacts]
GuardedFunctionalChoice_on [definition, in Coq.Logic.ChoiceFacts]
GuardedFunctionalRelReification [abbreviation, in Coq.Logic.ChoiceFacts]
GuardedFunctionalRelReification_on [definition, in Coq.Logic.ChoiceFacts]
GuardedRelationalChoice [abbreviation, in Coq.Logic.ChoiceFacts]
GuardedRelationalChoice_on [definition, in Coq.Logic.ChoiceFacts]
guarded_iff_omniscient_fun_choice [lemma, in Coq.Logic.ChoiceFacts]
guarded_fun_choice_imp_fun_choice [lemma, in Coq.Logic.ChoiceFacts]
guarded_fun_choice_imp_indep_of_general_premises [lemma, in Coq.Logic.ChoiceFacts]
guarded_iff_omniscient_rel_choice [lemma, in Coq.Logic.ChoiceFacts]
guarded_rel_choice_imp_rel_choice [lemma, in Coq.Logic.ChoiceFacts]
guarded_rel_choice [lemma, in Coq.Logic.Diaconescu]
g_adjoint [definition, in Coq.Logic.Adjointification]

Global Index

(25958 entries)

Notation Index

F

J

K

T

X

Y

_

(999 entries)

Module Index

J

X

Y

_

other

(811 entries)

Variable Index

J

Q

V

X

Y

_

other

(1769 entries)

Library Index

K

X

Y

_

other

(587 entries)

Lemma Index

other

(11879 entries)

Constructor Index

K

Y

_

other

(960 entries)

Axiom Index

J

K

V

X

Y

_

other

(508 entries)

Inductive Index

X

Y

_

other

(307 entries)

Projection Index

G

K

X

Y

_

other

(479 entries)

Section Index

J

Q

X

Y

_

other

(495 entries)

Instance Index

J

V

X

Y

_

other

(905 entries)

Abbreviation Index

J

Y

_

other

(1199 entries)

Definition Index

_

other

(4894 entries)

Record Index

J

X

Y

_

other

(166 entries)