Theorems · Theorem · combinatorics
Finset.truncatedInf_sups_of_notMem
∀ {α : Type u_1} [inst : DistribLattice α] [inst_1 : DecidableEq α] {s t : Finset α} {a : α} [inst_2 : DecidableLE α]
[inst_3 : BoundedOrder α], a ∉ upperClosure ↑s ⊔ upperClosure ↑t → (s ⊻ t).truncatedInf 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
- SetLike.coestatement and proof · cited by 8,199
- Bot.botstatement · cited by 4,720
- BoundedOrderstatement and proof · cited by 270
- UpperSetstatement and proof · cited by 245
- DistribLatticestatement and proof · cited by 150
- HasSups.supsstatement · cited by 103
- upperClosurestatement and proof · cited by 84
- Finset.hasSupsstatement · cited by 61
- Finset.truncatedInfstatement · cited by 19
- Finset.truncatedInf_of_notMemproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Finset.card_truncatedInf_union_add_card_truncatedInf_supsproof · cited by 1