Theorems · Theorem · order theory
Finset.sup_attach
∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeSup α] [inst_1 : OrderBot α] (s : Finset β) (f : β → α),
(s.attach.sup fun x => f ↑x) = s.sup f- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeSupOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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.botproof · cited by 4,720
- OrderBotstatement and proof · cited by 1,055
- SemilatticeSupstatement and proof · cited by 785
- Finset.supstatement · cited by 530
- Finset.attachstatement and proof · cited by 168
- Function.Embedding.subtypeproof · cited by 128
- Finset.foldproof · cited by 46
- Finset.sup_mapproof · cited by 7
- Finset.attach_map_valproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.