Theorems · Theorem · order theory
Finset.sup_erase_bot
∀ {α : Type u_2} [inst : SemilatticeSup α] [inst_1 : OrderBot α] [inst_2 : DecidableEq α] (s : Finset α),
(s.erase ⊥).sup id = s.sup id- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Bot.botstatement and proof · cited by 4,720
- eq_or_neproof · cited by 1,117
- OrderBotstatement and proof · cited by 1,055
- SemilatticeSupstatement and proof · cited by 785
- Finset.supstatement · cited by 530
- LE.le.antisymmproof · cited by 507
- Finset.erasestatement · cited by 455
- bot_leproof · cited by 306
- Finset.le_supproof · cited by 112
- Finset.mem_eraseproof · cited by 61
- Finset.erase_subsetproof · cited by 31
Cited by2
Results whose statement or proof uses this declaration.
- iSupIndep_iff_supIndepproof · cited by 2
- iSupIndep_iff_supIndep_of_injOnproof · cited by 0