| Global Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (1072 entries) |
| Notation Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (22 entries) |
| Module Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (11 entries) |
| Library Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (17 entries) |
| Lemma Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (423 entries) |
| Constructor Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (123 entries) |
| Axiom Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (14 entries) |
| Inductive Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (42 entries) |
| Definition Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (420 entries) |
Global Index
A
A [constructor, in Basics]add [constructor, in Poly]
addn_preserves_sortedness [lemma, in Sort]
add_edit [definition, in Poly]
add_empty_optimal [lemma, in IndProp]
add_cost [lemma, in Tactics]
add_edit_valid [lemma, in Tactics]
add_edit [definition, in Tactics]
add1_preserves_sortedness [lemma, in Sort]
add2_preserves_sortedness [lemma, in Sort]
aglio_e_olio [constructor, in Combo]
Ala [constructor, in Poly]
alfredo [constructor, in Combo]
All [definition, in Logic]
All_In [lemma, in Logic]
all3_spec [lemma, in Induction]
andb [definition, in Basics]
andb_eq_orb [lemma, in Basics]
andb_true_elim2 [lemma, in Basics]
andb_commutative'' [lemma, in Basics]
andb_commutative' [lemma, in Basics]
andb_commutative [lemma, in Basics]
andb_true_iff [lemma, in Logic]
andb_false_r [lemma, in Induction]
andb3 [definition, in Basics]
andb3_exchange [lemma, in Basics]
and_assoc [lemma, in Logic]
and_commut [lemma, in Logic]
and_example3 [lemma, in Logic]
and_example2'' [lemma, in Logic]
and_example2' [lemma, in Logic]
and_example2 [lemma, in Logic]
and_example' [definition, in Logic]
and_intro [lemma, in Logic]
and_example [definition, in Logic]
antisymmetric [definition, in Rel]
any [definition, in DNA]
any_eq__not_In [lemma, in DNA]
any_eq__In [lemma, in DNA]
app [definition, in Poly]
apply_iff_example [lemma, in Logic]
apply_edits [definition, in Poly]
apply_edit [definition, in Poly]
app_length [lemma, in Poly]
app_assoc [lemma, in Poly]
app_nil_r [lemma, in Poly]
Arg [constructor, in Poly]
argmin3 [definition, in Poly]
argmin3_leb [lemma, in IndProp]
argmin3_min [lemma, in IndProp]
argmin3_valid [lemma, in Tactics]
argmin3_min3 [lemma, in Tactics]
argmin3_min3_eqs [lemma, in Tactics]
Asn [constructor, in Poly]
Asp [constructor, in Poly]
AxiomaticSets [module, in Sets]
AxiomaticSets.bijective [definition, in Sets]
AxiomaticSets.binary_relation [definition, in Sets]
AxiomaticSets.bool_countable_inj [lemma, in Sets]
AxiomaticSets.bool_countable_surj [lemma, in Sets]
AxiomaticSets.bool_nat_cardinality [lemma, in Sets]
AxiomaticSets.bool_two_cardinality [lemma, in Sets]
AxiomaticSets.bool_inj__surj [lemma, in Sets]
AxiomaticSets.cartesian_product__total [lemma, in Sets]
AxiomaticSets.cartesian_product [definition, in Sets]
AxiomaticSets.codomain [definition, in Sets]
AxiomaticSets.column_b [constructor, in Sets]
AxiomaticSets.column_a [constructor, in Sets]
AxiomaticSets.Complement [definition, in Sets]
AxiomaticSets.complement_involutive [lemma, in Sets]
AxiomaticSets.compose [definition, in Sets]
AxiomaticSets.countable [definition, in Sets]
AxiomaticSets.de_morgan2 [lemma, in Sets]
AxiomaticSets.de_morgan [lemma, in Sets]
AxiomaticSets.diagonal_relation [definition, in Sets]
AxiomaticSets.Difference [definition, in Sets]
AxiomaticSets.domain [definition, in Sets]
AxiomaticSets.Empty [axiom, in Sets]
AxiomaticSets.empty_relation [definition, in Sets]
AxiomaticSets.empty_cartesian_identity_l [lemma, in Sets]
AxiomaticSets.empty_subset [lemma, in Sets]
AxiomaticSets.enigma [definition, in Sets]
AxiomaticSets.enigma_enigma_fun [lemma, in Sets]
AxiomaticSets.enigma_fun [definition, in Sets]
AxiomaticSets.enigma_not_total [lemma, in Sets]
AxiomaticSets.enigma_functional [lemma, in Sets]
AxiomaticSets.even_nats' [definition, in Sets]
AxiomaticSets.even_nats [definition, in Sets]
AxiomaticSets.extensionality [axiom, in Sets]
AxiomaticSets.functional [definition, in Sets]
AxiomaticSets.image [definition, in Sets]
AxiomaticSets.inclusion_exclusion [axiom, in Sets]
AxiomaticSets.infinitely_countable [definition, in Sets]
AxiomaticSets.injective [definition, in Sets]
AxiomaticSets.inj_composition [lemma, in Sets]
AxiomaticSets.Intersection [definition, in Sets]
AxiomaticSets.inverse_of [definition, in Sets]
AxiomaticSets.list_unit_infinitely_countable [lemma, in Sets]
AxiomaticSets.manual_grade_for_enigma_converse [definition, in Sets]
AxiomaticSets.Member [axiom, in Sets]
AxiomaticSets.member_cartesian [lemma, in Sets]
AxiomaticSets.member_complement [lemma, in Sets]
AxiomaticSets.member_difference [lemma, in Sets]
AxiomaticSets.member_intersection [lemma, in Sets]
AxiomaticSets.member_union [lemma, in Sets]
AxiomaticSets.member_singleton [lemma, in Sets]
AxiomaticSets.member_spec_P [axiom, in Sets]
AxiomaticSets.member_universe [axiom, in Sets]
AxiomaticSets.member_empty [axiom, in Sets]
AxiomaticSets.natopt_infinitely_countable [lemma, in Sets]
AxiomaticSets.nat_natfun_diag [lemma, in Sets]
AxiomaticSets.nat__list_unit [lemma, in Sets]
AxiomaticSets.nat_inj_not_surjective [lemma, in Sets]
AxiomaticSets.nat_inj_injective [lemma, in Sets]
AxiomaticSets.nat_inj [definition, in Sets]
AxiomaticSets.nat_natopt_bij_correct [lemma, in Sets]
AxiomaticSets.nat_natopt_bij [definition, in Sets]
AxiomaticSets.nat_natopt_inj_correct [lemma, in Sets]
AxiomaticSets.nat_natopt_inj [definition, in Sets]
AxiomaticSets.power_set [definition, in Sets]
AxiomaticSets.preimage [definition, in Sets]
AxiomaticSets.proper_subset [definition, in Sets]
AxiomaticSets.P_member_spec [axiom, in Sets]
AxiomaticSets.reflexive [definition, in Sets]
AxiomaticSets.related_in [definition, in Sets]
AxiomaticSets.same_cardinality [definition, in Sets]
AxiomaticSets.set [axiom, in Sets]
AxiomaticSets.set_powset_diag [lemma, in Sets]
AxiomaticSets.Singleton [definition, in Sets]
AxiomaticSets.Spec [axiom, in Sets]
AxiomaticSets.subset [definition, in Sets]
AxiomaticSets.subset_universe [lemma, in Sets]
AxiomaticSets.subset_eq [lemma, in Sets]
AxiomaticSets.subset_trans [lemma, in Sets]
AxiomaticSets.subset_refl [lemma, in Sets]
AxiomaticSets.surjective [definition, in Sets]
AxiomaticSets.surj_composition [lemma, in Sets]
AxiomaticSets.symmetric [definition, in Sets]
AxiomaticSets.ternary_relation [definition, in Sets]
AxiomaticSets.total [definition, in Sets]
AxiomaticSets.total_preimage_is_whole_domain [lemma, in Sets]
AxiomaticSets.total_relation [definition, in Sets]
AxiomaticSets.transitive [definition, in Sets]
AxiomaticSets.two [inductive, in Sets]
AxiomaticSets.unary_relation [definition, in Sets]
AxiomaticSets.Union [definition, in Sets]
AxiomaticSets.union_subset_r [lemma, in Sets]
AxiomaticSets.union_subset_l [lemma, in Sets]
AxiomaticSets.union_comm [lemma, in Sets]
AxiomaticSets.union_subset [lemma, in Sets]
AxiomaticSets.unit_bool_cardinality [lemma, in Sets]
AxiomaticSets.Universe [axiom, in Sets]
B
bad_function_breaks_sortedness [lemma, in Sort]bad_function [definition, in Sort]
bar [definition, in Tactics]
base [inductive, in Basics]
Basics [library]
beq_list_true_iff [lemma, in Logic]
beq_list [definition, in Logic]
Bib [library]
bin [inductive, in Induction]
binomial [lemma, in Combo]
binomial_three_to_the_n [lemma, in Combo]
binomial_x_plus_1 [lemma, in Combo]
binomial_two_to_the_n [lemma, in Combo]
bin_to_nat [definition, in Induction]
black [constructor, in Basics]
blt_nat [definition, in Basics]
blue [constructor, in Basics]
bool [inductive, in Basics]
boollist [inductive, in Poly]
bool_cons [constructor, in Poly]
bool_nil [constructor, in Poly]
bool_fn_applied_thrice [lemma, in Tactics]
BZ [constructor, in Induction]
C
C [constructor, in Basics]choose [definition, in Combo]
choose_swap [lemma, in Combo]
choose_fact [lemma, in Combo]
choose_pascal [lemma, in Combo]
choose_n_n [lemma, in Combo]
choose_n_lt_m [lemma, in Combo]
choose_n_0 [lemma, in Combo]
choose_two_of_six [definition, in Combo]
clos_refl_trans_1n [inductive, in Rel]
clos_refl_trans [inductive, in Rel]
codon [inductive, in Poly]
color [inductive, in Basics]
combine [definition, in Poly]
combine_odd_even_elim_even [lemma, in Logic]
combine_odd_even_elim_odd [lemma, in Logic]
combine_odd_even_intro [lemma, in Logic]
combine_odd_even [definition, in Logic]
combine_split [lemma, in Tactics]
Combo [library]
complement [definition, in Basics]
complementary [definition, in Poly]
complementary_complementary' [lemma, in Poly]
complementary' [definition, in Poly]
complement_involutive [lemma, in Basics]
complement_correct [lemma, in Poly]
cons [constructor, in Poly]
constfun [definition, in Poly]
constfun_example2 [definition, in Poly]
constfun_example1 [definition, in Poly]
cons' [constructor, in Poly]
contradiction_implies_anything [lemma, in Logic]
contrapositive [lemma, in Logic]
copy [constructor, in Poly]
copy_cost_0 [lemma, in Tactics]
copy_edit_valid [lemma, in Tactics]
copy_edit [definition, in Tactics]
cost [definition, in Poly]
countoddmembers' [definition, in Poly]
Cys [constructor, in Poly]
D
day [inductive, in Basics]delete [constructor, in Poly]
delete_add_edit [definition, in Poly]
delete_edit [definition, in Poly]
delete_empty_optimal [lemma, in IndProp]
delete_cost [lemma, in Tactics]
delete_add_valid [lemma, in Tactics]
delete_edit_valid [lemma, in Tactics]
delete_add_edit [definition, in Tactics]
delete_edit [definition, in Tactics]
de_morgan_not_and_not [definition, in Logic]
discriminate_ex3 [definition, in Tactics]
discriminate_ex2 [lemma, in Tactics]
discriminate_ex1 [lemma, in Tactics]
dist_exists_or [lemma, in Logic]
dist_not_exists [lemma, in Logic]
DNA [library]
dna_tgt3 [definition, in Poly]
dna_tgt2 [definition, in Poly]
dna_tgt1 [definition, in Poly]
dna_src [definition, in Poly]
doit3times [definition, in Poly]
double [definition, in Induction]
double_negation_elimination [definition, in Logic]
double_neg [lemma, in Logic]
double_plus [lemma, in Induction]
double_injective_take2 [lemma, in Tactics]
double_injective_take2_FAILED [lemma, in Tactics]
double_injective [lemma, in Tactics]
double_injective_FAILED [lemma, in Tactics]
driving [definition, in Combo]
E
edit [inductive, in Poly]edit_tgt3_valid [definition, in Poly]
edit_tgt3 [definition, in Poly]
edit_tgt2_valid [definition, in Poly]
edit_tgt2 [definition, in Poly]
edit_tgt1_same [definition, in Poly]
edit_tgt1_worse [definition, in Poly]
edit_tgt1 [definition, in Poly]
edit1_same [lemma, in Poly]
edit1_worse_actually_worse [lemma, in Poly]
empty_natset [definition, in Poly]
encode [definition, in Poly]
encode_eg2 [lemma, in Poly]
encode_eg1 [lemma, in Poly]
encode_rev_Ala [lemma, in Poly]
encode_one_eg3 [definition, in Poly]
encode_one_eg2 [definition, in Poly]
encode_one_eg1 [definition, in Poly]
encode_one [definition, in Poly]
eqb [definition, in Basics]
eqb_false_iff [lemma, in Logic]
eqb_true_iff [lemma, in Logic]
eqb_refl [lemma, in Induction]
eqb_trans [lemma, in Tactics]
eqb_sym [lemma, in Tactics]
eqb_true [lemma, in Tactics]
eqb_0_l [lemma, in Tactics]
equivalence [definition, in Rel]
eq_strand_iff [lemma, in Logic]
eq_base_iff [lemma, in Logic]
eq_codon [definition, in Poly]
eq_strand_refl [lemma, in Poly]
eq_strand [definition, in Poly]
eq_base_refl [lemma, in Poly]
eq_base [definition, in Poly]
eq_base_true [lemma, in Tactics]
eq_implies_succ_equal' [lemma, in Tactics]
eq_implies_succ_equal [lemma, in Tactics]
eq_codon_iff [lemma, in DNA]
eq_codon_sym [lemma, in DNA]
eq_codon_refl [lemma, in DNA]
ev [inductive, in IndProp]
evenb [definition, in Basics]
evenb_double_conv [lemma, in Logic]
evenb_double [lemma, in Logic]
evenb_S [lemma, in Induction]
evens_to_ten' [definition, in Poly]
evens_to_ten [definition, in Poly]
even_1000'' [definition, in Logic]
even_1000' [definition, in Logic]
even_1000 [definition, in Logic]
even_bool_prop [lemma, in Logic]
everywhere [definition, in Sort]
everywhere_perm [lemma, in Sort]
everywhere_1_234 [definition, in Sort]
evSS_ev' [lemma, in IndProp]
evSS_ev [lemma, in IndProp]
evSS_ev [lemma, in IndProp]
ev_plus_plus [lemma, in IndProp]
ev_ev__ev [lemma, in IndProp]
ev_sum [lemma, in IndProp]
ev_even_iff [lemma, in IndProp]
ev_even [lemma, in IndProp]
ev_even_firsttry [lemma, in IndProp]
ev_minus2 [lemma, in IndProp]
ev_inversion [lemma, in IndProp]
ev_double [lemma, in IndProp]
ev_plus4 [lemma, in IndProp]
ev_4' [lemma, in IndProp]
ev_4 [lemma, in IndProp]
ev_SS [constructor, in IndProp]
ev_0 [constructor, in IndProp]
ev' [inductive, in IndProp]
ev'_ev [lemma, in IndProp]
ev'_sum [constructor, in IndProp]
ev'_2 [constructor, in IndProp]
ev'_0 [constructor, in IndProp]
ev5_nonsense [lemma, in IndProp]
exactly [definition, in DNA]
exclude [constructor, in DNA]
excluded_middle_irrefutable [lemma, in Logic]
excluded_middle [definition, in Logic]
Exercises [module, in Poly]
Exercises.curry_uncurry [lemma, in Poly]
Exercises.prod_uncurry [definition, in Poly]
Exercises.prod_curry [definition, in Poly]
Exercises.test_map1' [definition, in Poly]
Exercises.uncurry_curry [lemma, in Poly]
exists_example_2 [lemma, in Logic]
exp [definition, in Basics]
ExplicitType [module, in Graphs]
ExplicitType.degree [definition, in Graphs]
ExplicitType.eq_dec_E [lemma, in Graphs]
ExplicitType.eq_dec_V [axiom, in Graphs]
ExplicitType.euler_handshake [lemma, in Graphs]
ExplicitType.graph [inductive, in Graphs]
ExplicitType.g_arc [constructor, in Graphs]
ExplicitType.g_vertex [constructor, in Graphs]
ExplicitType.g_empty [constructor, in Graphs]
ExplicitType.inductive_handshake [lemma, in Graphs]
ExplicitType.in_degree [definition, in Graphs]
ExplicitType.not_in__degree_O [lemma, in Graphs]
ExplicitType.num_edges__length [lemma, in Graphs]
ExplicitType.num_edges [definition, in Graphs]
ExplicitType.out_degree [definition, in Graphs]
ExplicitType.sum_vertex_degree__sum_map_degree [lemma, in Graphs]
ExplicitType.sum_vertex_degree [definition, in Graphs]
ExplicitType.vertex_setlike [lemma, in Graphs]
ExplicitType.X [axiom, in Graphs]
exp_one [lemma, in Combo]
ex_falso_quodlibet [lemma, in Logic]
F
factorial [definition, in Basics]factorial [definition, in Combo]
factorial_nz [lemma, in Combo]
fact_5__120 [definition, in Combo]
fact_0__1 [definition, in Combo]
false [constructor, in Basics]
fettuccine [constructor, in Combo]
filter [definition, in Poly]
filter_even_gt7 [definition, in Poly]
filter_exercise [lemma, in Tactics]
filter_preserves_sortedness [lemma, in Sort]
flat_map [definition, in Poly]
flat_map [definition, in Sort]
foo [definition, in Tactics]
Forall [inductive, in Sort]
forallb [definition, in Logic]
forallb_true_iff [lemma, in Logic]
Forall_nth [lemma, in Sort]
Forall_perm [lemma, in Sort]
Forall_cons [constructor, in Sort]
Forall_nil [constructor, in Sort]
four_is_even [lemma, in Logic]
friday [constructor, in Basics]
fst [definition, in Poly]
ftrue [definition, in Poly]
functional_extensionality [axiom, in Logic]
function_equality_ex2 [definition, in Logic]
function_equality_ex2 [definition, in Logic]
function_equality_ex1 [definition, in Logic]
fusilli [constructor, in Combo]
f_equal [lemma, in Tactics]
G
G [constructor, in Basics]Gln [constructor, in Poly]
Glu [constructor, in Poly]
Gly [constructor, in Poly]
Graphs [library]
green [constructor, in Basics]
H
half [definition, in Basics]half_nine_is_four [definition, in Basics]
half_four_is_two [definition, in Basics]
hd_error [definition, in Poly]
His [constructor, in Poly]
I
identity_fn_applied_twice [lemma, in Basics]iff_trans [lemma, in Logic]
iff_refl [lemma, in Logic]
iff_sym [lemma, in Logic]
Ile [constructor, in Poly]
impb [definition, in Basics]
impb_spec [lemma, in Basics]
implies_to_or [definition, in Logic]
In [definition, in Logic]
incr [definition, in Induction]
IndProp [library]
IndProp2 [library]
Induction [library]
injection_ex3 [definition, in Tactics]
injection_ex2 [lemma, in Tactics]
injection_ex1 [lemma, in Tactics]
injective [definition, in Logic]
insert [definition, in Poly]
insert [definition, in Sort]
insertion_sort_correct [lemma, in Sort]
insert_preserves_setlike [lemma, in IndProp]
insert_sorted' [lemma, in Sort]
insert_sorted [lemma, in Sort]
insert_perm [lemma, in Sort]
intersection [definition, in Poly]
intersection [definition, in IndProp]
intersection_preserves_setlike [lemma, in IndProp]
inversion_ex2 [lemma, in IndProp]
inversion_ex1 [lemma, in IndProp]
In_remove_iff [lemma, in Logic]
In_filter_iff [lemma, in Logic]
In_union_iff [lemma, in Logic]
In_union_r [lemma, in Logic]
In_union_l [lemma, in Logic]
In_insert_iff [lemma, in Logic]
In_member_iff [lemma, in Logic]
In_flat_map [lemma, in Logic]
In_app_iff [lemma, in Logic]
In_map_iff [lemma, in Logic]
In_map [lemma, in Logic]
In_example_2 [definition, in Logic]
In_example_1 [definition, in Logic]
In_everywhere_length [lemma, in Combo]
isred [definition, in Basics]
isred' [definition, in Basics]
is_weekday [definition, in Basics]
is_even_prime [definition, in Logic]
is_three [definition, in Logic]
is_amino [definition, in Poly]
is_setlike [definition, in Poly]
is_setlike__setlike [lemma, in IndProp]
is_setlike [definition, in IndProp]
is_a_sorting_algorithm [definition, in Sort]
is_amino_STOP [lemma, in DNA]
is_N_glycosylation_motif [definition, in DNA]
L
leb [definition, in Basics]leb_refl [lemma, in Induction]
leb_iff [lemma, in IndProp]
leb_true_trans [lemma, in IndProp]
leb_correct [lemma, in IndProp]
leb_complete [lemma, in IndProp]
leb_spec [lemma, in IndProp]
lemma_application_ex [definition, in Logic]
length [definition, in Poly]
length_is_1 [definition, in Poly]
length_permutation [lemma, in Combo]
length_flat_map [lemma, in Combo]
Leu [constructor, in Poly]
levenshtein [definition, in Tactics]
levenshtein [definition, in Tactics]
levenshtein_optimal [lemma, in IndProp]
levenshtein_refl_copy [lemma, in IndProp]
levenshtein_distance_correct [lemma, in Tactics]
levenshtein_distance [definition, in Tactics]
levenshtein_valid [lemma, in Tactics]
levenshtein__sub_edit_cost [definition, in Tactics]
levenshtein__sub_edit_tgt [definition, in Tactics]
levenshtein__sub_edit_src [definition, in Tactics]
le_order [lemma, in Rel]
le_step [lemma, in Rel]
le_antisymmetric [lemma, in Rel]
le_not_symmetric [lemma, in Rel]
le_Sn_n [lemma, in Rel]
le_S_n [lemma, in Rel]
le_Sn_le [lemma, in Rel]
le_trans [lemma, in Rel]
le_reflexive [lemma, in Rel]
le_not_a_partial_function [lemma, in Rel]
le_plus_l [lemma, in IndProp]
le_trans [lemma, in IndProp]
list [inductive, in Poly]
Lists [library]
list' [inductive, in Poly]
list123 [definition, in Poly]
list123' [definition, in Poly]
list123'' [definition, in Poly]
list123''' [definition, in Poly]
Logic [library]
lt [definition, in IndProp]
lt_trans'' [lemma, in Rel]
lt_trans' [lemma, in Rel]
lt_trans [lemma, in Rel]
lt_S [lemma, in IndProp]
Lys [constructor, in Poly]
M
manual_grade_for_basics3 [definition, in Basics]manual_grade_for_negation_fn_applied_twice [definition, in Basics]
manual_grade_for_third [definition, in Basics]
manual_grade_for_half [definition, in Basics]
manual_grade_for_andb3 [definition, in Basics]
manual_grade_for_impb [definition, in Basics]
manual_grade_for_nandb [definition, in Basics]
manual_grade_for_subset_iff [definition, in Logic]
manual_grade_for_In_intersection_iff [definition, in Logic]
manual_grade_for_delete_add_edit [definition, in Poly]
manual_grade_for_add_edit [definition, in Poly]
manual_grade_for_delete_edit [definition, in Poly]
manual_grade_for_edit_tgt23_minimal [definition, in Poly]
manual_grade_for_subset [definition, in Poly]
manual_grade_for_intersection [definition, in Poly]
manual_grade_for_is_setlike [definition, in Poly]
manual_grade_for_map_option_id [definition, in Poly]
manual_grade_for_binary_inverse [definition, in Induction]
manual_grade_for_binary_commute [definition, in Induction]
manual_grade_for_pal_pal_app_rev_pal_rev [definition, in IndProp2]
manual_grade_for_check_nostutter_def [definition, in IndProp2]
manual_grade_for_empty_relation [definition, in IndProp]
manual_grade_for_total_relation [definition, in IndProp]
manual_grade_for_split_combine [definition, in Tactics]
manual_grade_for_levenshtein_distance [definition, in Tactics]
manual_grade_for_sub_edit [definition, in Tactics]
map [definition, in Poly]
map_option__map_option' [lemma, in Poly]
map_option' [definition, in Poly]
map_option [definition, in Poly]
map_rev [lemma, in Poly]
map_length [lemma, in Poly]
marinara [constructor, in Combo]
matches [inductive, in DNA]
matches_motif__matches [lemma, in DNA]
matches_exclude [constructor, in DNA]
matches_oneof [constructor, in DNA]
matches_nil [constructor, in DNA]
matches_motif [definition, in DNA]
matches_motif_element [definition, in DNA]
meatballs [constructor, in Combo]
member [definition, in Poly]
Met [constructor, in Poly]
minustwo [definition, in Basics]
minus_n_O [lemma, in Basics]
minus_Sn_n [lemma, in Induction]
minus_diag [lemma, in Induction]
minus_Sn_m [lemma, in IndProp]
minus_Sn_m [lemma, in Combo]
min3 [definition, in Tactics]
min3_leb [lemma, in IndProp]
min3_min [lemma, in IndProp]
monday [constructor, in Basics]
monochrome [definition, in Basics]
monotonic [definition, in Sort]
monotonic_preserves_sortedness [lemma, in Sort]
motif [definition, in DNA]
motif_element [inductive, in DNA]
mult_S_1 [lemma, in Basics]
mult_0_plus [lemma, in Basics]
mult_0_l [lemma, in Basics]
mult_0_3 [lemma, in Logic]
mult_0 [lemma, in Logic]
mult_eq_0 [lemma, in Logic]
mult_assoc [lemma, in Induction]
mult_plus_distr_r [lemma, in Induction]
mult_1_l [lemma, in Induction]
mult_comm [lemma, in Induction]
mult_0_plus' [lemma, in Induction]
mult_0_r [lemma, in Induction]
mult_nz [lemma, in Combo]
MyIff [module, in Logic]
MyIff.iff [definition, in Logic]
_ <-> _ (type_scope) [notation, in Logic]
mynil [definition, in Poly]
mynil [definition, in Poly]
mynil' [definition, in Poly]
MyNot [module, in Logic]
MyNot.not [definition, in Logic]
~ _ (type_scope) [notation, in Logic]
N
naive_sub_worse [lemma, in IndProp]naive_sub_edit_valid [lemma, in Tactics]
naive_sub_edit [definition, in Tactics]
nandb [definition, in Basics]
nandb__negb_andb [lemma, in Basics]
NatList [module, in Lists]
NatList.alternate [definition, in Lists]
NatList.app [definition, in Lists]
NatList.app_assoc4 [lemma, in Lists]
NatList.app_nil_r [lemma, in Lists]
NatList.app_length [lemma, in Lists]
NatList.app_assoc [lemma, in Lists]
NatList.cons [constructor, in Lists]
NatList.countoddmembers [definition, in Lists]
NatList.eqblist [definition, in Lists]
NatList.eqblist_refl [lemma, in Lists]
NatList.fst [definition, in Lists]
NatList.fst_swap_is_snd [lemma, in Lists]
NatList.fst' [definition, in Lists]
NatList.hd [definition, in Lists]
NatList.hd_error [definition, in Lists]
NatList.length [definition, in Lists]
NatList.mylist [definition, in Lists]
NatList.mylist1 [definition, in Lists]
NatList.mylist2 [definition, in Lists]
NatList.mylist3 [definition, in Lists]
NatList.natlist [inductive, in Lists]
NatList.natoption [inductive, in Lists]
NatList.natprod [inductive, in Lists]
NatList.nil [constructor, in Lists]
NatList.nil_app [lemma, in Lists]
NatList.None [constructor, in Lists]
NatList.nonzeros [definition, in Lists]
NatList.nonzeros_app [lemma, in Lists]
NatList.nth_error' [definition, in Lists]
NatList.nth_error [definition, in Lists]
NatList.nth_bad [definition, in Lists]
NatList.ntoone [definition, in Lists]
NatList.oddmembers [definition, in Lists]
NatList.odds [definition, in Lists]
NatList.ones [definition, in Lists]
NatList.option_elim_hd [lemma, in Lists]
NatList.option_elim [definition, in Lists]
NatList.pair [constructor, in Lists]
NatList.repeat [definition, in Lists]
NatList.rev [definition, in Lists]
NatList.rev_involutive [lemma, in Lists]
NatList.rev_app_distr [lemma, in Lists]
NatList.rev_length [lemma, in Lists]
NatList.rev_length_firsttry [lemma, in Lists]
NatList.snd [definition, in Lists]
NatList.snd_fst_is_swap [lemma, in Lists]
NatList.snd' [definition, in Lists]
NatList.Some [constructor, in Lists]
NatList.sum_natlist_repeat_n [lemma, in Lists]
NatList.sum_natlist_repeat_n_m [lemma, in Lists]
NatList.sum_natlist_repeat_n [lemma, in Lists]
NatList.sum_natlist_rev [lemma, in Lists]
NatList.sum_natlist_ntoone [lemma, in Lists]
NatList.sum_natlist_odds' [lemma, in Lists]
NatList.sum_natlist_odds [lemma, in Lists]
NatList.sum_natlist_ones [lemma, in Lists]
NatList.sum_natlist [definition, in Lists]
NatList.surjective_pairing [lemma, in Lists]
NatList.surjective_pairing_stuck [lemma, in Lists]
NatList.surjective_pairing' [lemma, in Lists]
NatList.swap_pair [definition, in Lists]
NatList.test_hd_error3 [definition, in Lists]
NatList.test_hd_error2 [definition, in Lists]
NatList.test_hd_error1 [definition, in Lists]
NatList.test_nth_error3 [definition, in Lists]
NatList.test_nth_error2 [definition, in Lists]
NatList.test_nth_error1 [definition, in Lists]
NatList.test_eqblist3 [definition, in Lists]
NatList.test_eqblist2 [definition, in Lists]
NatList.test_eqblist1 [definition, in Lists]
NatList.test_rev2 [definition, in Lists]
NatList.test_rev1 [definition, in Lists]
NatList.test_alternate4 [definition, in Lists]
NatList.test_alternate3 [definition, in Lists]
NatList.test_alternate2 [definition, in Lists]
NatList.test_alternate1 [definition, in Lists]
NatList.test_countoddmembers3 [definition, in Lists]
NatList.test_countoddmembers2 [definition, in Lists]
NatList.test_countoddmembers1 [definition, in Lists]
NatList.test_oddmembers [definition, in Lists]
NatList.test_nonzeros [definition, in Lists]
NatList.test_tl [definition, in Lists]
NatList.test_hd2 [definition, in Lists]
NatList.test_hd1 [definition, in Lists]
NatList.test_app3 [definition, in Lists]
NatList.test_app2 [definition, in Lists]
NatList.test_app1 [definition, in Lists]
NatList.tl [definition, in Lists]
NatList.tl_length_pred [lemma, in Lists]
_ ++ _ [notation, in Lists]
_ :: _ [notation, in Lists]
( _ , _ ) [notation, in Lists]
[ _ ; .. ; _ ] [notation, in Lists]
[ ] [notation, in Lists]
NatPlayground [module, in Basics]
NatPlayground.nat [inductive, in Basics]
NatPlayground.nat' [inductive, in Basics]
NatPlayground.O [constructor, in Basics]
NatPlayground.pred [definition, in Basics]
NatPlayground.S [constructor, in Basics]
NatPlayground.stop [constructor, in Basics]
NatPlayground.tick [constructor, in Basics]
NatPlayground2 [module, in Basics]
NatPlayground2.minus [definition, in Basics]
NatPlayground2.mult [definition, in Basics]
NatPlayground2.plus [definition, in Basics]
NatPlayground2.test_mult1 [definition, in Basics]
natset [definition, in Poly]
negb [definition, in Basics]
negb_true [lemma, in Basics]
negb_involutive [lemma, in Basics]
next_weekday [definition, in Basics]
next_nat_closure_is_le [lemma, in Rel]
next_nat_partial_function [lemma, in Rel]
next_ev [inductive, in IndProp]
next_nat [inductive, in IndProp]
ne_2 [constructor, in IndProp]
ne_1 [constructor, in IndProp]
nil [constructor, in Poly]
nil' [constructor, in Poly]
nn [constructor, in IndProp]
none [constructor, in Combo]
nostutter [inductive, in IndProp2]
not_exists_dist [lemma, in Logic]
not_P__P_true [lemma, in Logic]
not_true_iff_false [lemma, in Logic]
not_true_is_false' [lemma, in Logic]
not_true_is_false [lemma, in Logic]
not_both_true_and_false [lemma, in Logic]
not_False [lemma, in Logic]
not_implies_our_not [lemma, in Logic]
nth [definition, in Sort]
nth_error [definition, in Poly]
nth_error_after_last [lemma, in Tactics]
nth_default [definition, in Sort]
nth_in_list [definition, in Sort]
n_le_m__Sn_le_Sm [lemma, in IndProp]
N_glycosylation_correct [lemma, in DNA]
N_glycosylation [definition, in DNA]
N_glycosylation_eg4 [lemma, in DNA]
N_glycosylation_eg3 [lemma, in DNA]
N_glycosylation_eg2 [lemma, in DNA]
N_glycosylation_eg1 [lemma, in DNA]
O
oddb [definition, in Basics]oneof [constructor, in DNA]
one_not_even' [lemma, in IndProp]
one_not_even [lemma, in IndProp]
OptionPlayground [module, in Poly]
OptionPlayground.None [constructor, in Poly]
OptionPlayground.option [inductive, in Poly]
OptionPlayground.Some [constructor, in Poly]
option_map [definition, in Poly]
orb [definition, in Basics]
orb_true_iff [lemma, in Logic]
order [definition, in Rel]
or_assoc [lemma, in Logic]
or_distributes_over_and [lemma, in Logic]
or_commut [lemma, in Logic]
or_intro [lemma, in Logic]
or_example [lemma, in Logic]
O_le_n [lemma, in IndProp]
P
pair [constructor, in Poly]partial_function [definition, in Rel]
partition [definition, in Poly]
pasta [inductive, in Combo]
pastas [definition, in Combo]
peirce [definition, in Logic]
penne [constructor, in Combo]
Permutation [inductive, in Sort]
permutations [definition, in Sort]
permutations_length [lemma, in Combo]
permutations_complete [lemma, in Sort]
permutations_1234 [definition, in Sort]
permutation_length [lemma, in Combo]
Permutation_sym [lemma, in Sort]
Permutation_length [lemma, in Sort]
Permutation_refl [lemma, in Sort]
permutation_eg [definition, in Sort]
perm_trans [constructor, in Sort]
perm_swap [constructor, in Sort]
perm_skip [constructor, in Sort]
perm_nil [constructor, in Sort]
Phe [constructor, in Poly]
Playground [module, in IndProp]
Playground.le [inductive, in IndProp]
Playground.le_S [constructor, in IndProp]
Playground.le_n [constructor, in IndProp]
Playground.test_le3 [lemma, in IndProp]
Playground.test_le2 [lemma, in IndProp]
Playground.test_le1 [lemma, in IndProp]
_ <= _ [notation, in IndProp]
plus_1_neq_0' [lemma, in Basics]
plus_1_neq_0 [lemma, in Basics]
plus_1_neq_0_firsttry [lemma, in Basics]
plus_id_exercise [lemma, in Basics]
plus_id_example [lemma, in Basics]
plus_1_l [lemma, in Basics]
plus_O_n' [lemma, in Basics]
plus_O_n [lemma, in Basics]
plus_comm3_take3 [lemma, in Logic]
plus_comm3_take2 [lemma, in Logic]
plus_comm3 [lemma, in Logic]
plus_is_O [definition, in Logic]
plus_fact_is_true [lemma, in Logic]
plus_fact [definition, in Logic]
plus_2_2_is_4 [lemma, in Logic]
plus_swap' [lemma, in Induction]
plus_ble_compat_l [lemma, in Induction]
plus_swap [lemma, in Induction]
plus_assoc'' [lemma, in Induction]
plus_assoc' [lemma, in Induction]
plus_rearrange [lemma, in Induction]
plus_rearrange_firsttry [lemma, in Induction]
plus_assoc [lemma, in Induction]
plus_comm [lemma, in Induction]
plus_n_Sm [lemma, in Induction]
plus_n_O [lemma, in Induction]
plus_n_O_secondtry [lemma, in Induction]
plus_n_O_firsttry [lemma, in Induction]
plus_lt [lemma, in IndProp]
plus_n_n_injective [lemma, in Tactics]
plus' [definition, in Basics]
plus3 [definition, in Poly]
Poly [library]
Postscript [library]
Preface [library]
preorder [definition, in Rel]
preserves_sortedness [definition, in Sort]
primary [constructor, in Basics]
Pro [constructor, in Poly]
prod [inductive, in Poly]
product [definition, in Combo]
product_times [lemma, in Combo]
product_example2 [definition, in Combo]
product_example1 [definition, in Combo]
proj1 [lemma, in Logic]
proj2 [lemma, in Logic]
R
R [module, in IndProp]red [constructor, in Basics]
reflexive [definition, in Rel]
Rel [library]
relation [definition, in Rel]
remove [definition, in Poly]
remove_first [definition, in Graphs]
remove_preserves_setlike [lemma, in IndProp]
repeat [definition, in Poly]
repeat' [definition, in Poly]
repeat'' [definition, in Poly]
repeat''' [definition, in Poly]
restricted_excluded_middle_eq [lemma, in Logic]
restricted_excluded_middle [lemma, in Logic]
rev [definition, in Poly]
rev_append [definition, in Logic]
rev_involutive [lemma, in Poly]
rev_app_distr [lemma, in Poly]
rev_exercise1 [lemma, in Tactics]
rgb [inductive, in Basics]
route_options [definition, in Combo]
rsc_trans [lemma, in Rel]
rsc_R [lemma, in Rel]
rtc_rsc_coincide [lemma, in Rel]
rt_trans [constructor, in Rel]
rt_refl [constructor, in Rel]
rt_step [constructor, in Rel]
rt1n_trans [constructor, in Rel]
rt1n_refl [constructor, in Rel]
R.c1 [constructor, in IndProp]
R.c2 [constructor, in IndProp]
R.c3 [constructor, in IndProp]
R.c4 [constructor, in IndProp]
R.c5 [constructor, in IndProp]
R.fR [definition, in IndProp]
R.manual_grade_for_R_fact [definition, in IndProp]
R.R [inductive, in IndProp]
R.R_equiv_fR [lemma, in IndProp]
S
saturday [constructor, in Basics]sauce [inductive, in Combo]
sauces [definition, in Combo]
seafood [constructor, in Combo]
Ser [constructor, in Poly]
setlike [inductive, in Graphs]
setlike [inductive, in IndProp]
setlike_cons [constructor, in Graphs]
setlike_nil [constructor, in Graphs]
setlike_eg2 [definition, in IndProp]
setlike_eg1 [definition, in IndProp]
setlike_cons [constructor, in IndProp]
setlike_nil [constructor, in IndProp]
Sets [library]
sillyfun [definition, in Tactics]
sillyfun_false [lemma, in Tactics]
sillyfun1 [definition, in Tactics]
sillyfun1_odd [lemma, in Tactics]
sillyfun1_odd_FAILED [lemma, in Tactics]
silly_fact_2' [lemma, in Tactics]
silly_fact_2 [lemma, in Tactics]
silly_fact_2_FAILED [lemma, in Tactics]
silly_fact_1 [lemma, in Tactics]
silly_ex [lemma, in Tactics]
silly1 [lemma, in Tactics]
silly2 [lemma, in Tactics]
silly2a [lemma, in Tactics]
silly3_firsttry [lemma, in Tactics]
silly3' [lemma, in Tactics]
snd [definition, in Poly]
Sn_le_Sm__n_le_m [lemma, in IndProp]
sort [definition, in Sort]
Sort [library]
sorted [inductive, in Sort]
sorted_sorted' [lemma, in Sort]
sorted_filter_cons [lemma, in Sort]
sorted_one_through_four [definition, in Sort]
sorted_cons [constructor, in Sort]
sorted_1 [constructor, in Sort]
sorted_nil [constructor, in Sort]
sorted' [definition, in Sort]
sorted'_sorted [lemma, in Sort]
sort_sorted' [lemma, in Sort]
sort_idempotent [lemma, in Sort]
sort_stable [lemma, in Sort]
sort_sorted [lemma, in Sort]
sort_perm [lemma, in Sort]
sort_pi [definition, in Sort]
spaghetti [constructor, in Combo]
split [definition, in Poly]
split [definition, in Tactics]
split_combine [lemma, in Tactics]
split_combine_statement [definition, in Tactics]
sq [constructor, in IndProp]
square [definition, in Tactics]
square_of [inductive, in IndProp]
square_mult [lemma, in Tactics]
SSSSev__even [lemma, in IndProp]
STOP [constructor, in Poly]
strand [definition, in Poly]
strong_induction [lemma, in IndProp]
strong_induction__weak_induction [lemma, in IndProp]
strong_induction_principle [definition, in IndProp]
subseq [inductive, in IndProp2]
subseq_trans [lemma, in IndProp2]
subseq_app [lemma, in IndProp2]
subseq_refl [lemma, in IndProp2]
subset [definition, in Poly]
subset [definition, in IndProp]
substitute [constructor, in Poly]
sub_edit_valid [lemma, in Tactics]
sub_edit [definition, in Tactics]
succ_inj [lemma, in Logic]
sum [definition, in Graphs]
sum_map [definition, in Graphs]
sum_odds [lemma, in Combo]
sum_zeroton [lemma, in Combo]
sum_nm_times [lemma, in Combo]
sum_nm_add [lemma, in Combo]
sum_nm_ext [lemma, in Combo]
sum_nm_f [lemma, in Combo]
sum_nm_i [lemma, in Combo]
sum_nm [definition, in Combo]
sunday [constructor, in Basics]
symmetric [definition, in Rel]
S_nbeq_0 [lemma, in Induction]
S_inj [lemma, in Tactics]
S_injective' [lemma, in Tactics]
S_injective [lemma, in Tactics]
T
T [constructor, in Basics]Tactics [library]
tagliatelle [constructor, in Combo]
test_blt_nat3 [definition, in Basics]
test_blt_nat2 [definition, in Basics]
test_blt_nat1 [definition, in Basics]
test_leb3 [definition, in Basics]
test_leb2 [definition, in Basics]
test_leb1 [definition, in Basics]
test_factorial2 [definition, in Basics]
test_factorial1 [definition, in Basics]
test_oddb2 [definition, in Basics]
test_oddb1 [definition, in Basics]
test_andb34 [definition, in Basics]
test_andb33 [definition, in Basics]
test_andb32 [definition, in Basics]
test_andb31 [definition, in Basics]
test_nandb4 [definition, in Basics]
test_nandb3 [definition, in Basics]
test_nandb2 [definition, in Basics]
test_nandb1 [definition, in Basics]
test_orb5 [definition, in Basics]
test_orb4 [definition, in Basics]
test_orb3 [definition, in Basics]
test_orb2 [definition, in Basics]
test_orb1 [definition, in Basics]
test_next_weekday [definition, in Basics]
test_plus3'' [definition, in Poly]
test_plus3' [definition, in Poly]
test_plus3 [definition, in Poly]
test_flat_map1 [definition, in Poly]
test_map3 [definition, in Poly]
test_map2 [definition, in Poly]
test_map1 [definition, in Poly]
test_partition2 [definition, in Poly]
test_partition1 [definition, in Poly]
test_filter_even_gt7_2 [definition, in Poly]
test_filter_even_gt7_1 [definition, in Poly]
test_filter2' [definition, in Poly]
test_anon_fun' [definition, in Poly]
test_countoddmembers'3 [definition, in Poly]
test_countoddmembers'2 [definition, in Poly]
test_countoddmembers'1 [definition, in Poly]
test_filter2 [definition, in Poly]
test_filter1 [definition, in Poly]
test_doit3times' [definition, in Poly]
test_doit3times [definition, in Poly]
test_hd_error2 [definition, in Poly]
test_hd_error1 [definition, in Poly]
test_nth_error3 [definition, in Poly]
test_nth_error2 [definition, in Poly]
test_nth_error1 [definition, in Poly]
test_split [definition, in Poly]
test_length1 [definition, in Poly]
test_rev2 [definition, in Poly]
test_rev1 [definition, in Poly]
test_repeat2 [definition, in Poly]
test_repeat1 [definition, in Poly]
test_nostutter_4 [definition, in IndProp2]
test_nostutter_3 [definition, in IndProp2]
test_nostutter_2 [definition, in IndProp2]
test_nostutter_1 [definition, in IndProp2]
third [definition, in Basics]
third_nine_is_three [definition, in Basics]
third_four_is_one [definition, in Basics]
Thr [constructor, in Poly]
thursday [constructor, in Basics]
topping [inductive, in Combo]
toppings [definition, in Combo]
total_cost [definition, in Poly]
train [definition, in Combo]
transitive [definition, in Rel]
trans_eq_exercise [definition, in Tactics]
trans_eq_example' [definition, in Tactics]
trans_eq [lemma, in Tactics]
trans_eq_example [definition, in Tactics]
Trp [constructor, in Poly]
true [constructor, in Basics]
True_is_true [lemma, in Logic]
tr_rev_correct [lemma, in Logic]
tr_rev [definition, in Logic]
tuesday [constructor, in Basics]
Tyr [constructor, in Poly]
t_sum_Svars [lemma, in Combo]
T2 [constructor, in Induction]
T2P1 [constructor, in Induction]
U
union [definition, in Poly]union_intersection_dist [lemma, in IndProp]
union_preserves_setlike [lemma, in IndProp]
V
Val [constructor, in Poly]valid_edit1_worse [lemma, in Poly]
valid_edit1 [lemma, in Poly]
valid_edit [definition, in Poly]
vegetables [constructor, in Combo]
W
weak_induction_principle [definition, in IndProp]wednesday [constructor, in Basics]
white [constructor, in Basics]
wrong_ev_SS [constructor, in IndProp]
wrong_ev_0 [constructor, in IndProp]
wrong_ev [inductive, in IndProp]
Z
zero_nbeq_plus_1 [lemma, in Basics]zero_not_one' [lemma, in Logic]
zero_not_one [lemma, in Logic]
zero_or_succ [lemma, in Logic]
zero_nbeq_S [lemma, in Induction]
other
_ * _ (nat_scope) [notation, in Basics]_ + _ (nat_scope) [notation, in Basics]
_ * _ (nat_scope) [notation, in Basics]
_ - _ (nat_scope) [notation, in Basics]
_ + _ (nat_scope) [notation, in Basics]
_ * _ (type_scope) [notation, in Poly]
_ || _ [notation, in Basics]
_ && _ [notation, in Basics]
_ ++ _ [notation, in Poly]
_ :: _ [notation, in Poly]
_ < _ [notation, in IndProp]
( _ , _ ) [notation, in Poly]
[ _ ; .. ; _ ] [notation, in Poly]
[ ] [notation, in Poly]
Notation Index
M
_ <-> _ (type_scope) [in Logic]~ _ (type_scope) [in Logic]
N
_ ++ _ [in Lists]_ :: _ [in Lists]
( _ , _ ) [in Lists]
[ _ ; .. ; _ ] [in Lists]
[ ] [in Lists]
P
_ <= _ [in IndProp]other
_ * _ (nat_scope) [in Basics]_ + _ (nat_scope) [in Basics]
_ * _ (nat_scope) [in Basics]
_ - _ (nat_scope) [in Basics]
_ + _ (nat_scope) [in Basics]
_ * _ (type_scope) [in Poly]
_ || _ [in Basics]
_ && _ [in Basics]
_ ++ _ [in Poly]
_ :: _ [in Poly]
_ < _ [in IndProp]
( _ , _ ) [in Poly]
[ _ ; .. ; _ ] [in Poly]
[ ] [in Poly]
Module Index
A
AxiomaticSets [in Sets]E
Exercises [in Poly]ExplicitType [in Graphs]
M
MyIff [in Logic]MyNot [in Logic]
N
NatList [in Lists]NatPlayground [in Basics]
NatPlayground2 [in Basics]
O
OptionPlayground [in Poly]P
Playground [in IndProp]R
R [in IndProp]Library Index
B
BasicsBib
C
ComboD
DNAG
GraphsI
IndPropIndProp2
Induction
L
ListsLogic
P
PolyPostscript
Preface
R
RelS
SetsSort
T
TacticsLemma Index
A
addn_preserves_sortedness [in Sort]add_empty_optimal [in IndProp]
add_cost [in Tactics]
add_edit_valid [in Tactics]
add1_preserves_sortedness [in Sort]
add2_preserves_sortedness [in Sort]
All_In [in Logic]
all3_spec [in Induction]
andb_eq_orb [in Basics]
andb_true_elim2 [in Basics]
andb_commutative'' [in Basics]
andb_commutative' [in Basics]
andb_commutative [in Basics]
andb_true_iff [in Logic]
andb_false_r [in Induction]
andb3_exchange [in Basics]
and_assoc [in Logic]
and_commut [in Logic]
and_example3 [in Logic]
and_example2'' [in Logic]
and_example2' [in Logic]
and_example2 [in Logic]
and_intro [in Logic]
any_eq__not_In [in DNA]
any_eq__In [in DNA]
apply_iff_example [in Logic]
app_length [in Poly]
app_assoc [in Poly]
app_nil_r [in Poly]
argmin3_leb [in IndProp]
argmin3_min [in IndProp]
argmin3_valid [in Tactics]
argmin3_min3 [in Tactics]
argmin3_min3_eqs [in Tactics]
AxiomaticSets.bool_countable_inj [in Sets]
AxiomaticSets.bool_countable_surj [in Sets]
AxiomaticSets.bool_nat_cardinality [in Sets]
AxiomaticSets.bool_two_cardinality [in Sets]
AxiomaticSets.bool_inj__surj [in Sets]
AxiomaticSets.cartesian_product__total [in Sets]
AxiomaticSets.complement_involutive [in Sets]
AxiomaticSets.de_morgan2 [in Sets]
AxiomaticSets.de_morgan [in Sets]
AxiomaticSets.empty_cartesian_identity_l [in Sets]
AxiomaticSets.empty_subset [in Sets]
AxiomaticSets.enigma_enigma_fun [in Sets]
AxiomaticSets.enigma_not_total [in Sets]
AxiomaticSets.enigma_functional [in Sets]
AxiomaticSets.inj_composition [in Sets]
AxiomaticSets.list_unit_infinitely_countable [in Sets]
AxiomaticSets.member_cartesian [in Sets]
AxiomaticSets.member_complement [in Sets]
AxiomaticSets.member_difference [in Sets]
AxiomaticSets.member_intersection [in Sets]
AxiomaticSets.member_union [in Sets]
AxiomaticSets.member_singleton [in Sets]
AxiomaticSets.natopt_infinitely_countable [in Sets]
AxiomaticSets.nat_natfun_diag [in Sets]
AxiomaticSets.nat__list_unit [in Sets]
AxiomaticSets.nat_inj_not_surjective [in Sets]
AxiomaticSets.nat_inj_injective [in Sets]
AxiomaticSets.nat_natopt_bij_correct [in Sets]
AxiomaticSets.nat_natopt_inj_correct [in Sets]
AxiomaticSets.set_powset_diag [in Sets]
AxiomaticSets.subset_universe [in Sets]
AxiomaticSets.subset_eq [in Sets]
AxiomaticSets.subset_trans [in Sets]
AxiomaticSets.subset_refl [in Sets]
AxiomaticSets.surj_composition [in Sets]
AxiomaticSets.total_preimage_is_whole_domain [in Sets]
AxiomaticSets.union_subset_r [in Sets]
AxiomaticSets.union_subset_l [in Sets]
AxiomaticSets.union_comm [in Sets]
AxiomaticSets.union_subset [in Sets]
AxiomaticSets.unit_bool_cardinality [in Sets]
B
bad_function_breaks_sortedness [in Sort]beq_list_true_iff [in Logic]
binomial [in Combo]
binomial_three_to_the_n [in Combo]
binomial_x_plus_1 [in Combo]
binomial_two_to_the_n [in Combo]
bool_fn_applied_thrice [in Tactics]
C
choose_swap [in Combo]choose_fact [in Combo]
choose_pascal [in Combo]
choose_n_n [in Combo]
choose_n_lt_m [in Combo]
choose_n_0 [in Combo]
combine_odd_even_elim_even [in Logic]
combine_odd_even_elim_odd [in Logic]
combine_odd_even_intro [in Logic]
combine_split [in Tactics]
complementary_complementary' [in Poly]
complement_involutive [in Basics]
complement_correct [in Poly]
contradiction_implies_anything [in Logic]
contrapositive [in Logic]
copy_cost_0 [in Tactics]
copy_edit_valid [in Tactics]
D
delete_empty_optimal [in IndProp]delete_cost [in Tactics]
delete_add_valid [in Tactics]
delete_edit_valid [in Tactics]
discriminate_ex2 [in Tactics]
discriminate_ex1 [in Tactics]
dist_exists_or [in Logic]
dist_not_exists [in Logic]
double_neg [in Logic]
double_plus [in Induction]
double_injective_take2 [in Tactics]
double_injective_take2_FAILED [in Tactics]
double_injective [in Tactics]
double_injective_FAILED [in Tactics]
E
edit1_same [in Poly]edit1_worse_actually_worse [in Poly]
encode_eg2 [in Poly]
encode_eg1 [in Poly]
encode_rev_Ala [in Poly]
eqb_false_iff [in Logic]
eqb_true_iff [in Logic]
eqb_refl [in Induction]
eqb_trans [in Tactics]
eqb_sym [in Tactics]
eqb_true [in Tactics]
eqb_0_l [in Tactics]
eq_strand_iff [in Logic]
eq_base_iff [in Logic]
eq_strand_refl [in Poly]
eq_base_refl [in Poly]
eq_base_true [in Tactics]
eq_implies_succ_equal' [in Tactics]
eq_implies_succ_equal [in Tactics]
eq_codon_iff [in DNA]
eq_codon_sym [in DNA]
eq_codon_refl [in DNA]
evenb_double_conv [in Logic]
evenb_double [in Logic]
evenb_S [in Induction]
even_bool_prop [in Logic]
everywhere_perm [in Sort]
evSS_ev' [in IndProp]
evSS_ev [in IndProp]
evSS_ev [in IndProp]
ev_plus_plus [in IndProp]
ev_ev__ev [in IndProp]
ev_sum [in IndProp]
ev_even_iff [in IndProp]
ev_even [in IndProp]
ev_even_firsttry [in IndProp]
ev_minus2 [in IndProp]
ev_inversion [in IndProp]
ev_double [in IndProp]
ev_plus4 [in IndProp]
ev_4' [in IndProp]
ev_4 [in IndProp]
ev'_ev [in IndProp]
ev5_nonsense [in IndProp]
excluded_middle_irrefutable [in Logic]
Exercises.curry_uncurry [in Poly]
Exercises.uncurry_curry [in Poly]
exists_example_2 [in Logic]
ExplicitType.eq_dec_E [in Graphs]
ExplicitType.euler_handshake [in Graphs]
ExplicitType.inductive_handshake [in Graphs]
ExplicitType.not_in__degree_O [in Graphs]
ExplicitType.num_edges__length [in Graphs]
ExplicitType.sum_vertex_degree__sum_map_degree [in Graphs]
ExplicitType.vertex_setlike [in Graphs]
exp_one [in Combo]
ex_falso_quodlibet [in Logic]
F
factorial_nz [in Combo]filter_exercise [in Tactics]
filter_preserves_sortedness [in Sort]
forallb_true_iff [in Logic]
Forall_nth [in Sort]
Forall_perm [in Sort]
four_is_even [in Logic]
f_equal [in Tactics]
I
identity_fn_applied_twice [in Basics]iff_trans [in Logic]
iff_refl [in Logic]
iff_sym [in Logic]
impb_spec [in Basics]
injection_ex2 [in Tactics]
injection_ex1 [in Tactics]
insertion_sort_correct [in Sort]
insert_preserves_setlike [in IndProp]
insert_sorted' [in Sort]
insert_sorted [in Sort]
insert_perm [in Sort]
intersection_preserves_setlike [in IndProp]
inversion_ex2 [in IndProp]
inversion_ex1 [in IndProp]
In_remove_iff [in Logic]
In_filter_iff [in Logic]
In_union_iff [in Logic]
In_union_r [in Logic]
In_union_l [in Logic]
In_insert_iff [in Logic]
In_member_iff [in Logic]
In_flat_map [in Logic]
In_app_iff [in Logic]
In_map_iff [in Logic]
In_map [in Logic]
In_everywhere_length [in Combo]
is_setlike__setlike [in IndProp]
is_amino_STOP [in DNA]
L
leb_refl [in Induction]leb_iff [in IndProp]
leb_true_trans [in IndProp]
leb_correct [in IndProp]
leb_complete [in IndProp]
leb_spec [in IndProp]
length_permutation [in Combo]
length_flat_map [in Combo]
levenshtein_optimal [in IndProp]
levenshtein_refl_copy [in IndProp]
levenshtein_distance_correct [in Tactics]
levenshtein_valid [in Tactics]
le_order [in Rel]
le_step [in Rel]
le_antisymmetric [in Rel]
le_not_symmetric [in Rel]
le_Sn_n [in Rel]
le_S_n [in Rel]
le_Sn_le [in Rel]
le_trans [in Rel]
le_reflexive [in Rel]
le_not_a_partial_function [in Rel]
le_plus_l [in IndProp]
le_trans [in IndProp]
lt_trans'' [in Rel]
lt_trans' [in Rel]
lt_trans [in Rel]
lt_S [in IndProp]
M
map_option__map_option' [in Poly]map_rev [in Poly]
map_length [in Poly]
matches_motif__matches [in DNA]
minus_n_O [in Basics]
minus_Sn_n [in Induction]
minus_diag [in Induction]
minus_Sn_m [in IndProp]
minus_Sn_m [in Combo]
min3_leb [in IndProp]
min3_min [in IndProp]
monotonic_preserves_sortedness [in Sort]
mult_S_1 [in Basics]
mult_0_plus [in Basics]
mult_0_l [in Basics]
mult_0_3 [in Logic]
mult_0 [in Logic]
mult_eq_0 [in Logic]
mult_assoc [in Induction]
mult_plus_distr_r [in Induction]
mult_1_l [in Induction]
mult_comm [in Induction]
mult_0_plus' [in Induction]
mult_0_r [in Induction]
mult_nz [in Combo]
N
naive_sub_worse [in IndProp]naive_sub_edit_valid [in Tactics]
nandb__negb_andb [in Basics]
NatList.app_assoc4 [in Lists]
NatList.app_nil_r [in Lists]
NatList.app_length [in Lists]
NatList.app_assoc [in Lists]
NatList.eqblist_refl [in Lists]
NatList.fst_swap_is_snd [in Lists]
NatList.nil_app [in Lists]
NatList.nonzeros_app [in Lists]
NatList.option_elim_hd [in Lists]
NatList.rev_involutive [in Lists]
NatList.rev_app_distr [in Lists]
NatList.rev_length [in Lists]
NatList.rev_length_firsttry [in Lists]
NatList.snd_fst_is_swap [in Lists]
NatList.sum_natlist_repeat_n [in Lists]
NatList.sum_natlist_repeat_n_m [in Lists]
NatList.sum_natlist_repeat_n [in Lists]
NatList.sum_natlist_rev [in Lists]
NatList.sum_natlist_ntoone [in Lists]
NatList.sum_natlist_odds' [in Lists]
NatList.sum_natlist_odds [in Lists]
NatList.sum_natlist_ones [in Lists]
NatList.surjective_pairing [in Lists]
NatList.surjective_pairing_stuck [in Lists]
NatList.surjective_pairing' [in Lists]
NatList.tl_length_pred [in Lists]
negb_true [in Basics]
negb_involutive [in Basics]
next_nat_closure_is_le [in Rel]
next_nat_partial_function [in Rel]
not_exists_dist [in Logic]
not_P__P_true [in Logic]
not_true_iff_false [in Logic]
not_true_is_false' [in Logic]
not_true_is_false [in Logic]
not_both_true_and_false [in Logic]
not_False [in Logic]
not_implies_our_not [in Logic]
nth_error_after_last [in Tactics]
n_le_m__Sn_le_Sm [in IndProp]
N_glycosylation_correct [in DNA]
N_glycosylation_eg4 [in DNA]
N_glycosylation_eg3 [in DNA]
N_glycosylation_eg2 [in DNA]
N_glycosylation_eg1 [in DNA]
O
one_not_even' [in IndProp]one_not_even [in IndProp]
orb_true_iff [in Logic]
or_assoc [in Logic]
or_distributes_over_and [in Logic]
or_commut [in Logic]
or_intro [in Logic]
or_example [in Logic]
O_le_n [in IndProp]
P
permutations_length [in Combo]permutations_complete [in Sort]
permutation_length [in Combo]
Permutation_sym [in Sort]
Permutation_length [in Sort]
Permutation_refl [in Sort]
Playground.test_le3 [in IndProp]
Playground.test_le2 [in IndProp]
Playground.test_le1 [in IndProp]
plus_1_neq_0' [in Basics]
plus_1_neq_0 [in Basics]
plus_1_neq_0_firsttry [in Basics]
plus_id_exercise [in Basics]
plus_id_example [in Basics]
plus_1_l [in Basics]
plus_O_n' [in Basics]
plus_O_n [in Basics]
plus_comm3_take3 [in Logic]
plus_comm3_take2 [in Logic]
plus_comm3 [in Logic]
plus_fact_is_true [in Logic]
plus_2_2_is_4 [in Logic]
plus_swap' [in Induction]
plus_ble_compat_l [in Induction]
plus_swap [in Induction]
plus_assoc'' [in Induction]
plus_assoc' [in Induction]
plus_rearrange [in Induction]
plus_rearrange_firsttry [in Induction]
plus_assoc [in Induction]
plus_comm [in Induction]
plus_n_Sm [in Induction]
plus_n_O [in Induction]
plus_n_O_secondtry [in Induction]
plus_n_O_firsttry [in Induction]
plus_lt [in IndProp]
plus_n_n_injective [in Tactics]
product_times [in Combo]
proj1 [in Logic]
proj2 [in Logic]
R
remove_preserves_setlike [in IndProp]restricted_excluded_middle_eq [in Logic]
restricted_excluded_middle [in Logic]
rev_involutive [in Poly]
rev_app_distr [in Poly]
rev_exercise1 [in Tactics]
rsc_trans [in Rel]
rsc_R [in Rel]
rtc_rsc_coincide [in Rel]
R.R_equiv_fR [in IndProp]
S
sillyfun_false [in Tactics]sillyfun1_odd [in Tactics]
sillyfun1_odd_FAILED [in Tactics]
silly_fact_2' [in Tactics]
silly_fact_2 [in Tactics]
silly_fact_2_FAILED [in Tactics]
silly_fact_1 [in Tactics]
silly_ex [in Tactics]
silly1 [in Tactics]
silly2 [in Tactics]
silly2a [in Tactics]
silly3_firsttry [in Tactics]
silly3' [in Tactics]
Sn_le_Sm__n_le_m [in IndProp]
sorted_sorted' [in Sort]
sorted_filter_cons [in Sort]
sorted'_sorted [in Sort]
sort_sorted' [in Sort]
sort_idempotent [in Sort]
sort_stable [in Sort]
sort_sorted [in Sort]
sort_perm [in Sort]
split_combine [in Tactics]
square_mult [in Tactics]
SSSSev__even [in IndProp]
strong_induction [in IndProp]
strong_induction__weak_induction [in IndProp]
subseq_trans [in IndProp2]
subseq_app [in IndProp2]
subseq_refl [in IndProp2]
sub_edit_valid [in Tactics]
succ_inj [in Logic]
sum_odds [in Combo]
sum_zeroton [in Combo]
sum_nm_times [in Combo]
sum_nm_add [in Combo]
sum_nm_ext [in Combo]
sum_nm_f [in Combo]
sum_nm_i [in Combo]
S_nbeq_0 [in Induction]
S_inj [in Tactics]
S_injective' [in Tactics]
S_injective [in Tactics]
T
trans_eq [in Tactics]True_is_true [in Logic]
tr_rev_correct [in Logic]
t_sum_Svars [in Combo]
U
union_intersection_dist [in IndProp]union_preserves_setlike [in IndProp]
V
valid_edit1_worse [in Poly]valid_edit1 [in Poly]
Z
zero_nbeq_plus_1 [in Basics]zero_not_one' [in Logic]
zero_not_one [in Logic]
zero_or_succ [in Logic]
zero_nbeq_S [in Induction]
Constructor Index
A
A [in Basics]add [in Poly]
aglio_e_olio [in Combo]
Ala [in Poly]
alfredo [in Combo]
Arg [in Poly]
Asn [in Poly]
Asp [in Poly]
AxiomaticSets.column_b [in Sets]
AxiomaticSets.column_a [in Sets]
B
black [in Basics]blue [in Basics]
bool_cons [in Poly]
bool_nil [in Poly]
BZ [in Induction]
C
C [in Basics]cons [in Poly]
cons' [in Poly]
copy [in Poly]
Cys [in Poly]
D
delete [in Poly]E
ev_SS [in IndProp]ev_0 [in IndProp]
ev'_sum [in IndProp]
ev'_2 [in IndProp]
ev'_0 [in IndProp]
exclude [in DNA]
ExplicitType.g_arc [in Graphs]
ExplicitType.g_vertex [in Graphs]
ExplicitType.g_empty [in Graphs]
F
false [in Basics]fettuccine [in Combo]
Forall_cons [in Sort]
Forall_nil [in Sort]
friday [in Basics]
fusilli [in Combo]
G
G [in Basics]Gln [in Poly]
Glu [in Poly]
Gly [in Poly]
green [in Basics]
H
His [in Poly]I
Ile [in Poly]L
Leu [in Poly]Lys [in Poly]
M
marinara [in Combo]matches_exclude [in DNA]
matches_oneof [in DNA]
matches_nil [in DNA]
meatballs [in Combo]
Met [in Poly]
monday [in Basics]
N
NatList.cons [in Lists]NatList.nil [in Lists]
NatList.None [in Lists]
NatList.pair [in Lists]
NatList.Some [in Lists]
NatPlayground.O [in Basics]
NatPlayground.S [in Basics]
NatPlayground.stop [in Basics]
NatPlayground.tick [in Basics]
ne_2 [in IndProp]
ne_1 [in IndProp]
nil [in Poly]
nil' [in Poly]
nn [in IndProp]
none [in Combo]
O
oneof [in DNA]OptionPlayground.None [in Poly]
OptionPlayground.Some [in Poly]
P
pair [in Poly]penne [in Combo]
perm_trans [in Sort]
perm_swap [in Sort]
perm_skip [in Sort]
perm_nil [in Sort]
Phe [in Poly]
Playground.le_S [in IndProp]
Playground.le_n [in IndProp]
primary [in Basics]
Pro [in Poly]
R
red [in Basics]rt_trans [in Rel]
rt_refl [in Rel]
rt_step [in Rel]
rt1n_trans [in Rel]
rt1n_refl [in Rel]
R.c1 [in IndProp]
R.c2 [in IndProp]
R.c3 [in IndProp]
R.c4 [in IndProp]
R.c5 [in IndProp]
S
saturday [in Basics]seafood [in Combo]
Ser [in Poly]
setlike_cons [in Graphs]
setlike_nil [in Graphs]
setlike_cons [in IndProp]
setlike_nil [in IndProp]
sorted_cons [in Sort]
sorted_1 [in Sort]
sorted_nil [in Sort]
spaghetti [in Combo]
sq [in IndProp]
STOP [in Poly]
substitute [in Poly]
sunday [in Basics]
T
T [in Basics]tagliatelle [in Combo]
Thr [in Poly]
thursday [in Basics]
Trp [in Poly]
true [in Basics]
tuesday [in Basics]
Tyr [in Poly]
T2 [in Induction]
T2P1 [in Induction]
V
Val [in Poly]vegetables [in Combo]
W
wednesday [in Basics]white [in Basics]
wrong_ev_SS [in IndProp]
wrong_ev_0 [in IndProp]
Axiom Index
A
AxiomaticSets.Empty [in Sets]AxiomaticSets.extensionality [in Sets]
AxiomaticSets.inclusion_exclusion [in Sets]
AxiomaticSets.Member [in Sets]
AxiomaticSets.member_spec_P [in Sets]
AxiomaticSets.member_universe [in Sets]
AxiomaticSets.member_empty [in Sets]
AxiomaticSets.P_member_spec [in Sets]
AxiomaticSets.set [in Sets]
AxiomaticSets.Spec [in Sets]
AxiomaticSets.Universe [in Sets]
E
ExplicitType.eq_dec_V [in Graphs]ExplicitType.X [in Graphs]
F
functional_extensionality [in Logic]Inductive Index
A
AxiomaticSets.two [in Sets]B
base [in Basics]bin [in Induction]
bool [in Basics]
boollist [in Poly]
C
clos_refl_trans_1n [in Rel]clos_refl_trans [in Rel]
codon [in Poly]
color [in Basics]
D
day [in Basics]E
edit [in Poly]ev [in IndProp]
ev' [in IndProp]
ExplicitType.graph [in Graphs]
F
Forall [in Sort]L
list [in Poly]list' [in Poly]
M
matches [in DNA]motif_element [in DNA]
N
NatList.natlist [in Lists]NatList.natoption [in Lists]
NatList.natprod [in Lists]
NatPlayground.nat [in Basics]
NatPlayground.nat' [in Basics]
next_ev [in IndProp]
next_nat [in IndProp]
nostutter [in IndProp2]
O
OptionPlayground.option [in Poly]P
pasta [in Combo]Permutation [in Sort]
Playground.le [in IndProp]
prod [in Poly]
R
rgb [in Basics]R.R [in IndProp]
S
sauce [in Combo]setlike [in Graphs]
setlike [in IndProp]
sorted [in Sort]
square_of [in IndProp]
subseq [in IndProp2]
T
topping [in Combo]W
wrong_ev [in IndProp]Definition Index
A
add_edit [in Poly]add_edit [in Tactics]
All [in Logic]
andb [in Basics]
andb3 [in Basics]
and_example' [in Logic]
and_example [in Logic]
antisymmetric [in Rel]
any [in DNA]
app [in Poly]
apply_edits [in Poly]
apply_edit [in Poly]
argmin3 [in Poly]
AxiomaticSets.bijective [in Sets]
AxiomaticSets.binary_relation [in Sets]
AxiomaticSets.cartesian_product [in Sets]
AxiomaticSets.codomain [in Sets]
AxiomaticSets.Complement [in Sets]
AxiomaticSets.compose [in Sets]
AxiomaticSets.countable [in Sets]
AxiomaticSets.diagonal_relation [in Sets]
AxiomaticSets.Difference [in Sets]
AxiomaticSets.domain [in Sets]
AxiomaticSets.empty_relation [in Sets]
AxiomaticSets.enigma [in Sets]
AxiomaticSets.enigma_fun [in Sets]
AxiomaticSets.even_nats' [in Sets]
AxiomaticSets.even_nats [in Sets]
AxiomaticSets.functional [in Sets]
AxiomaticSets.image [in Sets]
AxiomaticSets.infinitely_countable [in Sets]
AxiomaticSets.injective [in Sets]
AxiomaticSets.Intersection [in Sets]
AxiomaticSets.inverse_of [in Sets]
AxiomaticSets.manual_grade_for_enigma_converse [in Sets]
AxiomaticSets.nat_inj [in Sets]
AxiomaticSets.nat_natopt_bij [in Sets]
AxiomaticSets.nat_natopt_inj [in Sets]
AxiomaticSets.power_set [in Sets]
AxiomaticSets.preimage [in Sets]
AxiomaticSets.proper_subset [in Sets]
AxiomaticSets.reflexive [in Sets]
AxiomaticSets.related_in [in Sets]
AxiomaticSets.same_cardinality [in Sets]
AxiomaticSets.Singleton [in Sets]
AxiomaticSets.subset [in Sets]
AxiomaticSets.surjective [in Sets]
AxiomaticSets.symmetric [in Sets]
AxiomaticSets.ternary_relation [in Sets]
AxiomaticSets.total [in Sets]
AxiomaticSets.total_relation [in Sets]
AxiomaticSets.transitive [in Sets]
AxiomaticSets.unary_relation [in Sets]
AxiomaticSets.Union [in Sets]
B
bad_function [in Sort]bar [in Tactics]
beq_list [in Logic]
bin_to_nat [in Induction]
blt_nat [in Basics]
C
choose [in Combo]choose_two_of_six [in Combo]
combine [in Poly]
combine_odd_even [in Logic]
complement [in Basics]
complementary [in Poly]
complementary' [in Poly]
constfun [in Poly]
constfun_example2 [in Poly]
constfun_example1 [in Poly]
copy_edit [in Tactics]
cost [in Poly]
countoddmembers' [in Poly]
D
delete_add_edit [in Poly]delete_edit [in Poly]
delete_add_edit [in Tactics]
delete_edit [in Tactics]
de_morgan_not_and_not [in Logic]
discriminate_ex3 [in Tactics]
dna_tgt3 [in Poly]
dna_tgt2 [in Poly]
dna_tgt1 [in Poly]
dna_src [in Poly]
doit3times [in Poly]
double [in Induction]
double_negation_elimination [in Logic]
driving [in Combo]
E
edit_tgt3_valid [in Poly]edit_tgt3 [in Poly]
edit_tgt2_valid [in Poly]
edit_tgt2 [in Poly]
edit_tgt1_same [in Poly]
edit_tgt1_worse [in Poly]
edit_tgt1 [in Poly]
empty_natset [in Poly]
encode [in Poly]
encode_one_eg3 [in Poly]
encode_one_eg2 [in Poly]
encode_one_eg1 [in Poly]
encode_one [in Poly]
eqb [in Basics]
equivalence [in Rel]
eq_codon [in Poly]
eq_strand [in Poly]
eq_base [in Poly]
evenb [in Basics]
evens_to_ten' [in Poly]
evens_to_ten [in Poly]
even_1000'' [in Logic]
even_1000' [in Logic]
even_1000 [in Logic]
everywhere [in Sort]
everywhere_1_234 [in Sort]
exactly [in DNA]
excluded_middle [in Logic]
Exercises.prod_uncurry [in Poly]
Exercises.prod_curry [in Poly]
Exercises.test_map1' [in Poly]
exp [in Basics]
ExplicitType.degree [in Graphs]
ExplicitType.in_degree [in Graphs]
ExplicitType.num_edges [in Graphs]
ExplicitType.out_degree [in Graphs]
ExplicitType.sum_vertex_degree [in Graphs]
F
factorial [in Basics]factorial [in Combo]
fact_5__120 [in Combo]
fact_0__1 [in Combo]
filter [in Poly]
filter_even_gt7 [in Poly]
flat_map [in Poly]
flat_map [in Sort]
foo [in Tactics]
forallb [in Logic]
fst [in Poly]
ftrue [in Poly]
function_equality_ex2 [in Logic]
function_equality_ex2 [in Logic]
function_equality_ex1 [in Logic]
H
half [in Basics]half_nine_is_four [in Basics]
half_four_is_two [in Basics]
hd_error [in Poly]
I
impb [in Basics]implies_to_or [in Logic]
In [in Logic]
incr [in Induction]
injection_ex3 [in Tactics]
injective [in Logic]
insert [in Poly]
insert [in Sort]
intersection [in Poly]
intersection [in IndProp]
In_example_2 [in Logic]
In_example_1 [in Logic]
isred [in Basics]
isred' [in Basics]
is_weekday [in Basics]
is_even_prime [in Logic]
is_three [in Logic]
is_amino [in Poly]
is_setlike [in Poly]
is_setlike [in IndProp]
is_a_sorting_algorithm [in Sort]
is_N_glycosylation_motif [in DNA]
L
leb [in Basics]lemma_application_ex [in Logic]
length [in Poly]
length_is_1 [in Poly]
levenshtein [in Tactics]
levenshtein [in Tactics]
levenshtein_distance [in Tactics]
levenshtein__sub_edit_cost [in Tactics]
levenshtein__sub_edit_tgt [in Tactics]
levenshtein__sub_edit_src [in Tactics]
list123 [in Poly]
list123' [in Poly]
list123'' [in Poly]
list123''' [in Poly]
lt [in IndProp]
M
manual_grade_for_basics3 [in Basics]manual_grade_for_negation_fn_applied_twice [in Basics]
manual_grade_for_third [in Basics]
manual_grade_for_half [in Basics]
manual_grade_for_andb3 [in Basics]
manual_grade_for_impb [in Basics]
manual_grade_for_nandb [in Basics]
manual_grade_for_subset_iff [in Logic]
manual_grade_for_In_intersection_iff [in Logic]
manual_grade_for_delete_add_edit [in Poly]
manual_grade_for_add_edit [in Poly]
manual_grade_for_delete_edit [in Poly]
manual_grade_for_edit_tgt23_minimal [in Poly]
manual_grade_for_subset [in Poly]
manual_grade_for_intersection [in Poly]
manual_grade_for_is_setlike [in Poly]
manual_grade_for_map_option_id [in Poly]
manual_grade_for_binary_inverse [in Induction]
manual_grade_for_binary_commute [in Induction]
manual_grade_for_pal_pal_app_rev_pal_rev [in IndProp2]
manual_grade_for_check_nostutter_def [in IndProp2]
manual_grade_for_empty_relation [in IndProp]
manual_grade_for_total_relation [in IndProp]
manual_grade_for_split_combine [in Tactics]
manual_grade_for_levenshtein_distance [in Tactics]
manual_grade_for_sub_edit [in Tactics]
map [in Poly]
map_option' [in Poly]
map_option [in Poly]
matches_motif [in DNA]
matches_motif_element [in DNA]
member [in Poly]
minustwo [in Basics]
min3 [in Tactics]
monochrome [in Basics]
monotonic [in Sort]
motif [in DNA]
MyIff.iff [in Logic]
mynil [in Poly]
mynil [in Poly]
mynil' [in Poly]
MyNot.not [in Logic]
N
naive_sub_edit [in Tactics]nandb [in Basics]
NatList.alternate [in Lists]
NatList.app [in Lists]
NatList.countoddmembers [in Lists]
NatList.eqblist [in Lists]
NatList.fst [in Lists]
NatList.fst' [in Lists]
NatList.hd [in Lists]
NatList.hd_error [in Lists]
NatList.length [in Lists]
NatList.mylist [in Lists]
NatList.mylist1 [in Lists]
NatList.mylist2 [in Lists]
NatList.mylist3 [in Lists]
NatList.nonzeros [in Lists]
NatList.nth_error' [in Lists]
NatList.nth_error [in Lists]
NatList.nth_bad [in Lists]
NatList.ntoone [in Lists]
NatList.oddmembers [in Lists]
NatList.odds [in Lists]
NatList.ones [in Lists]
NatList.option_elim [in Lists]
NatList.repeat [in Lists]
NatList.rev [in Lists]
NatList.snd [in Lists]
NatList.snd' [in Lists]
NatList.sum_natlist [in Lists]
NatList.swap_pair [in Lists]
NatList.test_hd_error3 [in Lists]
NatList.test_hd_error2 [in Lists]
NatList.test_hd_error1 [in Lists]
NatList.test_nth_error3 [in Lists]
NatList.test_nth_error2 [in Lists]
NatList.test_nth_error1 [in Lists]
NatList.test_eqblist3 [in Lists]
NatList.test_eqblist2 [in Lists]
NatList.test_eqblist1 [in Lists]
NatList.test_rev2 [in Lists]
NatList.test_rev1 [in Lists]
NatList.test_alternate4 [in Lists]
NatList.test_alternate3 [in Lists]
NatList.test_alternate2 [in Lists]
NatList.test_alternate1 [in Lists]
NatList.test_countoddmembers3 [in Lists]
NatList.test_countoddmembers2 [in Lists]
NatList.test_countoddmembers1 [in Lists]
NatList.test_oddmembers [in Lists]
NatList.test_nonzeros [in Lists]
NatList.test_tl [in Lists]
NatList.test_hd2 [in Lists]
NatList.test_hd1 [in Lists]
NatList.test_app3 [in Lists]
NatList.test_app2 [in Lists]
NatList.test_app1 [in Lists]
NatList.tl [in Lists]
NatPlayground.pred [in Basics]
NatPlayground2.minus [in Basics]
NatPlayground2.mult [in Basics]
NatPlayground2.plus [in Basics]
NatPlayground2.test_mult1 [in Basics]
natset [in Poly]
negb [in Basics]
next_weekday [in Basics]
nth [in Sort]
nth_error [in Poly]
nth_default [in Sort]
nth_in_list [in Sort]
N_glycosylation [in DNA]
O
oddb [in Basics]option_map [in Poly]
orb [in Basics]
order [in Rel]
P
partial_function [in Rel]partition [in Poly]
pastas [in Combo]
peirce [in Logic]
permutations [in Sort]
permutations_1234 [in Sort]
permutation_eg [in Sort]
plus_is_O [in Logic]
plus_fact [in Logic]
plus' [in Basics]
plus3 [in Poly]
preorder [in Rel]
preserves_sortedness [in Sort]
product [in Combo]
product_example2 [in Combo]
product_example1 [in Combo]
R
reflexive [in Rel]relation [in Rel]
remove [in Poly]
remove_first [in Graphs]
repeat [in Poly]
repeat' [in Poly]
repeat'' [in Poly]
repeat''' [in Poly]
rev [in Poly]
rev_append [in Logic]
route_options [in Combo]
R.fR [in IndProp]
R.manual_grade_for_R_fact [in IndProp]
S
sauces [in Combo]setlike_eg2 [in IndProp]
setlike_eg1 [in IndProp]
sillyfun [in Tactics]
sillyfun1 [in Tactics]
snd [in Poly]
sort [in Sort]
sorted_one_through_four [in Sort]
sorted' [in Sort]
sort_pi [in Sort]
split [in Poly]
split [in Tactics]
split_combine_statement [in Tactics]
square [in Tactics]
strand [in Poly]
strong_induction_principle [in IndProp]
subset [in Poly]
subset [in IndProp]
sub_edit [in Tactics]
sum [in Graphs]
sum_map [in Graphs]
sum_nm [in Combo]
symmetric [in Rel]
T
test_blt_nat3 [in Basics]test_blt_nat2 [in Basics]
test_blt_nat1 [in Basics]
test_leb3 [in Basics]
test_leb2 [in Basics]
test_leb1 [in Basics]
test_factorial2 [in Basics]
test_factorial1 [in Basics]
test_oddb2 [in Basics]
test_oddb1 [in Basics]
test_andb34 [in Basics]
test_andb33 [in Basics]
test_andb32 [in Basics]
test_andb31 [in Basics]
test_nandb4 [in Basics]
test_nandb3 [in Basics]
test_nandb2 [in Basics]
test_nandb1 [in Basics]
test_orb5 [in Basics]
test_orb4 [in Basics]
test_orb3 [in Basics]
test_orb2 [in Basics]
test_orb1 [in Basics]
test_next_weekday [in Basics]
test_plus3'' [in Poly]
test_plus3' [in Poly]
test_plus3 [in Poly]
test_flat_map1 [in Poly]
test_map3 [in Poly]
test_map2 [in Poly]
test_map1 [in Poly]
test_partition2 [in Poly]
test_partition1 [in Poly]
test_filter_even_gt7_2 [in Poly]
test_filter_even_gt7_1 [in Poly]
test_filter2' [in Poly]
test_anon_fun' [in Poly]
test_countoddmembers'3 [in Poly]
test_countoddmembers'2 [in Poly]
test_countoddmembers'1 [in Poly]
test_filter2 [in Poly]
test_filter1 [in Poly]
test_doit3times' [in Poly]
test_doit3times [in Poly]
test_hd_error2 [in Poly]
test_hd_error1 [in Poly]
test_nth_error3 [in Poly]
test_nth_error2 [in Poly]
test_nth_error1 [in Poly]
test_split [in Poly]
test_length1 [in Poly]
test_rev2 [in Poly]
test_rev1 [in Poly]
test_repeat2 [in Poly]
test_repeat1 [in Poly]
test_nostutter_4 [in IndProp2]
test_nostutter_3 [in IndProp2]
test_nostutter_2 [in IndProp2]
test_nostutter_1 [in IndProp2]
third [in Basics]
third_nine_is_three [in Basics]
third_four_is_one [in Basics]
toppings [in Combo]
total_cost [in Poly]
train [in Combo]
transitive [in Rel]
trans_eq_exercise [in Tactics]
trans_eq_example' [in Tactics]
trans_eq_example [in Tactics]
tr_rev [in Logic]
U
union [in Poly]V
valid_edit [in Poly]W
weak_induction_principle [in IndProp]| Global Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (1072 entries) |
| Notation Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (22 entries) |
| Module Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (11 entries) |
| Library Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (17 entries) |
| Lemma Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (423 entries) |
| Constructor Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (123 entries) |
| Axiom Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (14 entries) |
| Inductive Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (42 entries) |
| Definition Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | other | (420 entries) |
This page has been generated by coqdoc