Loogle!
Result
Found 290 declarations mentioning Finset.Icc. Of these, only the first 200 are shown.
- Finset.Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset α - Finset.coe_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : ↑(Finset.Icc a b) = Set.Icc a b - Set.toFinset_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_3} [Preorder α] [LocallyFiniteOrder α] (a b : α) [Fintype ↑(Set.Icc a b)] : (Set.Icc a b).toFinset = Finset.Icc a b - Fintype.card_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) [Fintype ↑(Set.Icc a b)] : Fintype.card ↑(Set.Icc a b) = (Finset.Icc a b).card - Finset.Ici_eq_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] [OrderTop α] (a : α) : Finset.Ici a = Finset.Icc a ⊤ - Finset.Iic_eq_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] [OrderBot α] (a : α) : Finset.Iic a = Finset.Icc ⊥ a - Finset.mem_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] {a b x : α} : x ∈ Finset.Icc a b ↔ a ≤ x ∧ x ≤ b - Finset.mem_Icc' 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] {a b x : α} : x ∈ Finset.Icc a b ↔ x ≤ b ∧ a ≤ x - Finset.subtype_Icc_eq 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] (p : α → Prop) [DecidablePred p] [LocallyFiniteOrder α] (a b : Subtype p) : Finset.Icc a b = Finset.subtype p (Finset.Icc ↑a ↑b) - WithBot.Icc_coe_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] (a b : α) : Finset.Icc ↑b ↑a = Finset.map Function.Embedding.some (Finset.Icc b a) - WithTop.Icc_coe_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderTop α] [LocallyFiniteOrder α] (a b : α) : Finset.Icc ↑a ↑b = Finset.map Function.Embedding.some (Finset.Icc a b) - Finset.map_subtype_embedding_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] (p : α → Prop) [DecidablePred p] [LocallyFiniteOrder α] (a b : Subtype p) (hp : ∀ ⦃a b x : α⦄, a ≤ x → x ≤ b → p a → p b → p x) : Finset.map (Function.Embedding.subtype p) (Finset.Icc a b) = Finset.Icc ↑a ↑b - Finset.Icc_product_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [DecidableLE (α × β)] (a₁ a₂ : α) (b₁ b₂ : β) : Finset.Icc a₁ a₂ ×ˢ Finset.Icc b₁ b₂ = Finset.Icc (a₁, b₁) (a₂, b₂) - Finset.Icc_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset.Icc (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.Icc b a) - Finset.Icc_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Icc (OrderDual.ofDual a) (OrderDual.ofDual b) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Icc b a) - Finset.Icc_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Icc a b = Finset.map OrderDual.toDual.toEmbedding (Finset.Icc (OrderDual.ofDual b) (OrderDual.ofDual a)) - Finset.Icc_prod_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [DecidableLE (α × β)] (x y : α × β) : Finset.Icc x y = Finset.Icc x.1 y.1 ×ˢ Finset.Icc x.2 y.2 - Finset.card_Icc_prod 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [DecidableLE (α × β)] (x y : α × β) : (Finset.Icc x y).card = (Finset.Icc x.1 y.1).card * (Finset.Icc x.2 y.2).card - WithBot.Icc_bot_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] (a : α) : Finset.Icc ⊥ ↑a = Finset.insertNone (Finset.Iic a) - WithTop.Icc_coe_top 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderTop α] [LocallyFiniteOrder α] (a : α) : Finset.Icc ↑a ⊤ = Finset.insertNone (Finset.Ici a) - Finset.Aesop.nonempty_Icc_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : a ≤ b → (Finset.Icc a b).Nonempty - Finset.nonempty_Icc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : (Finset.Icc a b).Nonempty ↔ a ≤ b - Finset.Icc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] (a : α) : Finset.Icc a a = {a} - Finset.Icc_eq_empty_of_lt 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] (h : b < a) : Finset.Icc a b = ∅ - Finset.Icc_eq_empty 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : ¬a ≤ b → Finset.Icc a b = ∅ - Finset.Icc_eq_empty_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Icc a b = ∅ ↔ ¬a ≤ b - Finset.Ico_subset_Icc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Ico a b ⊆ Finset.Icc a b - Finset.Ioc_subset_Icc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Ioc a b ⊆ Finset.Icc a b - Finset.Ioo_subset_Icc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Icc a b - Finset.Icc_subset_Ici_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderTop α] [LocallyFiniteOrder α] : Finset.Icc a b ⊆ Finset.Ici a - Finset.Icc_subset_Iic_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] [LocallyFiniteOrder α] : Finset.Icc a b ⊆ Finset.Iic b - Finset.left_mem_Icc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : a ∈ Finset.Icc a b ↔ a ≤ b - Finset.right_mem_Icc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : b ∈ Finset.Icc a b ↔ a ≤ b - Finset.Icc_erase_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] (a b : α) : (Finset.Icc a b).erase a = Finset.Ioc a b - Finset.Icc_erase_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] (a b : α) : (Finset.Icc a b).erase b = Finset.Ico a b - Finset.Icc_bot 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a : α} [Preorder α] [LocallyFiniteOrder α] [OrderBot α] : Finset.Icc ⊥ a = Finset.Iic a - Finset.Icc_top 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a : α} [Preorder α] [LocallyFiniteOrder α] [OrderTop α] : Finset.Icc a ⊤ = Finset.Ici a - Finset.Icc_eq_singleton_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b c : α} : Finset.Icc a b = {c} ↔ a = c ∧ b = c - Finset.Icc_subset_Icc_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b : α} [Preorder α] [LocallyFiniteOrder α] (h : a₁ ≤ a₂) : Finset.Icc a₂ b ⊆ Finset.Icc a₁ b - Finset.Icc_subset_Icc_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h : b₁ ≤ b₂) : Finset.Icc a b₁ ⊆ Finset.Icc a b₂ - Finset.Icc_subset_Ico_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h : b₁ < b₂) : Finset.Icc a b₁ ⊆ Finset.Ico a b₂ - Finset.Icc_subset_uIcc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Lattice α] [LocallyFiniteOrder α] {a b : α} : Finset.Icc a b ⊆ Finset.uIcc a b - Finset.Icc_subset_uIcc' 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Lattice α] [LocallyFiniteOrder α] {a b : α} : Finset.Icc b a ⊆ Finset.uIcc a b - Finset.card_Ico_eq_card_Icc_sub_one 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] (a b : α) : (Finset.Ico a b).card = (Finset.Icc a b).card - 1 - Finset.card_Ioc_eq_card_Icc_sub_one 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] (a b : α) : (Finset.Ioc a b).card = (Finset.Icc a b).card - 1 - Finset.card_Ioo_eq_card_Icc_sub_two 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] (a b : α) : (Finset.Ioo a b).card = (Finset.Icc a b).card - 2 - Finset.Icc_subset_Icc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (ha : a₂ ≤ a₁) (hb : b₁ ≤ b₂) : Finset.Icc a₁ b₁ ⊆ Finset.Icc a₂ b₂ - Finset.Ico_insert_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : insert b (Finset.Ico a b) = Finset.Icc a b - Finset.Ioc_insert_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : insert a (Finset.Ioc a b) = Finset.Icc a b - Finset.uIcc_of_ge 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Lattice α] [LocallyFiniteOrder α] {a b : α} (h : b ≤ a) : Finset.uIcc a b = Finset.Icc b a - Finset.uIcc_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Lattice α] [LocallyFiniteOrder α] {a b : α} (h : a ≤ b) : Finset.uIcc a b = Finset.Icc a b - Finset.Icc_bot_top 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Preorder α] [LocallyFiniteOrder α] [BoundedOrder α] [Fintype α] : Finset.Icc ⊥ ⊤ = Finset.univ - Finset.Icc_eq_cons_Ico 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} (h : a ≤ b) : Finset.Icc a b = Finset.cons b (Finset.Ico a b) ⋯ - Finset.Icc_eq_cons_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} (h : a ≤ b) : Finset.Icc a b = Finset.cons a (Finset.Ioc a b) ⋯ - Finset.Icc_diff_both 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] (a b : α) : Finset.Icc a b \ {a, b} = Finset.Ioo a b - Finset.Icc_filter_lt_of_lt_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Preorder α] [LocallyFiniteOrder α] {a b c : α} [DecidablePred fun x => x < c] (h : b < c) : {x ∈ Finset.Icc a b | x < c} = Finset.Icc a b - Finset.Icc_sdiff_both 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] (a b : α) : Finset.Icc a b \ {a, b} = Finset.Ioo a b - Finset.Icc_diff_Ico_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : Finset.Icc a b \ Finset.Ico a b = {b} - Finset.Icc_diff_Ioc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : Finset.Icc a b \ Finset.Ioc a b = {a} - Finset.Icc_sdiff_Ico_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : Finset.Icc a b \ Finset.Ico a b = {b} - Finset.Icc_sdiff_Ioc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : Finset.Icc a b \ Finset.Ioc a b = {a} - Finset.Icc_ssubset_Icc_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (hI : a₂ ≤ b₂) (ha : a₂ < a₁) (hb : b₁ ≤ b₂) : Finset.Icc a₁ b₁ ⊂ Finset.Icc a₂ b₂ - Finset.Icc_ssubset_Icc_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (hI : a₂ ≤ b₂) (ha : a₂ ≤ a₁) (hb : b₁ < b₂) : Finset.Icc a₁ b₁ ⊂ Finset.Icc a₂ b₂ - Finset.Icc_subset_Icc_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h₁ : a₁ ≤ b₁) : Finset.Icc a₁ b₁ ⊆ Finset.Icc a₂ b₂ ↔ a₂ ≤ a₁ ∧ b₁ ≤ b₂ - Finset.Icc_subset_Ico_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h₁ : a₁ ≤ b₁) : Finset.Icc a₁ b₁ ⊆ Finset.Ico a₂ b₂ ↔ a₂ ≤ a₁ ∧ b₁ < b₂ - Finset.Icc_subset_Ioc_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h₁ : a₁ ≤ b₁) : Finset.Icc a₁ b₁ ⊆ Finset.Ioc a₂ b₂ ↔ a₂ < a₁ ∧ b₁ ≤ b₂ - Finset.Icc_subset_Ioo_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h₁ : a₁ ≤ b₁) : Finset.Icc a₁ b₁ ⊆ Finset.Ioo a₂ b₂ ↔ a₂ < a₁ ∧ b₁ < b₂ - Finset.filter_le_le_eq_Icc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} (a b : α) [Preorder α] [LocallyFiniteOrder α] [Fintype α] [DecidablePred fun j => a ≤ j ∧ j ≤ b] : {j | a ≤ j ∧ j ≤ b} = Finset.Icc a b - Finset.Icc_diff_Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : Finset.Icc a b \ Finset.Ioo a b = {a, b} - Finset.Icc_sdiff_Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a ≤ b) : Finset.Icc a b \ Finset.Ioo a b = {a, b} - Finset.uIcc_of_not_ge 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] {a b : α} (h : ¬b ≤ a) : Finset.uIcc a b = Finset.Icc a b - Finset.uIcc_of_not_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] {a b : α} (h : ¬a ≤ b) : Finset.uIcc a b = Finset.Icc b a - Finset.Icc_min_max 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] {a b : α} : Finset.Icc (min a b) (max a b) = Finset.uIcc a b - Finset.uIcc_eq_union 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] {a b : α} : Finset.uIcc a b = Finset.Icc a b ∪ Finset.Icc b a - Finset.Icc_map_sectL 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {β : Type u_3} [Preorder α] [PartialOrder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [DecidableLE (α × β)] (a b : α) (c : β) : Finset.map (Function.Embedding.sectL α c) (Finset.Icc a b) = Finset.Icc (a, c) (b, c) - Finset.Icc_map_sectR 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {β : Type u_3} [PartialOrder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [DecidableLE (α × β)] (c : α) (a b : β) : Finset.map (Function.Embedding.sectR c β) (Finset.Icc a b) = Finset.Icc (c, a) (c, b) - Finset.uIcc_subset_Icc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Lattice α] [LocallyFiniteOrder α] {a₁ a₂ b₁ b₂ : α} (ha : a₁ ∈ Finset.Icc a₂ b₂) (hb : b₁ ∈ Finset.Icc a₂ b₂) : Finset.uIcc a₁ b₁ ⊆ Finset.Icc a₂ b₂ - Nat.range_succ_eq_Icc_zero 📋 Mathlib.Order.Interval.Finset.Nat
(n : ℕ) : Finset.range (n + 1) = Finset.Icc 0 n - List.toFinset_range'_1_1 📋 Mathlib.Order.Interval.Finset.Nat
(a : ℕ) : (List.range' 1 a).toFinset = Finset.Icc 1 a - Nat.card_Icc 📋 Mathlib.Order.Interval.Finset.Nat
(a b : ℕ) : (Finset.Icc a b).card = b + 1 - a - Nat.range_eq_Icc_zero_sub_one 📋 Mathlib.Order.Interval.Finset.Nat
(n : ℕ) (hn : n ≠ 0) : Finset.range n = Finset.Icc 0 (n - 1) - Nat.Icc_eq_range' 📋 Mathlib.Order.Interval.Finset.Nat
(a b : ℕ) : Finset.Icc a b = { val := ↑(List.range' a (b + 1 - a)), nodup := ⋯ } - Fin.map_valEmbedding_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : Finset.map Fin.valEmbedding (Finset.Icc a b) = Finset.Icc ↑a ↑b - Fin.finsetImage_val_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : Finset.image Fin.val (Finset.Icc a b) = Finset.Icc ↑a ↑b - Fin.finsetImage_rev_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.rev (Finset.Icc i j) = Finset.Icc j.rev i.rev - Fin.card_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.Icc a b).card = ↑b + 1 - ↑a - Fin.map_revPerm_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Icc i j) = Finset.Icc j.rev i.rev - Fin.map_castLEEmb_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a b : Fin n) (h : n ≤ m) : Finset.map (Fin.castLEEmb h) (Finset.Icc a b) = Finset.Icc (Fin.castLE h a) (Fin.castLE h b) - Fin.finsetImage_cast_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.image (Fin.cast h) (Finset.Icc i j) = Finset.Icc (Fin.cast h i) (Fin.cast h j) - Fin.finsetImage_castLE_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a b : Fin n) (h : n ≤ m) : Finset.image (Fin.castLE h) (Finset.Icc a b) = Finset.Icc (Fin.castLE h a) (Fin.castLE h b) - Fin.map_finCongr_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Icc i j) = Finset.Icc (Fin.cast h i) (Fin.cast h j) - Fin.Icc_sub_one_eq_Ico 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (hb : 0 < b) : Finset.Icc a (b - 1) = Finset.Ico a b - Fin.Ioc_sub_one_eq_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (ha : 0 < a) : Finset.Ioc (a - 1) b = Finset.Icc a b - Fin.Icc_add_one_eq_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (ha : ↑a + 1 < n) : Finset.Icc (a + 1) b = Finset.Ioc a b - Fin.Ico_add_one_eq_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (hb : ↑b + 1 < n) : Finset.Ico a (b + 1) = Finset.Icc a b - Fin.map_addNatEmb_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.addNatEmb m) (Finset.Icc i j) = Finset.Icc (i.addNat m) (j.addNat m) - Fin.map_castAddEmb_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.castAddEmb m) (Finset.Icc i j) = Finset.Icc (Fin.castAdd m i) (Fin.castAdd m j) - Fin.map_natAddEmb_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.natAddEmb m) (Finset.Icc i j) = Finset.Icc (Fin.natAdd m i) (Fin.natAdd m j) - Fin.finsetImage_castAdd_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (Fin.castAdd m) (Finset.Icc i j) = Finset.Icc (Fin.castAdd m i) (Fin.castAdd m j) - Fin.finsetImage_natAdd_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (Fin.natAdd m) (Finset.Icc i j) = Finset.Icc (Fin.natAdd m i) (Fin.natAdd m j) - Fin.finsetImage_addNat_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (fun x => x.addNat m) (Finset.Icc i j) = Finset.Icc (i.addNat m) (j.addNat m) - Fin.map_castSuccEmb_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map Fin.castSuccEmb (Finset.Icc i j) = Finset.Icc i.castSucc j.castSucc - Fin.map_succEmb_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Fin.succEmb n) (Finset.Icc i j) = Finset.Icc i.succ j.succ - Fin.finsetImage_castSucc_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.castSucc (Finset.Icc i j) = Finset.Icc i.castSucc j.castSucc - Fin.finsetImage_succ_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.succ (Finset.Icc i j) = Finset.Icc i.succ j.succ - Fin.attachFin_Icc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.Icc ↑a ↑b).attachFin ⋯ = Finset.Icc a b - Fin.attachFin_uIcc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.uIcc ↑a ↑b).attachFin ⋯ = Finset.uIcc a b - Fin.prod_Icc_cast 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n m : ℕ} (h : n = m) (f : Fin m → M) (a b : Fin n) : ∏ i ∈ Finset.Icc (Fin.cast h a) (Fin.cast h b), f i = ∏ i ∈ Finset.Icc a b, f (Fin.cast h i) - Fin.sum_Icc_cast 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n m : ℕ} (h : n = m) (f : Fin m → M) (a b : Fin n) : ∑ i ∈ Finset.Icc (Fin.cast h a) (Fin.cast h b), f i = ∑ i ∈ Finset.Icc a b, f (Fin.cast h i) - Fin.prod_Icc_castLE 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n m : ℕ} (h : n ≤ m) (f : Fin m → M) (a b : Fin n) : ∏ i ∈ Finset.Icc (Fin.castLE h a) (Fin.castLE h b), f i = ∏ i ∈ Finset.Icc a b, f (Fin.castLE h i) - Fin.sum_Icc_castLE 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n m : ℕ} (h : n ≤ m) (f : Fin m → M) (a b : Fin n) : ∑ i ∈ Finset.Icc (Fin.castLE h a) (Fin.castLE h b), f i = ∑ i ∈ Finset.Icc a b, f (Fin.castLE h i) - Fin.prod_Icc_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a b : Fin n) : ∏ i ∈ Finset.Icc (Fin.castAdd m a) (Fin.castAdd m b), f i = ∏ i ∈ Finset.Icc a b, f (Fin.castAdd m i) - Fin.sum_Icc_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a b : Fin n) : ∑ i ∈ Finset.Icc (Fin.castAdd m a) (Fin.castAdd m b), f i = ∑ i ∈ Finset.Icc a b, f (Fin.castAdd m i) - Fin.prod_Icc_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∏ i ∈ Finset.Icc a.castSucc b.castSucc, f i = ∏ i ∈ Finset.Icc a b, f i.castSucc - Fin.prod_Icc_succ 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∏ i ∈ Finset.Icc a.succ b.succ, f i = ∏ i ∈ Finset.Icc a b, f i.succ - Fin.sum_Icc_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∑ i ∈ Finset.Icc a.castSucc b.castSucc, f i = ∑ i ∈ Finset.Icc a b, f i.castSucc - Fin.sum_Icc_succ 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∑ i ∈ Finset.Icc a.succ b.succ, f i = ∑ i ∈ Finset.Icc a b, f i.succ - Finset.Icc_pred_right_eq_Ico 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] [NoMinOrder α] (a b : α) : Finset.Icc a (Order.pred b) = Finset.Ico a b - Finset.Icc_succ_left_eq_Ioc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] [NoMaxOrder α] (a b : α) : Finset.Icc (Order.succ a) b = Finset.Ioc a b - Finset.Ico_succ_right_eq_Icc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] [NoMaxOrder α] (a b : α) : Finset.Ico a (Order.succ b) = Finset.Icc a b - Finset.Ioc_pred_left_eq_Icc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] [NoMinOrder α] (a b : α) : Finset.Ioc (Order.pred a) b = Finset.Icc a b - Finset.Icc_pred_right_eq_Ico_of_not_isMin 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {b : α} (hb : ¬IsMin b) (a : α) : Finset.Icc a (Order.pred b) = Finset.Ico a b - Finset.Icc_succ_left_eq_Ioc_of_not_isMax 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {a : α} (ha : ¬IsMax a) (b : α) : Finset.Icc (Order.succ a) b = Finset.Ioc a b - Finset.Ico_succ_right_eq_Icc_of_not_isMax 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {b : α} (hb : ¬IsMax b) (a : α) : Finset.Ico a (Order.succ b) = Finset.Icc a b - Finset.Ioc_pred_left_eq_Icc_of_not_isMin 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a : α} (ha : ¬IsMin a) (b : α) : Finset.Ioc (Order.pred a) b = Finset.Icc a b - Finset.Icc_succ_pred_eq_Ioo 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] [PredOrder α] [Nontrivial α] (a b : α) : Finset.Icc (Order.succ a) (Order.pred b) = Finset.Ioo a b - Finset.insert_Icc_pred_right_eq_Icc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a b : α} (h : a ≤ b) : insert b (Finset.Icc a (Order.pred b)) = Finset.Icc a b - Finset.insert_Icc_succ_left_eq_Icc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {a b : α} (h : a ≤ b) : insert a (Finset.Icc (Order.succ a) b) = Finset.Icc a b - Finset.insert_Icc_left_eq_Icc_pred 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a b : α} (h : Order.pred a ≤ b) : insert (Order.pred a) (Finset.Icc a b) = Finset.Icc (Order.pred a) b - Finset.insert_Icc_right_eq_Icc_succ 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {a b : α} (h : a ≤ Order.succ b) : insert (Order.succ b) (Finset.Icc a b) = Finset.Icc a (Order.succ b) - Finset.Icc_add_one_left_eq_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] [NoMaxOrder α] (a b : α) : Finset.Icc (a + 1) b = Finset.Ioc a b - Finset.Icc_sub_one_right_eq_Ico 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] [NoMinOrder α] (a b : α) : Finset.Icc a (b - 1) = Finset.Ico a b - Finset.Ico_add_one_right_eq_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] [NoMaxOrder α] (a b : α) : Finset.Ico a (b + 1) = Finset.Icc a b - Finset.Ioc_sub_one_left_eq_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] [NoMinOrder α] (a b : α) : Finset.Ioc (a - 1) b = Finset.Icc a b - Finset.Icc_add_one_left_eq_Ioc_of_not_isMax 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {a : α} (ha : ¬IsMax a) (b : α) : Finset.Icc (a + 1) b = Finset.Ioc a b - Finset.Icc_sub_one_right_eq_Ico_of_not_isMin 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {b : α} (hb : ¬IsMin b) (a : α) : Finset.Icc a (b - 1) = Finset.Ico a b - Finset.Ico_add_one_right_eq_Icc_of_not_isMax 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {b : α} (hb : ¬IsMax b) (a : α) : Finset.Ico a (b + 1) = Finset.Icc a b - Finset.Ioc_sub_one_left_eq_Icc_of_not_isMin 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a : α} (ha : ¬IsMin a) (b : α) : Finset.Ioc (a - 1) b = Finset.Icc a b - Finset.insert_Icc_add_one_left_eq_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {a b : α} (h : a ≤ b) : insert a (Finset.Icc (a + 1) b) = Finset.Icc a b - Finset.insert_Icc_sub_one_right_eq_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a b : α} (h : a ≤ b) : insert b (Finset.Icc a (b - 1)) = Finset.Icc a b - Finset.Icc_add_one_sub_one_eq_Ioo 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [Sub α] [SuccAddOrder α] [PredSubOrder α] [Nontrivial α] (a b : α) : Finset.Icc (a + 1) (b - 1) = Finset.Ioo a b - Finset.insert_Icc_left_eq_Icc_sub_one 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a b : α} (h : a - 1 ≤ b) : insert (a - 1) (Finset.Icc a b) = Finset.Icc (a - 1) b - Finset.insert_Icc_right_eq_Icc_add_one 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {a b : α} (h : a ≤ b + 1) : insert (b + 1) (Finset.Icc a b) = Finset.Icc a (b + 1) - Finset.add_sum_Ico_eq_sum_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : f b + ∑ x ∈ Finset.Ico a b, f x = ∑ x ∈ Finset.Icc a b, f x - Finset.add_sum_Ioc_eq_sum_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : f a + ∑ x ∈ Finset.Ioc a b, f x = ∑ x ∈ Finset.Icc a b, f x - Finset.mul_prod_Ico_eq_prod_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : f b * ∏ x ∈ Finset.Ico a b, f x = ∏ x ∈ Finset.Icc a b, f x - Finset.mul_prod_Ioc_eq_prod_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : f a * ∏ x ∈ Finset.Ioc a b, f x = ∏ x ∈ Finset.Icc a b, f x - Finset.prod_Ico_mul_eq_prod_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : (∏ x ∈ Finset.Ico a b, f x) * f b = ∏ x ∈ Finset.Icc a b, f x - Finset.prod_Ioc_mul_eq_prod_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : (∏ x ∈ Finset.Ioc a b, f x) * f a = ∏ x ∈ Finset.Icc a b, f x - Finset.sum_Ico_add_eq_sum_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : ∑ x ∈ Finset.Ico a b, f x + f b = ∑ x ∈ Finset.Icc a b, f x - Finset.sum_Ioc_add_eq_sum_Icc 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] {f : α → M} {a b : α} [PartialOrder α] [LocallyFiniteOrder α] (h : a ≤ b) : ∑ x ∈ Finset.Ioc a b, f x + f a = ∑ x ∈ Finset.Icc a b, f x - Finset.image_add_left_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] [DecidableEq α] (a b c : α) : Finset.image (fun x => c + x) (Finset.Icc a b) = Finset.Icc (c + a) (c + b) - Finset.image_add_right_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] [DecidableEq α] (a b c : α) : Finset.image (fun x => x + c) (Finset.Icc a b) = Finset.Icc (a + c) (b + c) - Finset.map_add_left_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (a b c : α) : Finset.map (addLeftEmbedding c) (Finset.Icc a b) = Finset.Icc (c + a) (c + b) - Finset.map_add_right_Icc 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (a b c : α) : Finset.map (addRightEmbedding c) (Finset.Icc a b) = Finset.Icc (a + c) (b + c) - Finset.prod_Icc_div 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_4} {m n : ℕ} [CommGroup M] (hmn : m ≤ n) (f : ℕ → M) : ∏ i ∈ Finset.Icc m n, f (i + 1) / f i = f (n + 1) / f m - Finset.sum_Icc_sub 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_4} {m n : ℕ} [AddCommGroup M] (hmn : m ≤ n) (f : ℕ → M) : ∑ i ∈ Finset.Icc m n, (f (i + 1) - f i) = f (n + 1) - f m - Finset.prod_fin_Icc_eq_prod_nat_Icc 📋 Mathlib.Algebra.BigOperators.Intervals
{α : Type u_1} [CommMonoid α] {n : ℕ} (a b : Fin n) (f : Fin n → α) : ∏ i ∈ Finset.Icc a b, f i = ∏ i ∈ Finset.Icc ↑a ↑b, if h : i < n then f ⟨i, h⟩ else 1 - Finset.sum_fin_Icc_eq_sum_nat_Icc 📋 Mathlib.Algebra.BigOperators.Intervals
{α : Type u_1} [AddCommMonoid α] {n : ℕ} (a b : Fin n) (f : Fin n → α) : ∑ i ∈ Finset.Icc a b, f i = ∑ i ∈ Finset.Icc ↑a ↑b, if h : i < n then f ⟨i, h⟩ else 0 - Finset.prod_Icc_succ_top 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [CommMonoid M] {a b : ℕ} (hab : a ≤ b + 1) (f : ℕ → M) : ∏ k ∈ Finset.Icc a (b + 1), f k = (∏ k ∈ Finset.Icc a b, f k) * f (b + 1) - Finset.sum_Icc_succ_top 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [AddCommMonoid M] {a b : ℕ} (hab : a ≤ b + 1) (f : ℕ → M) : ∑ k ∈ Finset.Icc a (b + 1), f k = ∑ k ∈ Finset.Icc a b, f k + f (b + 1) - Fin.prod_Icc_div 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [CommGroup M] {n : ℕ} {a b : Fin n} (hab : a ≤ b) (f : Fin (n + 1) → M) : ∏ i ∈ Finset.Icc a b, f i.succ / f i.castSucc = f b.succ / f a.castSucc - Fin.sum_Icc_sub 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [AddCommGroup M] {n : ℕ} {a b : Fin n} (hab : a ≤ b) (f : Fin (n + 1) → M) : ∑ i ∈ Finset.Icc a b, (f i.succ - f i.castSucc) = f b.succ - f a.castSucc - Nat.sum_Icc_choose 📋 Mathlib.Data.Nat.Choose.Sum
(n k : ℕ) : ∑ m ∈ Finset.Icc k n, m.choose k = (n + 1).choose (k + 1) - Nat.Icc_factorization_eq_pow_dvd 📋 Mathlib.Data.Nat.Factorization.Basic
(n : ℕ) {p : ℕ} (pp : Nat.Prime p) : Finset.Icc 1 (n.factorization p) = {i ∈ Finset.Ico 1 n | p ^ i ∣ n} - Nat.Ico_filter_pow_dvd_eq 📋 Mathlib.Data.Nat.Factorization.Basic
{n p b : ℕ} (pp : Nat.Prime p) (hn : n ≠ 0) (hb : n ≤ p ^ b) : {i ∈ Finset.Ico 1 n | p ^ i ∣ n} = {i ∈ Finset.Icc 1 b | p ^ i ∣ n} - Polynomial.coeff_divByMonic_X_sub_C 📋 Mathlib.Algebra.Polynomial.Div
{R : Type u} [Ring R] (p : Polynomial R) (a : R) (n : ℕ) : (p /ₘ (Polynomial.X - Polynomial.C a)).coeff n = ∑ i ∈ Finset.Icc (n + 1) p.natDegree, a ^ (i - (n + 1)) * p.coeff i - Int.card_Icc 📋 Mathlib.Data.Int.Interval
(a b : ℤ) : (Finset.Icc a b).card = (b + 1 - a).toNat - Int.Icc_eq_pair 📋 Mathlib.Data.Int.Interval
(a : ℤ) : Finset.Icc a (a + 1) = {a, a + 1} - Int.card_Icc_of_le 📋 Mathlib.Data.Int.Interval
(a b : ℤ) (h : a ≤ b + 1) : ↑(Finset.Icc a b).card = b + 1 - a - Int.Icc_eq_finset_map 📋 Mathlib.Data.Int.Interval
(a b : ℤ) : Finset.Icc a b = Finset.map (Nat.castEmbedding.trans (addLeftEmbedding a)) (Finset.range (b + 1 - a).toNat) - Finset.Icc_succ_succ 📋 Mathlib.Data.Int.Interval
(m n : ℕ) : Finset.Icc (-(↑m + 1)) (↑n + 1) = Finset.Icc (-↑m) ↑n ∪ {-(↑m + 1), ↑n + 1} - Finset.prod_Icc_eq_prod_Ico_mul 📋 Mathlib.Algebra.BigOperators.Group.Finset.Interval
{α : Type u_1} [CommMonoid α] (f : ℤ → α) {l u : ℤ} (h : l ≤ u) : ∏ m ∈ Finset.Icc l u, f m = (∏ m ∈ Finset.Ico l u, f m) * f u - Finset.sum_Icc_eq_sum_Ico_add 📋 Mathlib.Algebra.BigOperators.Group.Finset.Interval
{α : Type u_1} [AddCommMonoid α] (f : ℤ → α) {l u : ℤ} (h : l ≤ u) : ∑ m ∈ Finset.Icc l u, f m = ∑ m ∈ Finset.Ico l u, f m + f u - Finset.prod_Icc_of_even_eq_range 📋 Mathlib.Algebra.BigOperators.Group.Finset.Interval
{α : Type u_1} [CommGroup α] {f : ℤ → α} (hf : Function.Even f) (N : ℕ) : ∏ m ∈ Finset.Icc (-↑N) ↑N, f m = (∏ m ∈ Finset.range (N + 1), f ↑m) ^ 2 / f 0 - Finset.sum_Icc_of_even_eq_range 📋 Mathlib.Algebra.BigOperators.Group.Finset.Interval
{α : Type u_1} [AddCommGroup α] {f : ℤ → α} (hf : Function.Even f) (N : ℕ) : ∑ m ∈ Finset.Icc (-↑N) ↑N, f m = 2 • ∑ m ∈ Finset.range (N + 1), f ↑m - f 0 - Finset.prod_Icc_succ_eq_mul_endpoints 📋 Mathlib.Algebra.BigOperators.Group.Finset.Interval
{R : Type u_1} [CommGroup R] (f : ℤ → R) {N : ℕ} : ∏ m ∈ Finset.Icc (-(↑N + 1)) (↑N + 1), f m = f (↑N + 1) * f (-(↑N + 1)) * ∏ m ∈ Finset.Icc (-↑N) ↑N, f m - Finset.sum_Icc_succ_eq_add_endpoints 📋 Mathlib.Algebra.BigOperators.Group.Finset.Interval
{R : Type u_1} [AddCommGroup R] (f : ℤ → R) {N : ℕ} : ∑ m ∈ Finset.Icc (-(↑N + 1)) (↑N + 1), f m = f (↑N + 1) + f (-(↑N + 1)) + ∑ m ∈ Finset.Icc (-↑N) ↑N, f m - Nat.Partition.toFinsuppAntidiag_mem_finsuppAntidiag 📋 Mathlib.Combinatorics.Enumerative.Partition.Basic
{n : ℕ} (p : n.Partition) : p.toFinsuppAntidiag ∈ (Finset.Icc 1 n).finsuppAntidiag n - Finset.Icc_add_Icc_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [Preorder α] [DecidableEq α] [AddLeftMono α] [AddRightMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Icc a b + Finset.Icc c d ⊆ Finset.Icc (a + c) (b + d) - Finset.Icc_mul_Icc_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [Preorder α] [DecidableEq α] [MulLeftMono α] [MulRightMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Icc a b * Finset.Icc c d ⊆ Finset.Icc (a * c) (b * d) - Finset.Icc_add_Ico_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [PartialOrder α] [DecidableEq α] [AddLeftStrictMono α] [AddRightStrictMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Icc a b + Finset.Ico c d ⊆ Finset.Ico (a + c) (b + d) - Finset.Icc_mul_Ico_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [PartialOrder α] [DecidableEq α] [MulLeftStrictMono α] [MulRightStrictMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Icc a b * Finset.Ico c d ⊆ Finset.Ico (a * c) (b * d) - Finset.Ico_add_Icc_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [PartialOrder α] [DecidableEq α] [AddLeftStrictMono α] [AddRightStrictMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Ico a b + Finset.Icc c d ⊆ Finset.Ico (a + c) (b + d) - Finset.Ico_mul_Icc_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [PartialOrder α] [DecidableEq α] [MulLeftStrictMono α] [MulRightStrictMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Ico a b * Finset.Icc c d ⊆ Finset.Ico (a * c) (b * d) - Nat.prod_Icc_factorial 📋 Mathlib.Data.Nat.Factorial.SuperFactorial
(n : ℕ) : ∏ x ∈ Finset.Icc 1 n, x.factorial = n.superFactorial - LieAlgebra.IsKilling.rootSpace_zsmul_add_ne_bot_iff_mem 📋 Mathlib.Algebra.Lie.Weights.RootSystem
{K : Type u_1} {L : Type u_2} [Field K] [CharZero K] [LieRing L] [LieAlgebra K L] [LieAlgebra.IsKilling K L] [FiniteDimensional K L] {H : LieSubalgebra K L} [H.IsCartanSubalgebra] [LieModule.IsTriangularizable K (↥H) L] (α β : LieModule.Weight K (↥H) L) (hα : α.IsNonZero) (n : ℤ) : LieAlgebra.rootSpace H (n • ⇑α + ⇑β) ≠ ⊥ ↔ n ∈ Finset.Icc (-↑(LieModule.chainBotCoeff (⇑α) β)) ↑(LieModule.chainTopCoeff (⇑α) β) - SummationFilter.conditional_filter 📋 Mathlib.Topology.Algebra.InfiniteSum.SummationFilter
(β : Type u_2) [Preorder β] [LocallyFiniteOrder β] : (SummationFilter.conditional β).filter = Filter.map (fun p => Finset.Icc p.1 p.2) (Filter.atBot ×ˢ Filter.atTop) - IsStrictOrderedRing.int_mem_Icc_of_mul_mem_Ioo 📋 Mathlib.Algebra.Order.Ring.Interval
{R : Type u_1} [Ring R] [LinearOrder R] [IsStrictOrderedRing R] {r : R} (hr : 0 < r) {k m n : ℤ} (h : r * ↑k ∈ Set.Ioo (r * ↑(m - 1)) (r * ↑(n + 1))) : k ∈ Finset.Icc m n - ZLattice.sum_piFinset_Icc_rpow_le 📋 Mathlib.Algebra.Module.ZLattice.Summable
{E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {L : Submodule ℤ E} [DiscreteTopology ↥L] {ι : Type u_3} [Fintype ι] [DecidableEq ι] (b : Module.Basis ι ℤ ↥L) {d : ℕ} (hd : d = Fintype.card ι) (n : ℕ) (r : ℝ) (hr : r < -↑d) : ∑ p ∈ Fintype.piFinset fun x => Finset.Icc (-↑n) ↑n, ‖∑ i, p i • b i‖ ^ r ≤ 2 * ↑d * 3 ^ (d - 1) * ZLattice.normBound b ^ r * ∑' (k : ℕ), ↑k ^ (↑d - 1 + r) - Polynomial.irreducible_of_degree_le_three_of_not_isRoot 📋 Mathlib.Algebra.Polynomial.SpecificDegree
{K : Type u_1} [Field K] {p : Polynomial K} (hdeg : p.natDegree ∈ Finset.Icc 1 3) (hnot : ∀ (x : K), ¬p.IsRoot x) : Irreducible p - Finsupp.coe_rangeIcc 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [Zero α] [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq ι] {i : ι} (f g : ι →₀ α) : (f.rangeIcc g) i = Finset.Icc (f i) (g i) - Finsupp.rangeIcc_apply 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [Zero α] [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq ι] (f g : ι →₀ α) (i : ι) : (f.rangeIcc g) i = Finset.Icc (f i) (g i) - Finsupp.Icc_eq 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [PartialOrder α] [Zero α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f g : ι →₀ α) : Finset.Icc f g = (f.support ∪ g.support).finsupp ⇑(f.rangeIcc g) - Finsupp.card_Icc 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [PartialOrder α] [Zero α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f g : ι →₀ α) : (Finset.Icc f g).card = ∏ i ∈ f.support ∪ g.support, (Finset.Icc (f i) (g i)).card - Finsupp.card_Ico 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [PartialOrder α] [Zero α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f g : ι →₀ α) : (Finset.Ico f g).card = ∏ i ∈ f.support ∪ g.support, (Finset.Icc (f i) (g i)).card - 1 - Finsupp.card_Ioc 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [PartialOrder α] [Zero α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f g : ι →₀ α) : (Finset.Ioc f g).card = ∏ i ∈ f.support ∪ g.support, (Finset.Icc (f i) (g i)).card - 1 - Finsupp.card_Ioo 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [PartialOrder α] [Zero α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f g : ι →₀ α) : (Finset.Ioo f g).card = ∏ i ∈ f.support ∪ g.support, (Finset.Icc (f i) (g i)).card - 2 - Finset.Icc_eq_filter_powerset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] (s t : Finset α) : Finset.Icc s t = {u ∈ t.powerset | s ⊆ u} - Finset.card_Icc_finset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] {s t : Finset α} (h : s ⊆ t) : (Finset.Icc s t).card = 2 ^ (t.card - s.card)
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