Theorems · Theorem · order theory
iSup_ne_bot_subtype
∀ {α : Type u_1} {ι : Sort u_4} [inst : CompleteLattice α] (f : ι → α), ⨆ i, f ↑i = ⨆ i, f iWhen taking the supremum of f : ι → α, the elements of ι on which f gives ⊥ can be
dropped, without changing the result.
- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement and proof · cited by 4,720
- iSupstatement and proof · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- Eq.leproof · cited by 605
- LE.le.antisymmproof · cited by 507
- bot_leproof · cited by 306
- iSup_botproof · cited by 29
- iSup_mono'proof · cited by 17
- iSup_comp_leproof · cited by 4
Cited by3
Results whose statement or proof uses this declaration.
- LieModule.iSup_genWeightSpace_eq_top'proof · cited by 5
- DirectSum.isInternal_ne_bot_iffproof · cited by 2
- LinearMap.IsSymmetric.orthogonalComplement_iSup_eigenspaces_eq_bot'proof · cited by 1