Theorems · Theorem · combinatorics
Finset.truncatedSup_infs_of_notMem
∀ {α : Type u_1} [inst : DistribLattice α] [inst_1 : DecidableEq α] {s t : Finset α} {a : α} [inst_2 : DecidableLE α]
[inst_3 : BoundedOrder α], a ∉ lowerClosure ↑s ⊓ lowerClosure ↑t → (s ⊼ t).truncatedSup a = ⊤- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 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.
- Setproof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- Top.topstatement · cited by 9,680
- SetLike.coestatement and proof · cited by 8,199
- BoundedOrderstatement and proof · cited by 270
- LowerSetstatement and proof · cited by 230
- DistribLatticestatement and proof · cited by 150
- HasInfs.infsstatement · cited by 105
- lowerClosurestatement and proof · cited by 83
- Finset.hasInfsstatement · cited by 62
- Finset.truncatedSupstatement · cited by 19
- Finset.truncatedSup_of_notMemproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_truncatedSup_union_add_card_truncatedSup_infsproof · cited by 1