Loogle!
Result
Found 255 declarations mentioning Finset.Ioc. Of these, only the first 200 are shown.
- Finset.Ioc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset α - Finset.coe_Ioc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : α) : ↑(Finset.Ioc b a) = Set.Ioc b a - Set.toFinset_Ioc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_3} [Preorder α] [LocallyFiniteOrder α] (b a : α) [Fintype ↑(Set.Ioc b a)] : (Set.Ioc b a).toFinset = Finset.Ioc b a - Fintype.card_Ioc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : α) [Fintype ↑(Set.Ioc b a)] : Fintype.card ↑(Set.Ioc b a) = (Finset.Ioc b a).card - Finset.Ioi_eq_Ioc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] [OrderTop α] (a : α) : Finset.Ioi a = Finset.Ioc a ⊤ - Finset.mem_Ioc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] {a b x : α} : x ∈ Finset.Ioc a b ↔ a < x ∧ x ≤ b - Finset.mem_Ioc' 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] {a b x : α} : x ∈ Finset.Ioc a b ↔ x ≤ b ∧ a < x - Finset.subtype_Ioc_eq 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] (p : α → Prop) [DecidablePred p] [LocallyFiniteOrder α] (b a : Subtype p) : Finset.Ioc b a = Finset.subtype p (Finset.Ioc ↑b ↑a) - WithBot.Ioc_coe_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] (a b : α) : Finset.Ioc ↑b ↑a = Finset.map Function.Embedding.some (Finset.Ioc b a) - WithTop.Ioc_coe_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderTop α] [LocallyFiniteOrder α] (a b : α) : Finset.Ioc ↑a ↑b = Finset.map Function.Embedding.some (Finset.Ioc a b) - WithBot.Ioc_bot_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] (a : α) : Finset.Ioc ⊥ ↑a = Finset.map Function.Embedding.some (Finset.Iic a) - Finset.map_subtype_embedding_Ioc 📋 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.Ioc a b) = Finset.Ioc ↑a ↑b - Finset.Ico_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset.Ico (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioc b a) - Finset.Ioc_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : α) : Finset.Ioc (OrderDual.toDual b) (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ico a b) - Finset.Ico_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ico (OrderDual.ofDual a) (OrderDual.ofDual b) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ioc b a) - Finset.Ioc_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : αᵒᵈ) : Finset.Ioc (OrderDual.ofDual b) (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ico a b) - Finset.Ico_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ico a b = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioc (OrderDual.ofDual b) (OrderDual.ofDual a)) - Finset.Ioc_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (b a : αᵒᵈ) : Finset.Ioc b a = Finset.map OrderDual.toDual.toEmbedding (Finset.Ico (OrderDual.ofDual a) (OrderDual.ofDual b)) - WithTop.Ioc_coe_top 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderTop α] [LocallyFiniteOrder α] (a : α) : Finset.Ioc ↑a ⊤ = Finset.insertNone (Finset.Ioi a) - Finset.Ioc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} (a : α) [Preorder α] [LocallyFiniteOrder α] : Finset.Ioc a a = ∅ - Finset.Aesop.nonempty_Ioc_of_lt 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : a < b → (Finset.Ioc a b).Nonempty - Finset.nonempty_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : (Finset.Ioc a b).Nonempty ↔ a < b - Finset.left_notMem_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : a ∉ Finset.Ioc a b - Finset.Ioc_eq_empty_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] (h : b ≤ a) : Finset.Ioc a b = ∅ - Finset.Ioc_eq_empty 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : ¬a < b → Finset.Ioc a b = ∅ - Finset.Ioc_eq_empty_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Ioc a b = ∅ ↔ ¬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_Ioc_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Ioc a b - Finset.Ioc_subset_Ici_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderTop α] [LocallyFiniteOrder α] : Finset.Ioc a b ⊆ Finset.Ici a - Finset.Ioc_subset_Iic_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] [LocallyFiniteOrder α] : Finset.Ioc a b ⊆ Finset.Iic b - Finset.Ioc_subset_Ioi_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderTop α] [LocallyFiniteOrder α] : Finset.Ioc a b ⊆ Finset.Ioi a - Finset.right_mem_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : b ∈ Finset.Ioc 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.Ioc_erase_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] (a b : α) : (Finset.Ioc a b).erase b = Finset.Ioo a b - Finset.Ioc_disjoint_Ioc_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b c : α} [Preorder α] [LocallyFiniteOrder α] {d : α} (hbc : b ≤ c) : Disjoint (Finset.Ioc a b) (Finset.Ioc c d) - Finset.Iic_disjoint_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b c : α} [Preorder α] [LocallyFiniteOrderBot α] [LocallyFiniteOrder α] (h : a ≤ b) : Disjoint (Finset.Iic a) (Finset.Ioc b c) - Finset.Ioc_top 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a : α} [Preorder α] [LocallyFiniteOrder α] [OrderTop α] : Finset.Ioc a ⊤ = Finset.Ioi a - Finset.Ioc_subset_Ioc_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b : α} [Preorder α] [LocallyFiniteOrder α] (h : a₁ ≤ a₂) : Finset.Ioc a₂ b ⊆ Finset.Ioc a₁ b - Finset.Ioc_subset_Ioc_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h : b₁ ≤ b₂) : Finset.Ioc a b₁ ⊆ Finset.Ioc a b₂ - Finset.Ioc_subset_Ioo_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h : b₁ < b₂) : Finset.Ioc a b₁ ⊆ Finset.Ioo a b₂ - 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_Ioc_sub_one 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] (a b : α) : (Finset.Ioo a b).card = (Finset.Ioc a b).card - 1 - Finset.Ioc_subset_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (ha : a₂ ≤ a₁) (hb : b₁ ≤ b₂) : Finset.Ioc a₁ b₁ ⊆ Finset.Ioc 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.Ioo_insert_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a < b) : insert b (Finset.Ioo a b) = Finset.Ioc 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.Ioc_eq_cons_Ioo 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} (h : a < b) : Finset.Ioc a b = Finset.cons b (Finset.Ioo a b) ⋯ - Finset.Ioc_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.Ioc a b | x < c} = Finset.Ioc a 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_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.Ioc_diff_Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a < b) : Finset.Ioc a b \ Finset.Ioo a b = {b} - Finset.Ioc_sdiff_Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a < b) : Finset.Ioc a b \ Finset.Ioo 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.filter_lt_le_eq_Ioc 📋 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.Ioc a b - Finset.Ioc_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.Ioc a b) = Finset.Ioc (a, c) (b, c) - Finset.Ioc_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.Ioc a b) = Finset.Ioc (c, a) (c, b) - Finset.Ioc_disjoint_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [LinearOrder α] [LocallyFiniteOrder α] : Disjoint (Finset.Ioc a₁ a₂) (Finset.Ioc b₁ b₂) ↔ min a₂ b₂ ≤ max a₁ b₁ - Finset.Iic_diff_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [LinearOrder α] [LocallyFiniteOrder α] [LocallyFiniteOrderBot α] : Finset.Iic b \ Finset.Ioc a b = Finset.Iic (min a b) - Finset.Iic_sdiff_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [LinearOrder α] [LocallyFiniteOrder α] [LocallyFiniteOrderBot α] : Finset.Iic b \ Finset.Ioc a b = Finset.Iic (min a b) - Finset.Ioc_inter_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] {a b c d : α} : Finset.Ioc a b ∩ Finset.Ioc c d = Finset.Ioc (max a c) (min b d) - Finset.Iic_diff_Ioc_self_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [LinearOrder α] [LocallyFiniteOrder α] [LocallyFiniteOrderBot α] (hab : a ≤ b) : Finset.Iic b \ Finset.Ioc a b = Finset.Iic a - Finset.Iic_sdiff_Ioc_self_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [LinearOrder α] [LocallyFiniteOrder α] [LocallyFiniteOrderBot α] (hab : a ≤ b) : Finset.Iic b \ Finset.Ioc a b = Finset.Iic a - Finset.Iic_union_Ioc_eq_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [LinearOrder α] [LocallyFiniteOrder α] [LocallyFiniteOrderBot α] (h : a ≤ b) : Finset.Iic a ∪ Finset.Ioc a b = Finset.Iic b - Finset.Ioc_union_Ioc_eq_Ioc 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] {a b c : α} (h₁ : a ≤ b) (h₂ : b ≤ c) : Finset.Ioc a b ∪ Finset.Ioc b c = Finset.Ioc a c - Nat.card_Ioc 📋 Mathlib.Order.Interval.Finset.Nat
(a b : ℕ) : (Finset.Ioc a b).card = b - a - Nat.Ioc_succ_singleton 📋 Mathlib.Order.Interval.Finset.Nat
(b : ℕ) : Finset.Ioc b (b + 1) = {b + 1} - Nat.mem_Ioc_succ 📋 Mathlib.Order.Interval.Finset.Nat
{a b : ℕ} : a ∈ Finset.Ioc b (b + 1) ↔ a = b + 1 - Nat.Ioc_eq_range' 📋 Mathlib.Order.Interval.Finset.Nat
(a b : ℕ) : Finset.Ioc a b = { val := ↑(List.range' (a + 1) (b - a)), nodup := ⋯ } - Nat.mem_Ioc_succ' 📋 Mathlib.Order.Interval.Finset.Nat
{b : ℕ} (a : ↥(Finset.Ioc b (b + 1))) : a = ⟨b + 1, ⋯⟩ - Fin.card_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.Ioc a b).card = ↑b - ↑a - Fin.map_valEmbedding_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : Finset.map Fin.valEmbedding (Finset.Ioc a b) = Finset.Ioc ↑a ↑b - Fin.finsetImage_val_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : Finset.image Fin.val (Finset.Ioc a b) = Finset.Ioc ↑a ↑b - Fin.finsetImage_rev_Ico 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.rev (Finset.Ico i j) = Finset.Ioc j.rev i.rev - Fin.finsetImage_rev_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.rev (Finset.Ioc i j) = Finset.Ico j.rev i.rev - Fin.map_revPerm_Ico 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ico i j) = Finset.Ioc j.rev i.rev - Fin.map_revPerm_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ioc i j) = Finset.Ico j.rev i.rev - Fin.map_castLEEmb_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a b : Fin n) (h : n ≤ m) : Finset.map (Fin.castLEEmb h) (Finset.Ioc a b) = Finset.Ioc (Fin.castLE h a) (Fin.castLE h b) - Fin.finsetImage_cast_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.image (Fin.cast h) (Finset.Ioc i j) = Finset.Ioc (Fin.cast h i) (Fin.cast h j) - Fin.finsetImage_castLE_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a b : Fin n) (h : n ≤ m) : Finset.image (Fin.castLE h) (Finset.Ioc a b) = Finset.Ioc (Fin.castLE h a) (Fin.castLE h b) - Fin.map_finCongr_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ioc i j) = Finset.Ioc (Fin.cast h i) (Fin.cast h j) - 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.Ioc_sub_one_eq_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (hb : 0 < b) : Finset.Ioc a (b - 1) = Finset.Ioo 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.Ioo_add_one_eq_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (hb : ↑b + 1 < n) : Finset.Ioo a (b + 1) = Finset.Ioc a b - Fin.map_addNatEmb_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.addNatEmb m) (Finset.Ioc i j) = Finset.Ioc (i.addNat m) (j.addNat m) - Fin.map_castAddEmb_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.castAddEmb m) (Finset.Ioc i j) = Finset.Ioc (Fin.castAdd m i) (Fin.castAdd m j) - Fin.map_natAddEmb_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.natAddEmb m) (Finset.Ioc i j) = Finset.Ioc (Fin.natAdd m i) (Fin.natAdd m j) - Fin.finsetImage_castAdd_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (Fin.castAdd m) (Finset.Ioc i j) = Finset.Ioc (Fin.castAdd m i) (Fin.castAdd m j) - Fin.finsetImage_natAdd_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (Fin.natAdd m) (Finset.Ioc i j) = Finset.Ioc (Fin.natAdd m i) (Fin.natAdd m j) - Fin.finsetImage_addNat_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (fun x => x.addNat m) (Finset.Ioc i j) = Finset.Ioc (i.addNat m) (j.addNat m) - Fin.map_castSuccEmb_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map Fin.castSuccEmb (Finset.Ioc i j) = Finset.Ioc i.castSucc j.castSucc - Fin.map_succEmb_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Fin.succEmb n) (Finset.Ioc i j) = Finset.Ioc i.succ j.succ - Fin.finsetImage_castSucc_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.castSucc (Finset.Ioc i j) = Finset.Ioc i.castSucc j.castSucc - Fin.finsetImage_succ_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.succ (Finset.Ioc i j) = Finset.Ioc i.succ j.succ - Fin.attachFin_Ioc 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.Ioc ↑a ↑b).attachFin ⋯ = Finset.Ioc a b - Fin.map_succEmb_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Fin.succEmb n) (Finset.Iic i) = Finset.Ioc 0 i.succ - Fin.finsetImage_succ_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.image Fin.succ (Finset.Iic i) = Finset.Ioc 0 i.succ - Fin.prod_Ioc_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.Ioc (Fin.cast h a) (Fin.cast h b), f i = ∏ i ∈ Finset.Ioc a b, f (Fin.cast h i) - Fin.sum_Ioc_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.Ioc (Fin.cast h a) (Fin.cast h b), f i = ∑ i ∈ Finset.Ioc a b, f (Fin.cast h i) - Fin.prod_Ioc_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.Ioc (Fin.castLE h a) (Fin.castLE h b), f i = ∏ i ∈ Finset.Ioc a b, f (Fin.castLE h i) - Fin.sum_Ioc_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.Ioc (Fin.castLE h a) (Fin.castLE h b), f i = ∑ i ∈ Finset.Ioc a b, f (Fin.castLE h i) - Fin.prod_Ioc_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a b : Fin n) : ∏ i ∈ Finset.Ioc (Fin.castAdd m a) (Fin.castAdd m b), f i = ∏ i ∈ Finset.Ioc a b, f (Fin.castAdd m i) - Fin.sum_Ioc_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a b : Fin n) : ∑ i ∈ Finset.Ioc (Fin.castAdd m a) (Fin.castAdd m b), f i = ∑ i ∈ Finset.Ioc a b, f (Fin.castAdd m i) - Fin.prod_Ioc_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∏ i ∈ Finset.Ioc a.castSucc b.castSucc, f i = ∏ i ∈ Finset.Ioc a b, f i.castSucc - Fin.prod_Ioc_succ 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∏ i ∈ Finset.Ioc a.succ b.succ, f i = ∏ i ∈ Finset.Ioc a b, f i.succ - Fin.sum_Ioc_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∑ i ∈ Finset.Ioc a.castSucc b.castSucc, f i = ∑ i ∈ Finset.Ioc a b, f i.castSucc - Fin.sum_Ioc_succ 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∑ i ∈ Finset.Ioc a.succ b.succ, f i = ∑ i ∈ Finset.Ioc a b, f i.succ - Finset.Ioc_pred_right_eq_Ioo 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] (a b : α) : Finset.Ioc a (Order.pred b) = Finset.Ioo 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.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.Ioo_succ_right_eq_Ioc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] [NoMaxOrder α] (a b : α) : Finset.Ioo a (Order.succ b) = Finset.Ioc 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.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.Ioo_succ_right_eq_Ioc_of_not_isMax 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {b : α} (hb : ¬IsMax b) (a : α) : Finset.Ioo a (Order.succ b) = Finset.Ioc a b - Finset.Ico_succ_succ_eq_Ioc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] [NoMaxOrder α] (a b : α) : Finset.Ico (Order.succ a) (Order.succ b) = Finset.Ioc a b - Finset.Ioc_pred_pred_eq_Ico 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] [NoMinOrder α] (a b : α) : Finset.Ioc (Order.pred a) (Order.pred b) = Finset.Ico a b - Finset.Ico_succ_succ_eq_Ioc_of_not_isMax 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {b : α} (hb : ¬IsMax b) (a : α) : Finset.Ico (Order.succ a) (Order.succ b) = Finset.Ioc a b - Finset.Ioc_pred_pred_eq_Ico_of_not_isMin 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a : α} (ha : ¬IsMin a) (b : α) : Finset.Ioc (Order.pred a) (Order.pred b) = Finset.Ico a b - Finset.insert_Ioc_pred_right_eq_Ioc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a b : α} (h : a < b) : insert b (Finset.Ioc a (Order.pred b)) = Finset.Ioc a b - Finset.insert_Ioc_succ_left_eq_Ioc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {a b : α} (h : a < b) : insert (Order.succ a) (Finset.Ioc (Order.succ a) b) = Finset.Ioc a b - Finset.insert_Ioc_left_eq_Ioc_pred 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a b : α} [NoMinOrder α] (h : a ≤ b) : insert a (Finset.Ioc a b) = Finset.Ioc (Order.pred a) b - Finset.insert_Ioc_left_eq_Ioc_pred_of_not_isMin 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a b : α} (h : a ≤ b) (ha : ¬IsMin a) : insert a (Finset.Ioc a b) = Finset.Ioc (Order.pred a) b - Finset.insert_Ioc_right_eq_Ioc_succ 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {a b : α} [NoMaxOrder α] (h : a ≤ b) : insert (Order.succ b) (Finset.Ioc a b) = Finset.Ioc a (Order.succ b) - Finset.insert_Ioc_right_eq_Ioc_succ_of_not_isMax 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] {a b : α} (h : a ≤ b) (hb : ¬IsMax b) : insert (Order.succ b) (Finset.Ioc a b) = Finset.Ioc a (Order.succ b) - Finset.Ioc_sub_one_right_eq_Ioo 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] (a b : α) : Finset.Ioc a (b - 1) = Finset.Ioo a 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.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.Ioo_add_one_right_eq_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] [NoMaxOrder α] (a b : α) : Finset.Ioo a (b + 1) = Finset.Ioc 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.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.Ioo_add_one_right_eq_Ioc_of_not_isMax 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {b : α} (hb : ¬IsMax b) (a : α) : Finset.Ioo a (b + 1) = Finset.Ioc a b - Finset.Ico_add_one_add_one_eq_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] [NoMaxOrder α] (a b : α) : Finset.Ico (a + 1) (b + 1) = Finset.Ioc a b - Finset.Ioc_sub_one_sub_one_eq_Ico 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] [NoMinOrder α] (a b : α) : Finset.Ioc (a - 1) (b - 1) = Finset.Ico a b - Finset.Ico_add_one_add_one_eq_Ioc_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 + 1) (b + 1) = Finset.Ioc a b - Finset.Ioc_sub_one_sub_one_eq_Ico_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 - 1) = Finset.Ico a b - Finset.insert_Ioc_sub_one_right_eq_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a b : α} (h : a < b) : insert b (Finset.Ioc a (b - 1)) = Finset.Ioc a b - Finset.insert_Ioc_add_one_left_eq_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {a b : α} (h : a < b) : insert (a + 1) (Finset.Ioc (a + 1) b) = Finset.Ioc a b - Finset.insert_Ioc_left_eq_Ioc_sub_one 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a b : α} [NoMinOrder α] (h : a ≤ b) : insert a (Finset.Ioc a b) = Finset.Ioc (a - 1) b - Finset.insert_Ioc_left_eq_Ioc_sub_one_of_not_isMin 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a b : α} (h : a ≤ b) (ha : ¬IsMin a) : insert a (Finset.Ioc a b) = Finset.Ioc (a - 1) b - Finset.insert_Ioc_right_eq_Ioc_add_one 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {a b : α} [NoMaxOrder α] (h : a ≤ b) : insert (b + 1) (Finset.Ioc a b) = Finset.Ioc a (b + 1) - Finset.insert_Ioc_right_eq_Ioc_add_one_of_not_isMax 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] {a b : α} (h : a ≤ b) (hb : ¬IsMax b) : insert (b + 1) (Finset.Ioc a b) = Finset.Ioc a (b + 1) - sup_Ioc_disjointed_of_monotone 📋 Mathlib.Order.Disjointed
{α : Type u_1} [GeneralizedBooleanAlgebra α] {ι : Type u_3} [LinearOrder ι] [LocallyFiniteOrder ι] [OrderBot ι] {f : ι → α} (hf : Monotone f) {m n : ι} (hm : n ≤ m) : (Finset.Ioc n m).sup (disjointed f) = f m \ f n - biUnion_Ioc_disjointed_of_monotone 📋 Mathlib.Order.Disjointed
{α : Type u_3} {ι : Type u_4} [LinearOrder ι] [LocallyFiniteOrder ι] [OrderBot ι] {f : ι → Set α} (hf : Monotone f) {m n : ι} (hm : n ≤ m) : ⋃ i ∈ Finset.Ioc n m, disjointed f i = f m \ f n - 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.add_sum_Ioo_eq_sum_Ioc 📋 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.Ioo a b, f x = ∑ x ∈ Finset.Ioc 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.mul_prod_Ioo_eq_prod_Ioc 📋 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.Ioo a b, f x = ∏ x ∈ Finset.Ioc 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.prod_Ioo_mul_eq_prod_Ioc 📋 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.Ioo a b, f x) * f b = ∏ x ∈ Finset.Ioc 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.sum_Ioo_add_eq_sum_Ioc 📋 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.Ioo a b, f x + f b = ∑ x ∈ Finset.Ioc a b, f x - Finset.image_add_left_Ioc 📋 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.Ioc a b) = Finset.Ioc (c + a) (c + b) - Finset.image_add_right_Ioc 📋 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.Ioc a b) = Finset.Ioc (a + c) (b + c) - Finset.map_add_left_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (a b c : α) : Finset.map (addLeftEmbedding c) (Finset.Ioc a b) = Finset.Ioc (c + a) (c + b) - Finset.map_add_right_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (a b c : α) : Finset.map (addRightEmbedding c) (Finset.Ioc a b) = Finset.Ioc (a + c) (b + c) - Finset.prod_Ioc_consecutive 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [CommMonoid M] (f : ℕ → M) {m n k : ℕ} (hmn : m ≤ n) (hnk : n ≤ k) : (∏ i ∈ Finset.Ioc m n, f i) * ∏ i ∈ Finset.Ioc n k, f i = ∏ i ∈ Finset.Ioc m k, f i - Finset.sum_Ioc_consecutive 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [AddCommMonoid M] (f : ℕ → M) {m n k : ℕ} (hmn : m ≤ n) (hnk : n ≤ k) : ∑ i ∈ Finset.Ioc m n, f i + ∑ i ∈ Finset.Ioc n k, f i = ∑ i ∈ Finset.Ioc m k, f i - Finset.prod_Ioc_succ_top 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [CommMonoid M] {a b : ℕ} (hab : a ≤ b) (f : ℕ → M) : ∏ k ∈ Finset.Ioc a (b + 1), f k = (∏ k ∈ Finset.Ioc a b, f k) * f (b + 1) - Finset.sum_Ioc_succ_top 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [AddCommMonoid M] {a b : ℕ} (hab : a ≤ b) (f : ℕ → M) : ∑ k ∈ Finset.Ioc a (b + 1), f k = ∑ k ∈ Finset.Ioc a b, f k + f (b + 1) - Polynomial.Monic.irreducible_iff_lt_natDegree_lt 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : p.Monic) (hp1 : p ≠ 1) : Irreducible p ↔ ∀ (q : Polynomial R), q.Monic → q.natDegree ∈ Finset.Ioc 0 (p.natDegree / 2) → ¬q ∣ p - Polynomial.Monic.irreducible_iff_natDegree' 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : p.Monic) : Irreducible p ↔ p ≠ 1 ∧ ∀ (f g : Polynomial R), f.Monic → g.Monic → f * g = p → g.natDegree ∉ Finset.Ioc 0 (p.natDegree / 2) - Nat.divisorsAntidiagonal_eq_prod_filter_of_le 📋 Mathlib.NumberTheory.Divisors
{n N : ℕ} (n_ne_zero : n ≠ 0) (hn : n ≤ N) : n.divisorsAntidiagonal = {x ∈ Finset.Ioc 0 N ×ˢ Finset.Ioc 0 N | x.1 * x.2 = n} - Nat.Ioc_filter_dvd_card_eq_div 📋 Mathlib.Data.Nat.Factorization.Basic
(n p : ℕ) : {x ∈ Finset.Ioc 0 n | p ∣ x}.card = n / p - Polynomial.irreducible_iff_lt_natDegree_lt 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] {p : Polynomial R} (hp0 : p ≠ 0) (hpu : ¬IsUnit p) : Irreducible p ↔ ∀ (q : Polynomial R), q.Monic → q.natDegree ∈ Finset.Ioc 0 (p.natDegree / 2) → ¬q ∣ p - Int.card_Ioc 📋 Mathlib.Data.Int.Interval
(a b : ℤ) : (Finset.Ioc a b).card = (b - a).toNat - Int.card_Ioc_of_le 📋 Mathlib.Data.Int.Interval
(a b : ℤ) (h : a ≤ b) : ↑(Finset.Ioc a b).card = b - a - Int.Ioc_eq_finset_map 📋 Mathlib.Data.Int.Interval
(a b : ℤ) : Finset.Ioc a b = Finset.map (Nat.castEmbedding.trans (addLeftEmbedding (a + 1))) (Finset.range (b - a).toNat) - Finset.Ioc_succ_succ 📋 Mathlib.Data.Int.Interval
(m n : ℕ) : Finset.Ioc (-(↑m + 1)) (↑n + 1) = Finset.Ioc (-↑m) ↑n ∪ {-↑m, ↑n + 1} - Finset.sum_Ioc_by_parts 📋 Mathlib.Algebra.BigOperators.Module
{R : Type u_1} {M : Type u_2} [Ring R] [AddCommGroup M] [Module R M] (f : ℕ → R) (g : ℕ → M) {m n : ℕ} (hmn : m < n) : ∑ i ∈ Finset.Ioc m n, f i • g i = f n • ∑ i ∈ Finset.range (n + 1), g i - f (m + 1) • ∑ i ∈ Finset.range (m + 1), g i - ∑ i ∈ Finset.Ioc m (n - 1), (f (i + 1) - f i) • ∑ i ∈ Finset.range (i + 1), g i - Finset.Ico_add_Ioc_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.Ioc c d ⊆ Finset.Ioo (a + c) (b + d) - Finset.Ico_mul_Ioc_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.Ioc c d ⊆ Finset.Ioo (a * c) (b * d) - Finset.Ioc_add_Ico_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [PartialOrder α] [DecidableEq α] [AddLeftStrictMono α] [AddRightStrictMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Ioc a b + Finset.Ico c d ⊆ Finset.Ioo (a + c) (b + d) - Finset.Ioc_mul_Ico_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [PartialOrder α] [DecidableEq α] [MulLeftStrictMono α] [MulRightStrictMono α] [LocallyFiniteOrder α] (a b c d : α) : Finset.Ioc a b * Finset.Ico c d ⊆ Finset.Ioo (a * c) (b * d) - sum_Ioc_inv_sq_le_sub 📋 Mathlib.Analysis.PSeries
{α : Type u_1} [Field α] [LinearOrder α] [IsStrictOrderedRing α] {k n : ℕ} (hk : k ≠ 0) (h : k ≤ n) : ∑ i ∈ Finset.Ioc k n, (↑i ^ 2)⁻¹ ≤ (↑k)⁻¹ - (↑n)⁻¹ - ArithmeticFunction.sum_Ioc_zeta 📋 Mathlib.NumberTheory.ArithmeticFunction.Misc
(N : ℕ) : ∑ n ∈ Finset.Ioc 0 N, ArithmeticFunction.zeta n = N - ArithmeticFunction.sum_Ioc_sigma0_eq_sum_div 📋 Mathlib.NumberTheory.ArithmeticFunction.Misc
(N : ℕ) : ∑ n ∈ Finset.Ioc 0 N, (ArithmeticFunction.sigma 0) n = ∑ n ∈ Finset.Ioc 0 N, N / n - ArithmeticFunction.sum_Ioc_mul_zeta_eq_sum 📋 Mathlib.NumberTheory.ArithmeticFunction.Misc
{R : Type u_2} [Semiring R] (f : ArithmeticFunction R) (N : ℕ) : ∑ n ∈ Finset.Ioc 0 N, (f * ↑ArithmeticFunction.zeta) n = ∑ n ∈ Finset.Ioc 0 N, f n * ↑(N / n) - ArithmeticFunction.sum_Ioc_mul_eq_sum_sum 📋 Mathlib.NumberTheory.ArithmeticFunction.Misc
{R : Type u_2} [Semiring R] (f g : ArithmeticFunction R) (N : ℕ) : ∑ n ∈ Finset.Ioc 0 N, (f * g) n = ∑ n ∈ Finset.Ioc 0 N, f n * ∑ m ∈ Finset.Ioc 0 (N / n), g m - ArithmeticFunction.sum_Ioc_mul_eq_sum_prod_filter 📋 Mathlib.NumberTheory.ArithmeticFunction.Misc
{R : Type u_2} [Semiring R] (f g : ArithmeticFunction R) (N : ℕ) : ∑ n ∈ Finset.Ioc 0 N, (f * g) n = ∑ x ∈ Finset.Ioc 0 N ×ˢ Finset.Ioc 0 N with x.1 * x.2 ≤ N, f x.1 * g x.2 - Finset.sum_le_sum_Ioc 📋 Mathlib.Algebra.Order.Group.Int.Sum
{s : Finset ℤ} {c : ℤ} (hs : ∀ x ∈ s, x ≤ c) : ∑ x ∈ s, x ≤ ∑ x ∈ Finset.Ioc (c - ↑s.card) c, x - 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 - Finset.Ioc_eq_filter_powerset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] (s t : Finset α) : Finset.Ioc s t = {u ∈ t.powerset | s ⊂ u} - Finset.card_Ioc_finset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] {s t : Finset α} (h : s ⊆ t) : (Finset.Ioc s t).card = 2 ^ (t.card - s.card) - 1 - IncidenceAlgebra.mu_eq_neg_sum_Ioc_of_ne 📋 Mathlib.Combinatorics.Enumerative.IncidenceAlgebra
{𝕜 : Type u_1} {α : Type u_4} [Ring 𝕜] [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] {a b : α} (hab : a ≠ b) : (IncidenceAlgebra.mu 𝕜) a b = -∑ x ∈ Finset.Ioc a b, (IncidenceAlgebra.mu 𝕜) x b - schnirelmannDensity_mul_le_card_filter 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {n : ℕ} : schnirelmannDensity A * ↑n ≤ ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card - schnirelmannDensity_le_div 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {n : ℕ} (hn : n ≠ 0) : schnirelmannDensity A ≤ ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card / ↑n - schnirelmannDensity_le_of_le 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {x : ℝ} (n : ℕ) (hn : n ≠ 0) (hx : ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card / ↑n ≤ x) : schnirelmannDensity A ≤ x - le_schnirelmannDensity_iff 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {x : ℝ} : x ≤ schnirelmannDensity A ↔ ∀ (n : ℕ), 0 < n → x ≤ ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card / ↑n - schnirelmannDensity_lt_iff 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {x : ℝ} : schnirelmannDensity A < x ↔ ∃ n, 0 < n ∧ ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card / ↑n < x - exists_of_schnirelmannDensity_eq_zero 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {ε : ℝ} (hε : 0 < ε) (hA : schnirelmannDensity A = 0) : ∃ n, 0 < n ∧ ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card / ↑n < ε - schnirelmannDensity_le_iff_forall 📋 Mathlib.Combinatorics.Schnirelmann
{A : Set ℕ} [DecidablePred fun x => x ∈ A] {x : ℝ} : schnirelmannDensity A ≤ x ↔ ∀ (ε : ℝ), 0 < ε → ∃ n, 0 < n ∧ ↑{a ∈ Finset.Ioc 0 n | a ∈ A}.card / ↑n < x + ε - DFinsupp.card_Ioc 📋 Mathlib.Data.DFinsupp.Interval
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → DecidableEq (α i)] [(i : ι) → PartialOrder (α i)] [(i : ι) → Zero (α i)] [(i : ι) → LocallyFiniteOrder (α i)] (f g : Π₀ (i : ι), α i) : (Finset.Ioc f g).card = ∏ i ∈ f.support ∪ g.support, (Finset.Icc (f i) (g i)).card - 1 - Nat.Ioc_filter_modEq_cast 📋 Mathlib.Data.Int.CardIntervalMod
(a b : ℕ) {r v : ℕ} : Finset.map Nat.castEmbedding ({x ∈ Finset.Ioc a b | x ≡ v [MOD r]}) = {x ∈ Finset.Ioc ↑a ↑b | x ≡ ↑v [ZMOD ↑r]} - Int.Ioc_filter_dvd_card 📋 Mathlib.Data.Int.CardIntervalMod
(a b : ℤ) {r : ℤ} (hr : 0 < r) : ↑{x ∈ Finset.Ioc a b | r ∣ x}.card = max (⌊↑b / ↑r⌋ - ⌊↑a / ↑r⌋) 0 - Int.Ioc_filter_modEq_card 📋 Mathlib.Data.Int.CardIntervalMod
(a b : ℤ) {r : ℤ} (hr : 0 < r) (v : ℤ) : ↑{x ∈ Finset.Ioc a b | x ≡ v [ZMOD r]}.card = max (⌊(↑b - ↑v) / ↑r⌋ - ⌊(↑a - ↑v) / ↑r⌋) 0 - Nat.Ioc_filter_modEq_card 📋 Mathlib.Data.Int.CardIntervalMod
(a b : ℕ) {r : ℕ} (hr : 0 < r) (v : ℕ) : ↑{x ∈ Finset.Ioc a b | x ≡ v [MOD r]}.card = max (⌊(↑b - ↑v) / ↑r⌋ - ⌊(↑a - ↑v) / ↑r⌋) 0 - Int.Ioc_filter_dvd_eq 📋 Mathlib.Data.Int.CardIntervalMod
(a b : ℤ) {r : ℤ} (hr : 0 < r) : {x ∈ Finset.Ioc a b | r ∣ x} = Finset.map { toFun := fun x => x * r, inj' := ⋯ } (Finset.Ioc ⌊↑a / ↑r⌋ ⌊↑b / ↑r⌋) - Int.Ioc_filter_modEq_eq 📋 Mathlib.Data.Int.CardIntervalMod
(a b : ℤ) {r : ℤ} (v : ℤ) : {x ∈ Finset.Ioc a b | x ≡ v [ZMOD r]} = Finset.map { toFun := fun x => x + v, inj' := ⋯ } ({x ∈ Finset.Ioc (a - v) (b - v) | r ∣ x}) - Multiset.card_Ioc 📋 Mathlib.Data.Multiset.Interval
{α : Type u_1} [DecidableEq α] (s t : Multiset α) : (Finset.Ioc s t).card = ∏ i ∈ s.toFinset ∪ t.toFinset, (Multiset.count i t + 1 - Multiset.count i s) - 1 - PNat.card_Ioc 📋 Mathlib.Data.PNat.Interval
(a b : ℕ+) : (Finset.Ioc a b).card = ↑b - ↑a
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