I (lemma)
idempot_rev [in Coq.Lists.PolyList]
ifdec_left [in Coq.Bool.DecBool]
ifdec_right [in Coq.Bool.DecBool]
Iffalse_inv [in Coq.Bool.IfProp]
iff_refl [in Coq.Init.Logic]
iff_sym [in Coq.Init.Logic]
iff_trans [in Coq.Init.Logic]
IfProp_false [in Coq.Bool.IfProp]
IfProp_or [in Coq.Bool.IfProp]
IfProp_sum [in Coq.Bool.IfProp]
IfProp_true [in Coq.Bool.IfProp]
Iftrue_inv [in Coq.Bool.IfProp]
if_negb [in Coq.Bool.Bool]
image_empty [in Coq.Sets.Image]
Image_set_continuous [in Coq.Sets.Infinite_sets]
Image_set_continuous' [in Coq.Sets.Infinite_sets]
imply_and_or [in Coq.Logic.Classical_Prop]
imply_and_or2 [in Coq.Logic.Classical_Prop]
imply_to_and [in Coq.Logic.Classical_Prop]
imply_to_or [in Coq.Logic.Classical_Prop]
imp_not_Req [in Coq.Reals.Rbase]
imp_simp [in Coq.Logic.Decidable]
Im_add [in Coq.Sets.Image]
Im_def [in Coq.Sets.Image]
Im_inv [in Coq.Sets.Image]
Included_Add [in Coq.Sets.Powerset_Classical_facts]
Included_Empty [in Coq.Sets.Constructive_sets]
Included_Strict_Included [in Coq.Sets.Classical_sets]
Inclusion_is_an_order [in Coq.Sets.Powerset]
Inclusion_is_transitive [in Coq.Sets.Powerset]
incl_add [in Coq.Sets.Powerset_facts]
incl_add_x [in Coq.Sets.Powerset_facts]
incl_app [in Coq.Lists.PolyList]
incl_app [in Coq.Lists.List]
incl_appl [in Coq.Lists.PolyList]
incl_appl [in Coq.Lists.List]
incl_appr [in Coq.Lists.PolyList]
incl_appr [in Coq.Lists.List]
incl_card_le [in Coq.Sets.Finite_sets_facts]
incl_clos_trans [in Coq.Wellfounded.Transitive_Closure]
incl_cons [in Coq.Lists.PolyList]
incl_cons [in Coq.Lists.List]
incl_left [in Coq.Sets.Uniset]
incl_refl [in Coq.Lists.PolyList]
incl_refl [in Coq.Lists.List]
incl_right [in Coq.Sets.Uniset]
incl_soustr [in Coq.Sets.Powerset_Classical_facts]
incl_soustr_add_l [in Coq.Sets.Powerset_Classical_facts]
incl_soustr_add_r [in Coq.Sets.Powerset_Classical_facts]
incl_soustr_in [in Coq.Sets.Powerset_Classical_facts]
incl_st_add_soustr [in Coq.Sets.Powerset_Classical_facts]
incl_st_card_lt [in Coq.Sets.Finite_sets_facts]
incl_tl [in Coq.Lists.PolyList]
incl_tl [in Coq.Lists.List]
incl_tran [in Coq.Lists.PolyList]
incl_tran [in Coq.Lists.List]
increasing_decreasing [in Coq.Reals.Ranalysis]
increasing_decreasing_opp [in Coq.Reals.Ranalysis]
Index [in Coq.Lists.TheoryList]
Index_p [in Coq.Lists.TheoryList]
induction_gtof1 [in Coq.Arith.Wf_nat]
induction_gtof2 [in Coq.Arith.Wf_nat]
induction_ltof1 [in Coq.Arith.Wf_nat]
induction_ltof2 [in Coq.Arith.Wf_nat]
Ind_proof [in Coq.Relations.Newman]
ind_0_1_SS [in Coq.Arith.Div2]
Inhabited_add [in Coq.Sets.Constructive_sets]
Inhabited_not_empty [in Coq.Sets.Constructive_sets]
Inhabited_Setminus [in Coq.Sets.Classical_sets]
inh_card_gt_O [in Coq.Sets.Finite_sets_facts]
injective_preserves_cardinal [in Coq.Sets.Image]
inject_nat_complete [in Coq.ZArith.Wf_Z]
inject_nat_complete_inf [in Coq.ZArith.Wf_Z]
inject_nat_prop [in Coq.ZArith.Wf_Z]
inject_nat_set [in Coq.ZArith.Wf_Z]
inj_eq [in Coq.ZArith.auxiliary]
inj_ge [in Coq.ZArith.auxiliary]
inj_gt [in Coq.ZArith.auxiliary]
inj_le [in Coq.ZArith.auxiliary]
inj_lt [in Coq.ZArith.auxiliary]
inj_minus1 [in Coq.ZArith.auxiliary]
inj_minus2 [in Coq.ZArith.auxiliary]
inj_minus_aux [in Coq.Arith.Minus]
inj_mult [in Coq.ZArith.auxiliary]
inj_neq [in Coq.ZArith.auxiliary]
inj_pair2 [in Coq.Logic.Eqdep]
inj_plus [in Coq.ZArith.auxiliary]
inj_right_pair [in Coq.Logic.Eqdep_dec]
inj_S [in Coq.ZArith.auxiliary]
InR_app_or [in Coq.Lists.TheoryList]
InR_cons_inv [in Coq.Lists.TheoryList]
INR_eq [in Coq.Reals.Rbase]
INR_eq_INR2 [in Coq.Reals.Rbase]
INR_fact_neq_0 [in Coq.Reals.Rfunctions]
InR_INV [in Coq.Lists.TheoryList]
INR_IZR_INZ [in Coq.Reals.Rbase]
INR_le [in Coq.Reals.Rbase]
INR_lt [in Coq.Reals.Rbase]
INR_lt_1 [in Coq.Reals.Rbase]
InR_or_app [in Coq.Lists.TheoryList]
INR_pos [in Coq.Reals.Rbase]
insert [in Coq.Sorting.Heap]
inser_trans_R [in Coq.Reals.Rbase]
inst [in Coq.Init.Logic_Type]
Integers_has_no_ub [in Coq.Sets.Integers]
Integers_infinite [in Coq.Sets.Integers]
Intersection_commutative [in Coq.Sets.Powerset_facts]
Intersection_decreases_l [in Coq.Sets.Powerset]
Intersection_decreases_r [in Coq.Sets.Powerset]
Intersection_inv [in Coq.Sets.Constructive_sets]
Intersection_is_Glb [in Coq.Sets.Powerset]
Intersection_maximal [in Coq.Sets.Powerset]
Intersection_preserves_finite [in Coq.Sets.Finite_sets_facts]
interval_split [in Coq.IntMap.Lsort]
intro_Z [in Coq.ZArith.auxiliary]
Int_part_INR [in Coq.Reals.R_Ifp]
inverse_image_of_eq [in Coq.Relations.Relations]
inverse_image_of_equivalence [in Coq.Relations.Relations]
invert_heap [in Coq.Sorting.Heap]
inv_continuity [in Coq.Reals.Ranalysis]
inv_continuous [in Coq.Reals.Ranalysis]
in_app_or [in Coq.Lists.List]
in_app_or [in Coq.Lists.PolyList]
in_cons [in Coq.Lists.PolyList]
in_cons [in Coq.Lists.List]
In_dec [in Coq.Lists.PolyList]
in_dom_delta [in Coq.IntMap.Fset]
in_dom_DMerge_1 [in Coq.IntMap.Mapfold]
in_dom_DMerge_2 [in Coq.IntMap.Mapfold]
in_dom_DMerge_3 [in Coq.IntMap.Mapfold]
in_dom_merge [in Coq.IntMap.Fset]
in_dom_M0 [in Coq.IntMap.Fset]
in_dom_M1 [in Coq.IntMap.Fset]
in_dom_M1_1 [in Coq.IntMap.Fset]
in_dom_M1_2 [in Coq.IntMap.Fset]
in_dom_none [in Coq.IntMap.Fset]
in_dom_put [in Coq.IntMap.Fset]
in_dom_put_behind [in Coq.IntMap.Fset]
in_dom_remove [in Coq.IntMap.Fset]
in_dom_restrby [in Coq.IntMap.Fset]
in_dom_restrto [in Coq.IntMap.Fset]
in_dom_some [in Coq.IntMap.Fset]
in_eq [in Coq.Lists.List]
in_eq [in Coq.Lists.PolyList]
in_FSet_delta [in Coq.IntMap.Fset]
in_FSet_diff [in Coq.IntMap.Fset]
in_FSet_inter [in Coq.IntMap.Fset]
in_FSet_union [in Coq.IntMap.Fset]
In_Image_elim [in Coq.Sets.Image]
in_int_between [in Coq.Arith.Between]
in_int_exists [in Coq.Arith.Between]
in_int_intro [in Coq.Arith.Between]
in_int_lt [in Coq.Arith.Between]
in_int_p_Sq [in Coq.Arith.Between]
in_int_S [in Coq.Arith.Between]
in_int_Sp_q [in Coq.Arith.Between]
in_inv [in Coq.Lists.PolyList]
In_In_spec [in Coq.Lists.TheoryList]
in_map [in Coq.Lists.PolyList]
in_nil [in Coq.Lists.PolyList]
in_or_app [in Coq.Lists.List]
in_or_app [in Coq.Lists.PolyList]
in_prod [in Coq.Lists.PolyList]
in_prod_aux [in Coq.Lists.PolyList]
Isnil_dec [in Coq.Lists.TheoryList]
Isnil_nil [in Coq.Lists.TheoryList]
isometric_rotation [in Coq.Reals.Rgeom]
isometric_rotation_0 [in Coq.Reals.Rgeom]
isometric_rot_trans [in Coq.Reals.Rgeom]
isometric_translation [in Coq.Reals.Rgeom]
isometric_trans_rot [in Coq.Reals.Rgeom]
is_double_moins_un [in Coq.ZArith.fast_integer]
is_heap_rec [in Coq.Sorting.Heap]
Is_power_correct [in Coq.ZArith.Zlogarithm]
Is_power_or [in Coq.ZArith.Zlogarithm]
Is_true_eq_left [in Coq.Bool.Bool]
Is_true_eq_right [in Coq.Bool.Bool]
Is_true_eq_true [in Coq.Bool.Bool]
Is_true_eq_true2 [in Coq.Bool.Bool]
Item [in Coq.Lists.TheoryList]
iter_convert [in Coq.ZArith.Zmisc]
iter_nat_invariant [in Coq.ZArith.Zmisc]
iter_nat_plus [in Coq.ZArith.Zmisc]
iter_pos_add [in Coq.ZArith.Zmisc]
iter_pos_invariant [in Coq.ZArith.Zmisc]
IZN [in Coq.Reals.Rbase]
IZR_ge [in Coq.Reals.Rbase]
IZR_le [in Coq.Reals.Rbase]
IZR_lt [in Coq.Reals.Rbase]