Theorems · Theorem · order theory
isGLB_biInf
∀ {α : Type u_1} {β : Type u_2} [inst : CompleteLattice α] {s : Set β} {f : β → α}, IsGLB (f '' s) (⨅ x ∈ s, f x)- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 18 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.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Elemproof · cited by 7,166
- Set.imagestatement and proof · cited by 5,609
- iInfstatement and proof · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- Set.range_compproof · cited by 223
- IsGLBstatement and proof · cited by 213
- Subtype.range_coeproof · cited by 98
- iInf_subtype'proof · cited by 34
- isGLB_iInfproof · cited by 7
Cited by4
Results whose statement or proof uses this declaration.
- Sion.minimax'proof · cited by 1
- Submodule.isGLB_sInfproof · cited by 0
- Subfield.isGLB_sInfproof · cited by 0
- LieSubalgebra.sInf_glbproof · cited by 0