Theorems · Theorem · order theory
iSup_sup
∀ {α : Type u_1} {ι : Sort u_4} [inst : CompleteLattice α] [Nonempty ι] {f : ι → α} {a : α},
(⨆ x, f x) ⊔ a = ⨆ x, f x ⊔ a- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Quot.sound
- Assumes
- CompleteLatticeNonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- iSupstatement and proof · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- iSup_constproof · cited by 13
- iSup_sup_eqproof · cited by 7
Cited by3
Results whose statement or proof uses this declaration.
- Set.iUnion_unionproof · cited by 3
- biSup_supproof · cited by 2
- Language.iSup_addproof · cited by 0