Commit 2021-05-07 09:30 b20e6647

View on Github →

feat(order/well_founded_set): Higman's Lemma (#7212) Proves Higman's Lemma: if r is partially well-ordered on s, then list.sublist_forall2 is partially well-ordered on the set of lists whose elements are in s.

Estimated changes

Modified docs/references.bib

Modified src/order/well_founded_set.lean

modified theorem finset.is_pwo

modified theorem finset.is_wf

modified theorem finset.partially_well_ordered_on

modified theorem finset.well_founded_on

added theorem set.partially_well_ordered_on.exists_min_bad_of_exists_bad

added theorem set.partially_well_ordered_on.iff_forall_not_is_bad_seq

added theorem set.partially_well_ordered_on.iff_not_exists_is_min_bad_seq

added def set.partially_well_ordered_on.is_bad_seq

added def set.partially_well_ordered_on.is_min_bad_seq

added theorem set.partially_well_ordered_on.partially_well_ordered_on_sublist_forall₂