Theorems · Theorem · order theory
GaloisConnection.u_inf
∀ {β : Type u} {α : Type v} {b₁ b₂ : β} [inst : SemilatticeInf β] [inst_1 : SemilatticeInf α] {u : β → α} {l : α → β},
GaloisConnection l u → u (b₁ ⊓ b₂) = u b₁ ⊓ u b₂- Defined in
- Mathlib.Order.GaloisConnection.Basic
- Cited by
- 37 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeInfSemilatticeInf
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SemilatticeInfstatement and proof · cited by 634
- GaloisConnectionstatement and proof · cited by 253
- IsGLBproof · cited by 213
- Set.image_pairproof · cited by 14
- IsGLB.uniqueproof · cited by 13
- isGLB_pairproof · cited by 5
- GaloisConnection.isGLB_u_imageproof · cited by 4
Cited by37
Results whose statement or proof uses this declaration.
- Filter.comap_infproof · cited by 33
- induced_infproof · cited by 12
- GaloisCoinsertion.u_inf_lproof · cited by 9
- GaloisInsertion.l_inf_uproof · cited by 9
- Submodule.supIndep_torsionBySet_idealproof · cited by 4
- nhds_infproof · cited by 2
- Submodule.dualCoannihilator_sup_eqproof · cited by 1
- Filter.ker_infproof · cited by 1
- AlgebraicGeometry.Scheme.IdealSheafData.map_infproof · cited by 0
- PrimeSpectrum.vanishingIdeal_unionproof · cited by 0
- Filter.sup_sets_eqproof · cited by 0
- fixedPoints_addSubgroup_supproof · cited by 0