Loogle!
Result
Found 249 declarations mentioning BoundedLatticeHom. Of these, only the first 200 are shown.
- BoundedLatticeHom.id 📋 Mathlib.Order.Hom.BoundedLattice
(α : Type u_2) [Lattice α] [BoundedOrder α] : BoundedLatticeHom α α - BoundedLatticeHom.instInhabited 📋 Mathlib.Order.Hom.BoundedLattice
(α : Type u_2) [Lattice α] [BoundedOrder α] : Inhabited (BoundedLatticeHom α α) - BoundedLatticeHom 📋 Mathlib.Order.Hom.BoundedLattice
(α : Type u_6) (β : Type u_7) [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] : Type (max u_6 u_7) - BoundedLatticeHom.instFunLike 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] : FunLike (BoundedLatticeHom α β) α β - BoundedLatticeHom.toLatticeHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_6} {β : Type u_7} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (self : BoundedLatticeHom α β) : LatticeHom α β - BoundedLatticeHom.coe_id 📋 Mathlib.Order.Hom.BoundedLattice
(α : Type u_2) [Lattice α] [BoundedOrder α] : ⇑(BoundedLatticeHom.id α) = id - BoundedLatticeHom.id_apply 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} [Lattice α] [BoundedOrder α] (a : α) : (BoundedLatticeHom.id α) a = a - BoundedLatticeHom.instBoundedLatticeHomClass 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] : BoundedLatticeHomClass (BoundedLatticeHom α β) α β - instCoeTCBoundedLatticeHomOfBoundedLatticeHomClass 📋 Mathlib.Order.Hom.BoundedLattice
{F : Type u_1} {α : Type u_2} {β : Type u_3} [FunLike F α β] [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] [BoundedLatticeHomClass F α β] : CoeTC F (BoundedLatticeHom α β) - BoundedLatticeHom.toBoundedOrderHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : BoundedOrderHom α β - BoundedLatticeHom.comp_id 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : f.comp (BoundedLatticeHom.id α) = f - BoundedLatticeHom.id_comp 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : (BoundedLatticeHom.id β).comp f = f - BoundedLatticeHom.comp 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : BoundedLatticeHom α γ - BoundedLatticeHom.copy 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) (f' : α → β) (h : f' = ⇑f) : BoundedLatticeHom α β - BoundedLatticeHom.dual 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Lattice β] [BoundedOrder β] : BoundedLatticeHom α β ≃ BoundedLatticeHom αᵒᵈ βᵒᵈ - BoundedLatticeHom.coe_toLatticeHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : ⇑f.toLatticeHom = ⇑f - BoundedLatticeHom.copy_eq 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) (f' : α → β) (h : f' = ⇑f) : f.copy f' h = f - BoundedLatticeHom.toFun_eq_coe 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : f.toFun = ⇑f - BoundedLatticeHom.coe_copy 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) (f' : α → β) (h : f' = ⇑f) : ⇑(f.copy f' h) = f' - BoundedLatticeHom.toInfTopHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_6} {β : Type u_7} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (self : BoundedLatticeHom α β) : InfTopHom α β - BoundedLatticeHom.toSupBotHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_6} {β : Type u_7} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (self : BoundedLatticeHom α β) : SupBotHom α β - BoundedLatticeHom.ext 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] {f g : BoundedLatticeHom α β} (h : ∀ (a : α), f a = g a) : f = g - BoundedLatticeHom.ext_iff 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] {f g : BoundedLatticeHom α β} : f = g ↔ ∀ (a : α), f a = g a - BoundedLatticeHom.coe_toBoundedOrderHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : ⇑f.toBoundedOrderHom = ⇑f - BoundedLatticeHom.map_bot' 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_6} {β : Type u_7} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (self : BoundedLatticeHom α β) : self.toFun ⊥ = ⊥ - BoundedLatticeHom.map_top' 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_6} {β : Type u_7} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (self : BoundedLatticeHom α β) : self.toFun ⊤ = ⊤ - BoundedLatticeHom.cancel_left 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] {g : BoundedLatticeHom β γ} {f₁ f₂ : BoundedLatticeHom α β} (hg : Function.Injective ⇑g) : g.comp f₁ = g.comp f₂ ↔ f₁ = f₂ - BoundedLatticeHom.cancel_right 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] {g₁ g₂ : BoundedLatticeHom β γ} {f : BoundedLatticeHom α β} (hf : Function.Surjective ⇑f) : g₁.comp f = g₂.comp f ↔ g₁ = g₂ - BoundedLatticeHom.comp_apply 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) (a : α) : (f.comp g) a = f (g a) - BoundedLatticeHom.subtypeVal 📋 Mathlib.Order.Hom.BoundedLattice
{β : Type u_3} [Lattice β] [BoundedOrder β] {P : β → Prop} (Pbot : P ⊥) (Ptop : P ⊤) (Psup : ∀ ⦃x y : β⦄, P x → P y → P (x ⊔ y)) (Pinf : ∀ ⦃x y : β⦄, P x → P y → P (x ⊓ y)) : BoundedLatticeHom { x // P x } β - BoundedLatticeHom.coe_comp 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : ⇑(f.comp g) = ⇑f ∘ ⇑g - BoundedLatticeHom.comp_assoc 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {δ : Type u_5} [Lattice α] [Lattice β] [Lattice γ] [Lattice δ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] [BoundedOrder δ] (f : BoundedLatticeHom γ δ) (g : BoundedLatticeHom β γ) (h : BoundedLatticeHom α β) : (f.comp g).comp h = f.comp (g.comp h) - BoundedLatticeHom.mk 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_6} {β : Type u_7} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (toLatticeHom : LatticeHom α β) (map_top' : toLatticeHom.toFun ⊤ = ⊤) (map_bot' : toLatticeHom.toFun ⊥ = ⊥) : BoundedLatticeHom α β - BoundedLatticeHom.coe_toInfTopHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : ⇑f.toInfTopHom = ⇑f - BoundedLatticeHom.coe_toSupBotHom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : BoundedLatticeHom α β) : ⇑f.toSupBotHom = ⇑f - BoundedLatticeHom.subtypeVal_coe 📋 Mathlib.Order.Hom.BoundedLattice
{β : Type u_3} [Lattice β] [BoundedOrder β] {P : β → Prop} (Pbot : P ⊥) (Ptop : P ⊤) (Psup : ∀ ⦃x y : β⦄, P x → P y → P (x ⊔ y)) (Pinf : ∀ ⦃x y : β⦄, P x → P y → P (x ⊓ y)) : ⇑(BoundedLatticeHom.subtypeVal Pbot Ptop Psup Pinf) = Subtype.val - BoundedLatticeHom.subtypeVal_apply 📋 Mathlib.Order.Hom.BoundedLattice
{β : Type u_3} [Lattice β] [BoundedOrder β] {P : β → Prop} (Pbot : P ⊥) (Ptop : P ⊤) (Psup : ∀ ⦃x y : β⦄, P x → P y → P (x ⊔ y)) (Pinf : ∀ ⦃x y : β⦄, P x → P y → P (x ⊓ y)) (x : { x // P x }) : (BoundedLatticeHom.subtypeVal Pbot Ptop Psup Pinf) x = ↑x - BoundedLatticeHom.coe_mk 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [Lattice β] [BoundedOrder α] [BoundedOrder β] (f : LatticeHom α β) (hf : f.toFun ⊤ = ⊤) (hf' : f.toFun ⊥ = ⊥) : ⇑{ toLatticeHom := f, map_top' := hf, map_bot' := hf' } = ⇑f - BoundedLatticeHom.dual_id 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} [Lattice α] [BoundedOrder α] : BoundedLatticeHom.dual (BoundedLatticeHom.id α) = BoundedLatticeHom.id αᵒᵈ - BoundedLatticeHom.symm_dual_id 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} [Lattice α] [BoundedOrder α] : BoundedLatticeHom.dual.symm (BoundedLatticeHom.id αᵒᵈ) = BoundedLatticeHom.id α - BoundedLatticeHom.dual_apply_toFun 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Lattice β] [BoundedOrder β] (f : BoundedLatticeHom α β) (a : α) : (BoundedLatticeHom.dual f) a = f a - BoundedLatticeHom.dual_symm_apply_toFun 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Lattice β] [BoundedOrder β] (f : BoundedLatticeHom αᵒᵈ βᵒᵈ) (a : αᵒᵈ) : (BoundedLatticeHom.dual.symm f) a = f a - BoundedLatticeHom.coe_comp_lattice_hom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : { toFun := ⇑(f.comp g), map_sup' := ⋯, map_inf' := ⋯ } = { toFun := ⇑f, map_sup' := ⋯, map_inf' := ⋯ }.comp { toFun := ⇑g, map_sup' := ⋯, map_inf' := ⋯ } - BoundedLatticeHom.coe_comp_inf_hom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : { toFun := ⇑(f.comp g), map_inf' := ⋯ } = { toFun := ⇑f, map_inf' := ⋯ }.comp { toFun := ⇑g, map_inf' := ⋯ } - BoundedLatticeHom.coe_comp_sup_hom 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : { toFun := ⇑(f.comp g), map_sup' := ⋯ } = { toFun := ⇑f, map_sup' := ⋯ }.comp { toFun := ⇑g, map_sup' := ⋯ } - BoundedLatticeHom.coe_comp_inf_hom' 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : { toFun := ⇑f ∘ ⇑g, map_inf' := ⋯ } = { toFun := ⇑f, map_inf' := ⋯ }.comp { toFun := ⇑g, map_inf' := ⋯ } - BoundedLatticeHom.coe_comp_sup_hom' 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : { toFun := ⇑f ∘ ⇑g, map_sup' := ⋯ } = { toFun := ⇑f, map_sup' := ⋯ }.comp { toFun := ⇑g, map_sup' := ⋯ } - BoundedLatticeHom.coe_comp_lattice_hom' 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [Lattice β] [Lattice γ] [BoundedOrder α] [BoundedOrder β] [BoundedOrder γ] (f : BoundedLatticeHom β γ) (g : BoundedLatticeHom α β) : { toSupHom := { toFun := ⇑f, map_sup' := ⋯ }.comp { toFun := ⇑g, map_sup' := ⋯ }, map_inf' := ⋯ } = { toFun := ⇑f, map_sup' := ⋯, map_inf' := ⋯ }.comp { toFun := ⇑g, map_sup' := ⋯, map_inf' := ⋯ } - BoundedLatticeHom.dual_comp 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [BoundedOrder α] [Lattice β] [BoundedOrder β] [Lattice γ] [BoundedOrder γ] (g : BoundedLatticeHom β γ) (f : BoundedLatticeHom α β) : BoundedLatticeHom.dual (g.comp f) = (BoundedLatticeHom.dual g).comp (BoundedLatticeHom.dual f) - BoundedLatticeHom.symm_dual_comp 📋 Mathlib.Order.Hom.BoundedLattice
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [BoundedOrder α] [Lattice β] [BoundedOrder β] [Lattice γ] [BoundedOrder γ] (g : BoundedLatticeHom βᵒᵈ γᵒᵈ) (f : BoundedLatticeHom αᵒᵈ βᵒᵈ) : BoundedLatticeHom.dual.symm (g.comp f) = (BoundedLatticeHom.dual.symm g).comp (BoundedLatticeHom.dual.symm f) - LatticeHom.withBotWithTop' 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] [BoundedOrder β] (f : LatticeHom α β) : BoundedLatticeHom (WithBot (WithTop α)) β - LatticeHom.withTopWithBot' 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] [BoundedOrder β] (f : LatticeHom α β) : BoundedLatticeHom (WithTop (WithBot α)) β - LatticeHom.withBotWithTop 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] (f : LatticeHom α β) : BoundedLatticeHom (WithBot (WithTop α)) (WithBot (WithTop β)) - LatticeHom.withTopWithBot 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] (f : LatticeHom α β) : BoundedLatticeHom (WithTop (WithBot α)) (WithTop (WithBot β)) - LatticeHom.withBotWithTop_id 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} [Lattice α] : (LatticeHom.id α).withBotWithTop = BoundedLatticeHom.id (WithBot (WithTop α)) - LatticeHom.withTopWithBot_id 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} [Lattice α] : (LatticeHom.id α).withTopWithBot = BoundedLatticeHom.id (WithTop (WithBot α)) - LatticeHom.withBotWithTop'_toFun 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] [BoundedOrder β] (f : LatticeHom α β) (a : WithBot (WithTop α)) : f.withBotWithTop' a = Option.elim a ⊥ ⇑f.withTop' - LatticeHom.withTopWithBot'_toFun 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] [BoundedOrder β] (f : LatticeHom α β) (a : WithTop (WithBot α)) : f.withTopWithBot' a = Option.elim a ⊤ ⇑f.withBot' - LatticeHom.coe_withBotWithTop 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] (f : LatticeHom α β) : ⇑f.withBotWithTop = WithBot.map (WithTop.map ⇑f) - LatticeHom.coe_withTopWithBot 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] (f : LatticeHom α β) : ⇑f.withTopWithBot = WithTop.map (WithBot.map ⇑f) - LatticeHom.withBotWithTop_apply 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] (f : LatticeHom α β) (a : WithBot (WithTop α)) : f.withBotWithTop a = WithBot.map (WithTop.map ⇑f) a - LatticeHom.withTopWithBot_apply 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} [Lattice α] [Lattice β] (f : LatticeHom α β) (a : WithTop (WithBot α)) : f.withTopWithBot a = WithTop.map (WithBot.map ⇑f) a - LatticeHom.withBotWithTop_comp 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [Lattice α] [Lattice β] [Lattice γ] (f : LatticeHom β γ) (g : LatticeHom α β) : (f.comp g).withBotWithTop = f.withBotWithTop.comp g.withBotWithTop - LatticeHom.withTopWithBot_comp 📋 Mathlib.Order.Hom.WithTopBot
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [Lattice α] [Lattice β] [Lattice γ] (f : LatticeHom β γ) (g : LatticeHom α β) : (f.comp g).withTopWithBot = f.withTopWithBot.comp g.withTopWithBot - CompleteLatticeHom.toBoundedLatticeHom 📋 Mathlib.Order.Hom.CompleteLattice
{α : Type u_2} {β : Type u_3} [CompleteLattice α] [CompleteLattice β] (f : CompleteLatticeHom α β) : BoundedLatticeHom α β - CompleteLatticeHom.coe_toBoundedLatticeHom 📋 Mathlib.Order.Hom.CompleteLattice
{α : Type u_2} {β : Type u_3} [CompleteLattice α] [CompleteLattice β] (f : CompleteLatticeHom α β) : ⇑f.toBoundedLatticeHom = ⇑f - BoundedLatticeHom.asBoolRing 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} {β : Type u_2} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) : AsBoolRing α →+* AsBoolRing β - RingHom.asBoolAlg 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} {β : Type u_2} [BooleanRing α] [BooleanRing β] (f : α →+* β) : BoundedLatticeHom (AsBoolAlg α) (AsBoolAlg β) - RingHom.asBoolAlg_id 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} [BooleanRing α] : (RingHom.id α).asBoolAlg = BoundedLatticeHom.id (AsBoolAlg α) - BoundedLatticeHom.asBoolRing_comp 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] [BooleanAlgebra γ] (g : BoundedLatticeHom β γ) (f : BoundedLatticeHom α β) : (g.comp f).asBoolRing = g.asBoolRing.comp f.asBoolRing - RingHom.asBoolAlg_comp 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [BooleanRing α] [BooleanRing β] [BooleanRing γ] (g : β →+* γ) (f : α →+* β) : (g.comp f).asBoolAlg = g.asBoolAlg.comp f.asBoolAlg - BoundedLatticeHom.asBoolRing_apply 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} {β : Type u_2} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (a✝ : AsBoolRing α) : f.asBoolRing a✝ = (⇑toBoolRing ∘ ⇑f ∘ ⇑ofBoolRing) a✝ - RingHom.asBoolAlg_toFun 📋 Mathlib.Algebra.Ring.BooleanRing
{α : Type u_1} {β : Type u_2} [BooleanRing α] [BooleanRing β] (f : α →+* β) (a✝ : AsBoolAlg α) : f.asBoolAlg a✝ = (⇑toBoolAlg ∘ ⇑f ∘ ⇑ofBoolAlg) a✝ - BddLat.Hom.hom 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} (f : X.Hom Y) : BoundedLatticeHom ↑X.toLat ↑Y.toLat - BddLat.Hom.hom' 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} (self : X.Hom Y) : BoundedLatticeHom ↑X.toLat ↑Y.toLat - BddLat.Hom.Simps.hom 📋 Mathlib.Order.Category.BddLat
(X Y : BddLat) (f : X.Hom Y) : BoundedLatticeHom ↑X.toLat ↑Y.toLat - BddLat.Hom.ext 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} {x y : X.Hom Y} (hom' : x.hom' = y.hom') : x = y - BddLat.Hom.ext_iff 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} {x y : X.Hom Y} : x = y ↔ x.hom' = y.hom' - BddLat.instConcreteCategoryBoundedLatticeHomCarrier 📋 Mathlib.Order.Category.BddLat
: CategoryTheory.ConcreteCategory BddLat fun x1 x2 => BoundedLatticeHom ↑x1.toLat ↑x2.toLat - BddLat.ofHom 📋 Mathlib.Order.Category.BddLat
{X Y : Type u} [Lattice X] [BoundedOrder X] [Lattice Y] [BoundedOrder Y] (f : BoundedLatticeHom X Y) : BddLat.of X ⟶ BddLat.of Y - BddLat.hom_ext 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} {f g : X ⟶ Y} (hf : BddLat.Hom.hom f = BddLat.Hom.hom g) : f = g - BddLat.hom_ext_iff 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} {f g : X ⟶ Y} : f = g ↔ BddLat.Hom.hom f = BddLat.Hom.hom g - BddLat.hasForgetToLat 📋 Mathlib.Order.Category.BddLat
: CategoryTheory.HasForget₂ BddLat Lat - latToBddLatForgetAdjunction 📋 Mathlib.Order.Category.BddLat
: latToBddLat ⊣ CategoryTheory.forget₂ BddLat Lat - BddLat.coe_forget_to_lat 📋 Mathlib.Order.Category.BddLat
(X : BddLat) : ↑((CategoryTheory.forget₂ BddLat Lat).obj X) = ↑X.toLat - BddLat.hasForgetToBddOrd 📋 Mathlib.Order.Category.BddLat
: CategoryTheory.HasForget₂ BddLat BddOrd - BddLat.coe_forget_to_bddOrd 📋 Mathlib.Order.Category.BddLat
(X : BddLat) : ↑((CategoryTheory.forget₂ BddLat BddOrd).obj X).toPartOrd = ↑X.toLat - BddLat.hasForgetToSemilatInf 📋 Mathlib.Order.Category.BddLat
: CategoryTheory.HasForget₂ BddLat SemilatInfCat - BddLat.hasForgetToSemilatSup 📋 Mathlib.Order.Category.BddLat
: CategoryTheory.HasForget₂ BddLat SemilatSupCat - BddLat.coe_forget_to_semilatInf 📋 Mathlib.Order.Category.BddLat
(X : BddLat) : ((CategoryTheory.forget₂ BddLat SemilatInfCat).obj X).X = ↑X.toLat - BddLat.coe_forget_to_semilatSup 📋 Mathlib.Order.Category.BddLat
(X : BddLat) : ((CategoryTheory.forget₂ BddLat SemilatSupCat).obj X).X = ↑X.toLat - bddLat_dual_comp_forget_to_lat 📋 Mathlib.Order.Category.BddLat
: BddLat.dual.comp (CategoryTheory.forget₂ BddLat Lat) = (CategoryTheory.forget₂ BddLat Lat).comp Lat.dual - bddLat_dual_comp_forget_to_bddOrd 📋 Mathlib.Order.Category.BddLat
: BddLat.dual.comp (CategoryTheory.forget₂ BddLat BddOrd) = (CategoryTheory.forget₂ BddLat BddOrd).comp BddOrd.dual - BddLat.ext 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} {f g : X ⟶ Y} (w : ∀ (x : ↑X.toLat), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - BddLat.ext_iff 📋 Mathlib.Order.Category.BddLat
{X Y : BddLat} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X.toLat), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - bddLat_dual_comp_forget_to_semilatInfCat 📋 Mathlib.Order.Category.BddLat
: BddLat.dual.comp (CategoryTheory.forget₂ BddLat SemilatInfCat) = (CategoryTheory.forget₂ BddLat SemilatSupCat).comp SemilatSupCat.dual - bddLat_dual_comp_forget_to_semilatSupCat 📋 Mathlib.Order.Category.BddLat
: BddLat.dual.comp (CategoryTheory.forget₂ BddLat SemilatSupCat) = (CategoryTheory.forget₂ BddLat SemilatInfCat).comp SemilatInfCat.dual - BddLat.forget_lat_partOrd_eq_forget_bddOrd_partOrd 📋 Mathlib.Order.Category.BddLat
: (CategoryTheory.forget₂ BddLat Lat).comp (CategoryTheory.forget₂ Lat PartOrd) = (CategoryTheory.forget₂ BddLat BddOrd).comp (CategoryTheory.forget₂ BddOrd PartOrd) - BddLat.forget_semilatInf_partOrd_eq_forget_bddOrd_partOrd 📋 Mathlib.Order.Category.BddLat
: (CategoryTheory.forget₂ BddLat SemilatInfCat).comp (CategoryTheory.forget₂ SemilatInfCat PartOrd) = (CategoryTheory.forget₂ BddLat BddOrd).comp (CategoryTheory.forget₂ BddOrd PartOrd) - BddLat.forget_semilatSup_partOrd_eq_forget_bddOrd_partOrd 📋 Mathlib.Order.Category.BddLat
: (CategoryTheory.forget₂ BddLat SemilatSupCat).comp (CategoryTheory.forget₂ SemilatSupCat PartOrd) = (CategoryTheory.forget₂ BddLat BddOrd).comp (CategoryTheory.forget₂ BddOrd PartOrd) - BddLat.dual_map 📋 Mathlib.Order.Category.BddLat
{X✝ Y✝ : BddLat} (f : X✝ ⟶ Y✝) : BddLat.dual.map f = BddLat.ofHom (BoundedLatticeHom.dual (BddLat.Hom.hom f)) - BddDistLat.Hom.hom 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} (f : X.Hom Y) : BoundedLatticeHom ↑X.toDistLat ↑Y.toDistLat - BddDistLat.Hom.hom' 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} (self : X.Hom Y) : BoundedLatticeHom ↑X.toDistLat ↑Y.toDistLat - BddDistLat.Hom.Simps.hom 📋 Mathlib.Order.Category.BddDistLat
(X Y : BddDistLat) (f : X.Hom Y) : BoundedLatticeHom ↑X.toDistLat ↑Y.toDistLat - BddDistLat.hom_id 📋 Mathlib.Order.Category.BddDistLat
{X : BddDistLat} : BddDistLat.Hom.hom (CategoryTheory.CategoryStruct.id X) = BoundedLatticeHom.id ↑X.toDistLat - BddDistLat.Hom.ext 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} {x y : X.Hom Y} (hom' : x.hom' = y.hom') : x = y - BddDistLat.Hom.ext_iff 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} {x y : X.Hom Y} : x = y ↔ x.hom' = y.hom' - BddDistLat.instConcreteCategoryBoundedLatticeHomCarrier 📋 Mathlib.Order.Category.BddDistLat
: CategoryTheory.ConcreteCategory BddDistLat fun x1 x2 => BoundedLatticeHom ↑x1.toDistLat ↑x2.toDistLat - BddDistLat.ofHom 📋 Mathlib.Order.Category.BddDistLat
{X Y : Type u} [DistribLattice X] [BoundedOrder X] [DistribLattice Y] [BoundedOrder Y] (f : BoundedLatticeHom X Y) : BddDistLat.of X ⟶ BddDistLat.of Y - BddDistLat.hom_ext 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} {f g : X ⟶ Y} (hf : BddDistLat.Hom.hom f = BddDistLat.Hom.hom g) : f = g - BddDistLat.hom_ext_iff 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} {f g : X ⟶ Y} : f = g ↔ BddDistLat.Hom.hom f = BddDistLat.Hom.hom g - BddDistLat.hasForgetToDistLat 📋 Mathlib.Order.Category.BddDistLat
: CategoryTheory.HasForget₂ BddDistLat DistLat - BddDistLat.hom_comp 📋 Mathlib.Order.Category.BddDistLat
{X Y Z : BddDistLat} (f : X ⟶ Y) (g : Y ⟶ Z) : BddDistLat.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (BddDistLat.Hom.hom g).comp (BddDistLat.Hom.hom f) - BddDistLat.hasForgetToBddLat 📋 Mathlib.Order.Category.BddDistLat
: CategoryTheory.HasForget₂ BddDistLat BddLat - BddDistLat.hom_ofHom 📋 Mathlib.Order.Category.BddDistLat
{X Y : Type u} [DistribLattice X] [BoundedOrder X] [DistribLattice Y] [BoundedOrder Y] (f : BoundedLatticeHom X Y) : BddDistLat.Hom.hom (BddDistLat.ofHom f) = f - BddDistLat.ofHom_comp 📋 Mathlib.Order.Category.BddDistLat
{X Y Z : Type u} [DistribLattice X] [BoundedOrder X] [DistribLattice Y] [BoundedOrder Y] [DistribLattice Z] [BoundedOrder Z] (f : BoundedLatticeHom X Y) (g : BoundedLatticeHom Y Z) : BddDistLat.ofHom (g.comp f) = CategoryTheory.CategoryStruct.comp (BddDistLat.ofHom f) (BddDistLat.ofHom g) - BddDistLat.id_apply 📋 Mathlib.Order.Category.BddDistLat
(X : BddDistLat) (x : ↑X.toDistLat) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) x = x - BddDistLat.coe_id 📋 Mathlib.Order.Category.BddDistLat
{X : BddDistLat} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id - bddDistLat_dual_comp_forget_to_distLat 📋 Mathlib.Order.Category.BddDistLat
: BddDistLat.dual.comp (CategoryTheory.forget₂ BddDistLat DistLat) = (CategoryTheory.forget₂ BddDistLat DistLat).comp DistLat.dual - BddDistLat.ofHom_apply 📋 Mathlib.Order.Category.BddDistLat
{X Y : Type u} [DistribLattice X] [BoundedOrder X] [DistribLattice Y] [BoundedOrder Y] (f : BoundedLatticeHom X Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (BddDistLat.ofHom f)) x = f x - BddDistLat.hom_inv_apply 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} (e : X ≅ Y) (s : ↑Y.toDistLat) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s - BddDistLat.inv_hom_apply 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} (e : X ≅ Y) (x : ↑X.toDistLat) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x - BddDistLat.ext 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} {f g : X ⟶ Y} (w : ∀ (x : ↑X.toDistLat), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - BddDistLat.ext_iff 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X.toDistLat), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - BddDistLat.forget_bddLat_lat_eq_forget_distLat_lat 📋 Mathlib.Order.Category.BddDistLat
: (CategoryTheory.forget₂ BddDistLat BddLat).comp (CategoryTheory.forget₂ BddLat Lat) = (CategoryTheory.forget₂ BddDistLat DistLat).comp (CategoryTheory.forget₂ DistLat Lat) - BddDistLat.comp_apply 📋 Mathlib.Order.Category.BddDistLat
{X Y Z : BddDistLat} (f : X ⟶ Y) (g : Y ⟶ Z) (x : ↑X.toDistLat) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) x = (CategoryTheory.ConcreteCategory.hom g) ((CategoryTheory.ConcreteCategory.hom f) x) - BddDistLat.coe_comp 📋 Mathlib.Order.Category.BddDistLat
{X Y Z : BddDistLat} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f) - BddDistLat.dual_map 📋 Mathlib.Order.Category.BddDistLat
{X✝ Y✝ : BddDistLat} (f : X✝ ⟶ Y✝) : BddDistLat.dual.map f = BddDistLat.ofHom (BoundedLatticeHom.dual (BddDistLat.Hom.hom f)) - BddDistLat.forget_map 📋 Mathlib.Order.Category.BddDistLat
{X Y : BddDistLat} (f : X ⟶ Y) : ⇑(CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget BddDistLat).map f)) = ⇑(CategoryTheory.ConcreteCategory.hom f) - HeytAlg.hasForgetToLat 📋 Mathlib.Order.Category.HeytAlg
: CategoryTheory.HasForget₂ HeytAlg BddDistLat - HeytAlg.hasForgetToLat_forget₂_obj_carrier 📋 Mathlib.Order.Category.HeytAlg
(X : HeytAlg) : ↑(CategoryTheory.HasForget₂.forget₂.obj X).toDistLat = ↑X - HeytAlg.hasForgetToLat_forget₂_obj_str 📋 Mathlib.Order.Category.HeytAlg
(X : HeytAlg) : (CategoryTheory.HasForget₂.forget₂.obj X).str = GeneralizedHeytingAlgebra.toDistribLattice - HeytAlg.hasForgetToLat_forget₂_obj_isBoundedOrder 📋 Mathlib.Order.Category.HeytAlg
(X : HeytAlg) : (CategoryTheory.HasForget₂.forget₂.obj X).isBoundedOrder = HeytingAlgebra.toBoundedOrder - HeytAlg.hasForgetToLat_forget₂_map 📋 Mathlib.Order.Category.HeytAlg
{X✝ Y✝ : HeytAlg} (f : X✝ ⟶ Y✝) : CategoryTheory.HasForget₂.forget₂.map f = BddDistLat.ofHom (have __src := { toFun := ⇑(HeytAlg.Hom.hom f), map_sup' := ⋯, map_inf' := ⋯ }; { toFun := ⇑(HeytAlg.Hom.hom f), map_sup' := ⋯, map_inf' := ⋯, map_top' := ⋯, map_bot' := ⋯ }) - BoolAlg.ofHom 📋 Mathlib.Order.Category.BoolAlg
{X Y : Type u} [BooleanAlgebra X] [BooleanAlgebra Y] (f : BoundedLatticeHom X Y) : { carrier := X, str := inst✝ } ⟶ { carrier := Y, str := inst✝¹ } - BoolAlg.Hom.hom 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} (f : X.Hom Y) : BoundedLatticeHom ↑X ↑Y - BoolAlg.Hom.hom' 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} (self : X.Hom Y) : BoundedLatticeHom ↑X ↑Y - BoolAlg.Hom.Simps.hom 📋 Mathlib.Order.Category.BoolAlg
(X Y : BoolAlg) (f : X.Hom Y) : BoundedLatticeHom ↑X ↑Y - BoolAlg.Hom.ext 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} {x y : X.Hom Y} (hom' : x.hom' = y.hom') : x = y - BoolAlg.Hom.ext_iff 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} {x y : X.Hom Y} : x = y ↔ x.hom' = y.hom' - BoolAlg.hom_id 📋 Mathlib.Order.Category.BoolAlg
{X : BoolAlg} : BoolAlg.Hom.hom (CategoryTheory.CategoryStruct.id X) = BoundedLatticeHom.id ↑X - BoolAlg.hom_ext 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} {f g : X ⟶ Y} (hf : BoolAlg.Hom.hom f = BoolAlg.Hom.hom g) : f = g - BoolAlg.hom_ext_iff 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} {f g : X ⟶ Y} : f = g ↔ BoolAlg.Hom.hom f = BoolAlg.Hom.hom g - BoolAlg.instConcreteCategoryBoundedLatticeHomCarrier 📋 Mathlib.Order.Category.BoolAlg
: CategoryTheory.ConcreteCategory BoolAlg fun x1 x2 => BoundedLatticeHom ↑x1 ↑x2 - BoolAlg.hasForgetToHeytAlg 📋 Mathlib.Order.Category.BoolAlg
: CategoryTheory.HasForget₂ BoolAlg HeytAlg - BoolAlg.hom_ofHom 📋 Mathlib.Order.Category.BoolAlg
{X Y : Type u} [BooleanAlgebra X] [BooleanAlgebra Y] (f : BoundedLatticeHom X Y) : BoolAlg.Hom.hom (BoolAlg.ofHom f) = f - BoolAlg.hasForgetToHeytAlg_forget₂_obj_coe 📋 Mathlib.Order.Category.BoolAlg
(X : BoolAlg) : ↑(CategoryTheory.HasForget₂.forget₂.obj X) = ↑X - BoolAlg.hom_comp 📋 Mathlib.Order.Category.BoolAlg
{X Y Z : BoolAlg} (f : X ⟶ Y) (g : Y ⟶ Z) : BoolAlg.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (BoolAlg.Hom.hom g).comp (BoolAlg.Hom.hom f) - BoolAlg.ofHom_comp 📋 Mathlib.Order.Category.BoolAlg
{X Y Z : Type u} [BooleanAlgebra X] [BooleanAlgebra Y] [BooleanAlgebra Z] (f : BoundedLatticeHom X Y) (g : BoundedLatticeHom Y Z) : BoolAlg.ofHom (g.comp f) = CategoryTheory.CategoryStruct.comp (BoolAlg.ofHom f) (BoolAlg.ofHom g) - BoolAlg.hasForgetToBddDistLat 📋 Mathlib.Order.Category.BoolAlg
: CategoryTheory.HasForget₂ BoolAlg BddDistLat - BoolAlg.id_apply 📋 Mathlib.Order.Category.BoolAlg
(X : BoolAlg) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) x = x - BoolAlg.coe_id 📋 Mathlib.Order.Category.BoolAlg
{X : BoolAlg} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id - BoolAlg.ofHom_apply 📋 Mathlib.Order.Category.BoolAlg
{X Y : Type u} [BooleanAlgebra X] [BooleanAlgebra Y] (f : BoundedLatticeHom X Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (BoolAlg.ofHom f)) x = f x - boolAlg_dual_comp_forget_to_bddDistLat 📋 Mathlib.Order.Category.BoolAlg
: BoolAlg.dual.comp (CategoryTheory.forget₂ BoolAlg BddDistLat) = (CategoryTheory.forget₂ BoolAlg BddDistLat).comp BddDistLat.dual - BoolAlg.hasForgetToHeytAlg_forget₂_map 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} (f : X ⟶ Y) : CategoryTheory.HasForget₂.forget₂.map f = HeytAlg.ofHom { toFun := ⇑(BoolAlg.Hom.hom f), map_sup' := ⋯, map_inf' := ⋯, map_bot' := ⋯, map_himp' := ⋯ } - BoolAlg.hom_inv_apply 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} (e : X ≅ Y) (s : ↑Y) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s - BoolAlg.inv_hom_apply 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} (e : X ≅ Y) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x - BoolAlg.ext 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} {f g : X ⟶ Y} (w : ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - BoolAlg.ext_iff 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - BoolAlg.comp_apply 📋 Mathlib.Order.Category.BoolAlg
{X Y Z : BoolAlg} (f : X ⟶ Y) (g : Y ⟶ Z) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) x = (CategoryTheory.ConcreteCategory.hom g) ((CategoryTheory.ConcreteCategory.hom f) x) - BoolAlg.coe_comp 📋 Mathlib.Order.Category.BoolAlg
{X Y Z : BoolAlg} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f) - BoolAlg.dual_map 📋 Mathlib.Order.Category.BoolAlg
{X✝ Y✝ : BoolAlg} (f : X✝ ⟶ Y✝) : BoolAlg.dual.map f = BoolAlg.ofHom (BoundedLatticeHom.dual (BoolAlg.Hom.hom f)) - BoolAlg.forget_map 📋 Mathlib.Order.Category.BoolAlg
{X Y : BoolAlg} (f : X ⟶ Y) : ⇑(CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget BoolAlg).map f)) = ⇑(CategoryTheory.ConcreteCategory.hom f) - BoolAlg.hasForgetToBoolRing 📋 Mathlib.Algebra.Category.BoolRing
: CategoryTheory.HasForget₂ BoolAlg BoolRing - BoolRing.hasForgetToBoolAlg 📋 Mathlib.Algebra.Category.BoolRing
: CategoryTheory.HasForget₂ BoolRing BoolAlg - boolRingCatEquivBoolAlg_functor 📋 Mathlib.Algebra.Category.BoolRing
: boolRingCatEquivBoolAlg.functor = CategoryTheory.forget₂ BoolRing BoolAlg - boolRingCatEquivBoolAlg_inverse 📋 Mathlib.Algebra.Category.BoolRing
: boolRingCatEquivBoolAlg.inverse = CategoryTheory.forget₂ BoolAlg BoolRing - BoolAlg.hasForgetToBoolRing_forget₂_obj_carrier 📋 Mathlib.Algebra.Category.BoolRing
(X : BoolAlg) : ↑(CategoryTheory.HasForget₂.forget₂.obj X) = AsBoolRing ↑X - BoolRing.hasForgetToBoolAlg_forget₂_obj_coe 📋 Mathlib.Algebra.Category.BoolRing
(X : BoolRing) : ↑(CategoryTheory.HasForget₂.forget₂.obj X) = AsBoolAlg ↑X - BoolAlg.hasForgetToBoolRing_forget₂_map 📋 Mathlib.Algebra.Category.BoolRing
{X✝ Y✝ : BoolAlg} (f : X✝ ⟶ Y✝) : CategoryTheory.HasForget₂.forget₂.map f = BoolRing.ofHom (BoolAlg.Hom.hom f).asBoolRing - BoolRing.hasForgetToBoolAlg_forget₂_map 📋 Mathlib.Algebra.Category.BoolRing
{X✝ Y✝ : BoolRing} (f : X✝ ⟶ Y✝) : CategoryTheory.HasForget₂.forget₂.map f = BoolAlg.ofHom (BoolRing.Hom.hom f).asBoolAlg - BooleanSubalgebra.comap 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L : BooleanSubalgebra β) : BooleanSubalgebra α - BooleanSubalgebra.map 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L : BooleanSubalgebra α) : BooleanSubalgebra β - BooleanSubalgebra.comap_top 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) : BooleanSubalgebra.comap f ⊤ = ⊤ - BooleanSubalgebra.map_bot 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) : BooleanSubalgebra.map f ⊥ = ⊥ - BooleanSubalgebra.comap_mono 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {f : BoundedLatticeHom α β} : Monotone (BooleanSubalgebra.comap f) - BooleanSubalgebra.map_mono 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {f : BoundedLatticeHom α β} : Monotone (BooleanSubalgebra.map f) - BooleanSubalgebra.gc_map_comap 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) : GaloisConnection (BooleanSubalgebra.map f) (BooleanSubalgebra.comap f) - BooleanSubalgebra.comap_iInf 📋 Mathlib.Order.BooleanSubalgebra
{ι : Sort u_1} {α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L : ι → BooleanSubalgebra β) : BooleanSubalgebra.comap f (⨅ i, L i) = ⨅ i, BooleanSubalgebra.comap f (L i) - BooleanSubalgebra.comap_inf 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (L M : BooleanSubalgebra β) (f : BoundedLatticeHom α β) : BooleanSubalgebra.comap f (L ⊓ M) = BooleanSubalgebra.comap f L ⊓ BooleanSubalgebra.comap f M - BooleanSubalgebra.map_le_iff_le_comap 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {L : BooleanSubalgebra α} {f : BoundedLatticeHom α β} {M : BooleanSubalgebra β} : BooleanSubalgebra.map f L ≤ M ↔ L ≤ BooleanSubalgebra.comap f M - BooleanSubalgebra.map_inf_le 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (L M : BooleanSubalgebra α) (f : BoundedLatticeHom α β) : BooleanSubalgebra.map f (L ⊓ M) ≤ BooleanSubalgebra.map f L ⊓ BooleanSubalgebra.map f M - BooleanSubalgebra.map_iSup 📋 Mathlib.Order.BooleanSubalgebra
{ι : Sort u_1} {α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L : ι → BooleanSubalgebra α) : BooleanSubalgebra.map f (⨆ i, L i) = ⨆ i, BooleanSubalgebra.map f (L i) - BooleanSubalgebra.map_sup 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L M : BooleanSubalgebra α) : BooleanSubalgebra.map f (L ⊔ M) = BooleanSubalgebra.map f L ⊔ BooleanSubalgebra.map f M - BooleanSubalgebra.le_comap_iSup 📋 Mathlib.Order.BooleanSubalgebra
{ι : Sort u_1} {α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L : ι → BooleanSubalgebra β) : ⨆ i, BooleanSubalgebra.comap f (L i) ≤ BooleanSubalgebra.comap f (⨆ i, L i) - BooleanSubalgebra.map_top 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (h : Function.Surjective ⇑f) : BooleanSubalgebra.map f ⊤ = ⊤ - BooleanSubalgebra.le_comap_sup 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (L M : BooleanSubalgebra β) (f : BoundedLatticeHom α β) : BooleanSubalgebra.comap f L ⊔ BooleanSubalgebra.comap f M ≤ BooleanSubalgebra.comap f (L ⊔ M) - BooleanSubalgebra.coe_comap 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (L : BooleanSubalgebra β) (f : BoundedLatticeHom α β) : ↑(BooleanSubalgebra.comap f L) = ⇑f ⁻¹' ↑L - BooleanSubalgebra.coe_map 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (f : BoundedLatticeHom α β) (L : BooleanSubalgebra α) : ↑(BooleanSubalgebra.map f L) = ⇑f '' ↑L - BooleanSubalgebra.comap_comap 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [BooleanAlgebra α] [BooleanAlgebra β] [BooleanAlgebra γ] (L : BooleanSubalgebra γ) (g : BoundedLatticeHom β γ) (f : BoundedLatticeHom α β) : BooleanSubalgebra.comap f (BooleanSubalgebra.comap g L) = BooleanSubalgebra.comap (g.comp f) L - BooleanSubalgebra.map_map 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [BooleanAlgebra α] [BooleanAlgebra β] [BooleanAlgebra γ] {L : BooleanSubalgebra α} (g : BoundedLatticeHom β γ) (f : BoundedLatticeHom α β) : BooleanSubalgebra.map g (BooleanSubalgebra.map f L) = BooleanSubalgebra.map (g.comp f) L - BooleanSubalgebra.mem_map_of_mem 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {L : BooleanSubalgebra α} (f : BoundedLatticeHom α β) {a : α} : a ∈ L → f a ∈ BooleanSubalgebra.map f L - BooleanSubalgebra.mem_comap 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {f : BoundedLatticeHom α β} {a : α} {L : BooleanSubalgebra β} : a ∈ BooleanSubalgebra.comap f L ↔ f a ∈ L - BooleanSubalgebra.map_inf 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] (L M : BooleanSubalgebra α) (f : BoundedLatticeHom α β) (hf : Function.Injective ⇑f) : BooleanSubalgebra.map f (L ⊓ M) = BooleanSubalgebra.map f L ⊓ BooleanSubalgebra.map f M - BooleanSubalgebra.mem_map 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {L : BooleanSubalgebra α} {f : BoundedLatticeHom α β} {b : β} : b ∈ BooleanSubalgebra.map f L ↔ ∃ a ∈ L, f a = b - BooleanSubalgebra.subtype 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} [BooleanAlgebra α] (L : BooleanSubalgebra α) : BoundedLatticeHom (↥L) α - BooleanSubalgebra.apply_coe_mem_map 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {L : BooleanSubalgebra α} (f : BoundedLatticeHom α β) (a : ↥L) : f ↑a ∈ BooleanSubalgebra.map f L - BooleanSubalgebra.apply_mem_map_iff 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] {L : BooleanSubalgebra α} {f : BoundedLatticeHom α β} {a : α} (hf : Function.Injective ⇑f) : f a ∈ BooleanSubalgebra.map f L ↔ a ∈ L - BooleanSubalgebra.inclusion 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} [BooleanAlgebra α] {L M : BooleanSubalgebra α} (h : L ≤ M) : BoundedLatticeHom ↥L ↥M - BooleanSubalgebra.subtype_injective 📋 Mathlib.Order.BooleanSubalgebra
{α : Type u_2} [BooleanAlgebra α] (L : BooleanSubalgebra α) : Function.Injective ⇑L.subtype
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59