Loogle!
Result
Found 174 declarations mentioning Finset.Ioo.
- Finset.Ioo 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset α - Finset.coe_Ioo 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : ↑(Finset.Ioo a b) = Set.Ioo a b - Set.toFinset_Ioo 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_3} [Preorder α] [LocallyFiniteOrder α] (a b : α) [Fintype ↑(Set.Ioo a b)] : (Set.Ioo a b).toFinset = Finset.Ioo a b - Fintype.card_Ioo 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) [Fintype ↑(Set.Ioo a b)] : Fintype.card ↑(Set.Ioo a b) = (Finset.Ioo a b).card - Finset.mem_Ioo 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] {a b x : α} : x ∈ Finset.Ioo a b ↔ a < x ∧ x < b - Finset.mem_Ioo' 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] {a b x : α} : x ∈ Finset.Ioo a b ↔ x < b ∧ a < x - Finset.subtype_Ioo_eq 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] (p : α → Prop) [DecidablePred p] [LocallyFiniteOrder α] (a b : Subtype p) : Finset.Ioo a b = Finset.subtype p (Finset.Ioo ↑a ↑b) - WithBot.Ioo_coe_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] (a b : α) : Finset.Ioo ↑b ↑a = Finset.map Function.Embedding.some (Finset.Ioo b a) - WithTop.Ioo_coe_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderTop α] [LocallyFiniteOrder α] (a b : α) : Finset.Ioo ↑a ↑b = Finset.map Function.Embedding.some (Finset.Ioo a b) - WithBot.Ioo_bot_coe 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] (a : α) : Finset.Ioo ⊥ ↑a = Finset.map Function.Embedding.some (Finset.Iio a) - WithTop.Ioo_coe_top 📋 Mathlib.Order.Interval.Finset.Defs
(α : Type u_1) [PartialOrder α] [OrderTop α] [LocallyFiniteOrder α] (a : α) : Finset.Ioo ↑a ⊤ = Finset.map Function.Embedding.some (Finset.Ioi a) - Finset.map_subtype_embedding_Ioo 📋 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.Ioo a b) = Finset.Ioo ↑a ↑b - Finset.Ioo_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : α) : Finset.Ioo (OrderDual.toDual a) (OrderDual.toDual b) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioo b a) - Finset.Ioo_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ioo (OrderDual.ofDual a) (OrderDual.ofDual b) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ioo b a) - Finset.Ioo_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] (a b : αᵒᵈ) : Finset.Ioo a b = Finset.map OrderDual.toDual.toEmbedding (Finset.Ioo (OrderDual.ofDual b) (OrderDual.ofDual a)) - Finset.Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} (a : α) [Preorder α] [LocallyFiniteOrder α] : Finset.Ioo a a = ∅ - Finset.left_notMem_Ioo 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : a ∉ Finset.Ioo a b - Finset.right_notMem_Ioo 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : b ∉ Finset.Ioo a b - Finset.Ioo_eq_empty_of_le 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] (h : b ≤ a) : Finset.Ioo a b = ∅ - Finset.nonempty_Ioo 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] [DenselyOrdered α] : (Finset.Ioo a b).Nonempty ↔ a < b - Finset.Ioo_eq_empty 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] (h : ¬a < b) : Finset.Ioo 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.Ioo_subset_Ico_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Ico 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.Ioo_subset_Ici_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderTop α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Ici a - Finset.Ioo_subset_Iic_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Iic b - Finset.Ioo_subset_Iio_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Iio b - Finset.Ioo_subset_Ioi_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderTop α] [LocallyFiniteOrder α] : Finset.Ioo a b ⊆ Finset.Ioi a - Finset.Ico_erase_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] [DecidableEq α] (a b : α) : (Finset.Ico a b).erase a = Finset.Ioo 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.Ioo_eq_empty_iff 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrder α] [DenselyOrdered α] : Finset.Ioo a b = ∅ ↔ ¬a < b - Finset.Ico_subset_Ioo_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b : α} [Preorder α] [LocallyFiniteOrder α] (h : a₁ < a₂) : Finset.Ico a₂ b ⊆ Finset.Ioo 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.Ioo_subset_Ioo_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b : α} [Preorder α] [LocallyFiniteOrder α] (h : a₁ ≤ a₂) : Finset.Ioo a₂ b ⊆ Finset.Ioo a₁ b - Finset.Ioo_subset_Ioo_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (h : b₁ ≤ b₂) : Finset.Ioo a b₁ ⊆ Finset.Ioo a b₂ - 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.card_Ioo_eq_card_Ico_sub_one 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] (a b : α) : (Finset.Ioo a b).card = (Finset.Ico 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.Ioo_subset_Ioo 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a₁ a₂ b₁ b₂ : α} [Preorder α] [LocallyFiniteOrder α] (ha : a₂ ≤ a₁) (hb : b₁ ≤ b₂) : Finset.Ioo a₁ b₁ ⊆ Finset.Ioo a₂ b₂ - Finset.Ioo_insert_left 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a < b) : insert a (Finset.Ioo a b) = Finset.Ico 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.Ico_eq_cons_Ioo 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} (h : a < b) : Finset.Ico a b = Finset.cons a (Finset.Ioo 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.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_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.Ico_diff_Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a < b) : Finset.Ico a b \ Finset.Ioo a b = {a} - Finset.Ico_sdiff_Ioo_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrder α] {a b : α} [DecidableEq α] (h : a < b) : Finset.Ico a b \ Finset.Ioo 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_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_lt_lt_eq_Ioo 📋 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.Ioo 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.Ioo_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.Ioo a b) = Finset.Ioo (a, c) (b, c) - Finset.Ioo_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.Ioo a b) = Finset.Ioo (c, a) (c, b) - Finset.Ioo_filter_lt 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [LocallyFiniteOrder α] (a b c : α) : {x ∈ Finset.Ioo a b | x < c} = Finset.Ioo a (min b c) - Nat.card_Ioo 📋 Mathlib.Order.Interval.Finset.Nat
(a b : ℕ) : (Finset.Ioo a b).card = b - a - 1 - Nat.Ioo_eq_range' 📋 Mathlib.Order.Interval.Finset.Nat
(a b : ℕ) : Finset.Ioo a b = { val := ↑(List.range' (a + 1) (b - a - 1)), nodup := ⋯ } - Fin.map_valEmbedding_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a : Fin n) : Finset.map Fin.valEmbedding (Finset.Ioi a) = Finset.Ioo (↑a) n - Fin.finsetImage_val_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a : Fin n) : Finset.image Fin.val (Finset.Ioi a) = Finset.Ioo (↑a) n - Fin.map_valEmbedding_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : Finset.map Fin.valEmbedding (Finset.Ioo a b) = Finset.Ioo ↑a ↑b - Fin.finsetImage_val_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : Finset.image Fin.val (Finset.Ioo a b) = Finset.Ioo ↑a ↑b - Fin.finsetImage_rev_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.rev (Finset.Ioo i j) = Finset.Ioo j.rev i.rev - Fin.card_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.Ioo a b).card = ↑b - ↑a - 1 - Fin.map_revPerm_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ioo i j) = Finset.Ioo j.rev i.rev - Fin.map_castLEEmb_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a b : Fin n) (h : n ≤ m) : Finset.map (Fin.castLEEmb h) (Finset.Ioo a b) = Finset.Ioo (Fin.castLE h a) (Fin.castLE h b) - Fin.finsetImage_cast_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.image (Fin.cast h) (Finset.Ioo i j) = Finset.Ioo (Fin.cast h i) (Fin.cast h j) - Fin.finsetImage_castLE_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a b : Fin n) (h : n ≤ m) : Finset.image (Fin.castLE h) (Finset.Ioo a b) = Finset.Ioo (Fin.castLE h a) (Fin.castLE h b) - Fin.map_finCongr_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i j : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Ioo i j) = Finset.Ioo (Fin.cast h i) (Fin.cast h j) - 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.Ioo_sub_one_eq_Ico 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (ha : 0 < a) : Finset.Ioo (a - 1) b = Finset.Ico a b - Fin.Ico_add_one_eq_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {a b : Fin n} (ha : ↑a + 1 < n) : Finset.Ico (a + 1) b = Finset.Ioo 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_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.addNatEmb m) (Finset.Ioo i j) = Finset.Ioo (i.addNat m) (j.addNat m) - Fin.map_castAddEmb_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.castAddEmb m) (Finset.Ioo i j) = Finset.Ioo (Fin.castAdd m i) (Fin.castAdd m j) - Fin.map_natAddEmb_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.map (Fin.natAddEmb m) (Finset.Ioo i j) = Finset.Ioo (Fin.natAdd m i) (Fin.natAdd m j) - Fin.finsetImage_castAdd_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (Fin.castAdd m) (Finset.Ioo i j) = Finset.Ioo (Fin.castAdd m i) (Fin.castAdd m j) - Fin.finsetImage_natAdd_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (Fin.natAdd m) (Finset.Ioo i j) = Finset.Ioo (Fin.natAdd m i) (Fin.natAdd m j) - Fin.map_castAddEmb_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) [NeZero m] (i : Fin n) : Finset.map (Fin.castAddEmb m) (Finset.Ioi i) = Finset.Ioo (Fin.castAdd m i) (Fin.natAdd n 0) - Fin.finsetImage_addNat_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i j : Fin n) : Finset.image (fun x => x.addNat m) (Finset.Ioo i j) = Finset.Ioo (i.addNat m) (j.addNat m) - Fin.attachFin_Ioo_eq_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a : Fin n) : (Finset.Ioo (↑a) n).attachFin ⋯ = Finset.Ioi a - Fin.map_castSuccEmb_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map Fin.castSuccEmb (Finset.Ioi i) = Finset.Ioo i.castSucc (Fin.last n) - Fin.map_castSuccEmb_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map Fin.castSuccEmb (Finset.Ioo i j) = Finset.Ioo i.castSucc j.castSucc - Fin.map_succEmb_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.map (Fin.succEmb n) (Finset.Ioo i j) = Finset.Ioo i.succ j.succ - Fin.finsetImage_castAdd_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) [NeZero m] (i : Fin n) : Finset.image (Fin.castAdd m) (Finset.Ioi i) = Finset.Ioo (Fin.castAdd m i) (Fin.natAdd n 0) - Fin.finsetImage_castSucc_Ioi 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.image Fin.castSucc (Finset.Ioi i) = Finset.Ioo i.castSucc (Fin.last n) - Fin.finsetImage_castSucc_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.castSucc (Finset.Ioo i j) = Finset.Ioo i.castSucc j.castSucc - Fin.finsetImage_succ_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i j : Fin n) : Finset.image Fin.succ (Finset.Ioo i j) = Finset.Ioo i.succ j.succ - Fin.attachFin_Ioo 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a b : Fin n) : (Finset.Ioo ↑a ↑b).attachFin ⋯ = Finset.Ioo a b - Fin.map_succEmb_Iio 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Fin.succEmb n) (Finset.Iio i) = Finset.Ioo 0 i.succ - Fin.finsetImage_succ_Iio 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.image Fin.succ (Finset.Iio i) = Finset.Ioo 0 i.succ - Fin.prod_Ioo_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.Ioo (Fin.cast h a) (Fin.cast h b), f i = ∏ i ∈ Finset.Ioo a b, f (Fin.cast h i) - Fin.sum_Ioo_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.Ioo (Fin.cast h a) (Fin.cast h b), f i = ∑ i ∈ Finset.Ioo a b, f (Fin.cast h i) - Fin.prod_Ioo_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.Ioo (Fin.castLE h a) (Fin.castLE h b), f i = ∏ i ∈ Finset.Ioo a b, f (Fin.castLE h i) - Fin.sum_Ioo_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.Ioo (Fin.castLE h a) (Fin.castLE h b), f i = ∑ i ∈ Finset.Ioo a b, f (Fin.castLE h i) - Fin.prod_Ioo_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a b : Fin n) : ∏ i ∈ Finset.Ioo (Fin.castAdd m a) (Fin.castAdd m b), f i = ∏ i ∈ Finset.Ioo a b, f (Fin.castAdd m i) - Fin.sum_Ioo_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a b : Fin n) : ∑ i ∈ Finset.Ioo (Fin.castAdd m a) (Fin.castAdd m b), f i = ∑ i ∈ Finset.Ioo a b, f (Fin.castAdd m i) - Fin.prod_Ioo_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∏ i ∈ Finset.Ioo a.castSucc b.castSucc, f i = ∏ i ∈ Finset.Ioo a b, f i.castSucc - Fin.prod_Ioo_succ 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∏ i ∈ Finset.Ioo a.succ b.succ, f i = ∏ i ∈ Finset.Ioo a b, f i.succ - Fin.sum_Ioo_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∑ i ∈ Finset.Ioo a.castSucc b.castSucc, f i = ∑ i ∈ Finset.Ioo a b, f i.castSucc - Fin.sum_Ioo_succ 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a b : Fin n) : ∑ i ∈ Finset.Ioo a.succ b.succ, f i = ∑ i ∈ Finset.Ioo a b, f i.succ - Finset.Ico_succ_left_eq_Ioo 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [SuccOrder α] (a b : α) : Finset.Ico (Order.succ a) b = Finset.Ioo a b - 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.Ioo_pred_left_eq_Ioc 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] [NoMinOrder α] (a b : α) : Finset.Ioo (Order.pred a) b = Finset.Ico 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.Ioo_pred_left_eq_Ioc_of_not_isMin 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrder α] [PredOrder α] {a : α} (ha : ¬IsMin a) (b : α) : Finset.Ioo (Order.pred a) b = Finset.Ico 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.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.Ico_add_one_left_eq_Ioo 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Add α] [SuccAddOrder α] (a b : α) : Finset.Ico (a + 1) b = Finset.Ioo a 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.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.Ioo_sub_one_left_eq_Ioc 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] [NoMinOrder α] (a b : α) : Finset.Ioo (a - 1) b = Finset.Ico 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.Ioo_sub_one_left_eq_Ioc_of_not_isMin 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrder α] [Sub α] [PredSubOrder α] {a : α} (ha : ¬IsMin a) (b : α) : Finset.Ioo (a - 1) b = Finset.Ico 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.add_sum_Ioo_eq_sum_Ico 📋 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.Ioo a b, f x = ∑ x ∈ Finset.Ico 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_Ioo_eq_prod_Ico 📋 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.Ioo a b, f x = ∏ x ∈ Finset.Ico 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_Ioo_mul_eq_prod_Ico 📋 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 a = ∏ x ∈ Finset.Ico 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_Ioo_add_eq_sum_Ico 📋 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 a = ∑ x ∈ Finset.Ico 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_Ioo 📋 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.Ioo a b) = Finset.Ioo (c + a) (c + b) - Finset.image_add_right_Ioo 📋 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.Ioo a b) = Finset.Ioo (a + c) (b + c) - Finset.map_add_left_Ioo 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (a b c : α) : Finset.map (addLeftEmbedding c) (Finset.Ioo a b) = Finset.Ioo (c + a) (c + b) - Finset.map_add_right_Ioo 📋 Mathlib.Algebra.Order.Interval.Finset.Basic
{α : Type u_1} [AddCommMonoid α] [PartialOrder α] [IsOrderedCancelAddMonoid α] [ExistsAddOfLE α] [LocallyFiniteOrder α] (a b c : α) : Finset.map (addRightEmbedding c) (Finset.Ioo a b) = Finset.Ioo (a + c) (b + c) - Commute.add_pow_prime_eq' 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {p : ℕ} (hp : Nat.Prime p) {x y : R} (h : Commute x y) : (x + y) ^ p = x ^ p + y ^ p + ↑p * ∑ k ∈ Finset.Ioo 0 p, x ^ k * y ^ (p - k) * ↑(p.choose k / p) - add_pow_prime_eq' 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] {p : ℕ} (hp : Nat.Prime p) (x y : R) : (x + y) ^ p = x ^ p + y ^ p + ↑p * ∑ k ∈ Finset.Ioo 0 p, x ^ k * y ^ (p - k) * ↑(p.choose k / p) - Commute.add_pow_prime_eq 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {p : ℕ} (hp : Nat.Prime p) {x y : R} (h : Commute x y) : (x + y) ^ p = x ^ p + y ^ p + ↑p * x * y * ∑ k ∈ Finset.Ioo 0 p, x ^ (k - 1) * y ^ (p - k - 1) * ↑(p.choose k / p) - add_pow_prime_eq 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] {p : ℕ} (hp : Nat.Prime p) (x y : R) : (x + y) ^ p = x ^ p + y ^ p + ↑p * x * y * ∑ k ∈ Finset.Ioo 0 p, x ^ (k - 1) * y ^ (p - k - 1) * ↑(p.choose k / p) - Commute.add_pow_prime_pow_eq' 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {p : ℕ} (hp : Nat.Prime p) {x y : R} (h : Commute x y) (n : ℕ) : (x + y) ^ p ^ n = x ^ p ^ n + y ^ p ^ n + ↑p * ∑ k ∈ Finset.Ioo 0 (p ^ n), x ^ k * y ^ (p ^ n - k) * ↑((p ^ n).choose k / p) - add_pow_prime_pow_eq' 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] {p : ℕ} (hp : Nat.Prime p) (x y : R) (n : ℕ) : (x + y) ^ p ^ n = x ^ p ^ n + y ^ p ^ n + ↑p * ∑ k ∈ Finset.Ioo 0 (p ^ n), x ^ k * y ^ (p ^ n - k) * ↑((p ^ n).choose k / p) - Commute.add_pow_prime_pow_eq 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [Semiring R] {p : ℕ} (hp : Nat.Prime p) {x y : R} (h : Commute x y) (n : ℕ) : (x + y) ^ p ^ n = x ^ p ^ n + y ^ p ^ n + ↑p * x * y * ∑ k ∈ Finset.Ioo 0 (p ^ n), x ^ (k - 1) * y ^ (p ^ n - k - 1) * ↑((p ^ n).choose k / p) - add_pow_prime_pow_eq 📋 Mathlib.Algebra.CharP.Lemmas
{R : Type u_1} [CommSemiring R] {p : ℕ} (hp : Nat.Prime p) (x y : R) (n : ℕ) : (x + y) ^ p ^ n = x ^ p ^ n + y ^ p ^ n + ↑p * x * y * ∑ k ∈ Finset.Ioo 0 (p ^ n), x ^ (k - 1) * y ^ (p ^ n - k - 1) * ↑((p ^ n).choose k / p) - Int.card_Ioo 📋 Mathlib.Data.Int.Interval
(a b : ℤ) : (Finset.Ioo a b).card = (b - a - 1).toNat - Int.card_Ioo_of_lt 📋 Mathlib.Data.Int.Interval
(a b : ℤ) (h : a < b) : ↑(Finset.Ioo a b).card = b - a - 1 - Int.Ioo_eq_finset_map 📋 Mathlib.Data.Int.Interval
(a b : ℤ) : Finset.Ioo a b = Finset.map (Nat.castEmbedding.trans (addLeftEmbedding (a + 1))) (Finset.range (b - a - 1).toNat) - Finset.Ioo_succ_succ 📋 Mathlib.Data.Int.Interval
(m n : ℕ) : Finset.Ioo (-(↑m + 1)) (↑n + 1) = Finset.Ioo (-↑m) ↑n ∪ {-↑m, ↑n} - 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) - LieModule.genWeightSpaceChain_def' 📋 Mathlib.Algebra.Lie.Weights.Chain
{R : Type u_1} {L : Type u_2} [CommRing R] [LieRing L] [LieAlgebra R L] (M : Type u_3) [AddCommGroup M] [Module R M] [LieRingModule L M] [LieModule R L M] [LieRing.IsNilpotent L] (χ₁ χ₂ : L → R) (p q : ℤ) : LieModule.genWeightSpaceChain M χ₁ χ₂ p q = ⨆ k ∈ Finset.Ioo p q, LieModule.genWeightSpace M (k • χ₁ + χ₂) - sum_Ioo_inv_sq_le 📋 Mathlib.Analysis.PSeries
{α : Type u_1} [Field α] [LinearOrder α] [IsStrictOrderedRing α] (k n : ℕ) : ∑ i ∈ Finset.Ioo k n, (↑i ^ 2)⁻¹ ≤ 2 / (↑k + 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.Ioo_eq_filter_ssubsets 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] (s t : Finset α) : Finset.Ioo s t = {u ∈ t.ssubsets | s ⊂ u} - Finset.card_Ioo_finset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] {s t : Finset α} (h : s ⊆ t) : (Finset.Ioo s t).card = 2 ^ (t.card - s.card) - 2 - Polynomial.Chebyshev.isLocalExtr_T_real_iff 📋 Mathlib.Analysis.SpecialFunctions.Trigonometric.Chebyshev.RootsExtrema
{n : ℕ} (hn : 2 ≤ n) (x : ℝ) : IsLocalExtr (fun x => Polynomial.eval x (Polynomial.Chebyshev.T ℝ ↑n)) x ↔ ∃ k ∈ Finset.Ioo 0 n, x = Real.cos (↑k * Real.pi / ↑n) - Nat.smallSchroder_succ 📋 Mathlib.Combinatorics.Enumerative.Schroder
{n : ℕ} (hn : 1 < n) : (n + 1).smallSchroder = 3 * n.smallSchroder + 2 * ∑ i ∈ Finset.Ioo 0 (n - 1), (i + 1).smallSchroder * (n - i).smallSchroder - DFinsupp.card_Ioo 📋 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.Ioo f g).card = ∏ i ∈ f.support ∪ g.support, (Finset.Icc (f i) (g i)).card - 2 - Multiset.card_Ioo 📋 Mathlib.Data.Multiset.Interval
{α : Type u_1} [DecidableEq α] (s t : Multiset α) : (Finset.Ioo s t).card = ∏ i ∈ s.toFinset ∪ t.toFinset, (Multiset.count i t + 1 - Multiset.count i s) - 2 - PNat.card_Ioo 📋 Mathlib.Data.PNat.Interval
(a b : ℕ+) : (Finset.Ioo a b).card = ↑b - ↑a - 1 - PNat.Ioo_eq_finset_subtype 📋 Mathlib.Data.PNat.Interval
(a b : ℕ+) : Finset.Ioo a b = Finset.subtype (fun n => 0 < n) (Finset.Ioo ↑a ↑b) - PNat.map_subtype_embedding_Ioo 📋 Mathlib.Data.PNat.Interval
(a b : ℕ+) : Finset.map (Function.Embedding.subtype fun n => 0 < n) (Finset.Ioo a b) = Finset.Ioo ↑a ↑b - Pi.card_Ioo 📋 Mathlib.Data.Pi.Interval
{ι : Type u_1} {α : ι → Type u_2} [Fintype ι] [DecidableEq ι] [(i : ι) → DecidableEq (α i)] [(i : ι) → PartialOrder (α i)] [(i : ι) → LocallyFiniteOrder (α i)] (a b : (i : ι) → α i) : (Finset.Ioo a b).card = ∏ i, (Finset.Icc (a i) (b i)).card - 2 - Sigma.Ioo_mk_mk 📋 Mathlib.Data.Sigma.Interval
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → Preorder (α i)] [(i : ι) → LocallyFiniteOrder (α i)] (i : ι) (a b : α i) : Finset.Ioo ⟨i, a⟩ ⟨i, b⟩ = Finset.map (Function.Embedding.sigmaMk i) (Finset.Ioo a b) - Sigma.card_Ioo 📋 Mathlib.Data.Sigma.Interval
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → Preorder (α i)] [(i : ι) → LocallyFiniteOrder (α i)] (a b : (i : ι) × α i) : (Finset.Ioo a b).card = if h : a.fst = b.fst then (Finset.Ioo (h ▸ a.snd) b.snd).card else 0 - Sum.Ioo_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] (a₁ : α) (b₂ : β) : Finset.Ioo (Sum.inl a₁) (Sum.inr b₂) = ∅ - Sum.Ioo_inr_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] (a₂ : α) (b₁ : β) : Finset.Ioo (Sum.inr b₁) (Sum.inl a₂) = ∅ - Sum.Ioo_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] (a₁ a₂ : α) : Finset.Ioo (Sum.inl a₁) (Sum.inl a₂) = Finset.map Function.Embedding.inl (Finset.Ioo a₁ a₂) - Sum.Ioo_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] (b₁ b₂ : β) : Finset.Ioo (Sum.inr b₁) (Sum.inr b₂) = Finset.map Function.Embedding.inr (Finset.Ioo b₁ b₂) - Sum.Lex.Ioo_inr_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioo (Sum.inrₗ b) (Sum.inlₗ a) = ∅ - Sum.Lex.Ioo_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioo (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum (Finset.Iio b)) - Sum.Lex.Ioo_inl_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a₁ a₂ : α) : Finset.Ioo (Sum.inlₗ a₁) (Sum.inlₗ a₂) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Ioo a₁ a₂) - Sum.Lex.Ioo_inr_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (b₁ b₂ : β) : Finset.Ioo (Sum.inrₗ b₁) (Sum.inrₗ b₂) = Finset.map (Function.Embedding.inr.trans toLex.toEmbedding) (Finset.Ioo b₁ b₂) - Nat.primesBelow_eq_filter_Ioo_one 📋 Mathlib.NumberTheory.PrimeCounting
(n : ℕ) : n.primesBelow = Finset.filter Nat.Prime (Finset.Ioo 1 n) - Nat.primesBelow_eq_filter_Ioo_zero 📋 Mathlib.NumberTheory.PrimeCounting
(n : ℕ) : n.primesBelow = Finset.filter Nat.Prime (Finset.Ioo 0 n) - Finset.tendsto_Ioo_atBot_prod_atTop 📋 Mathlib.Order.Filter.AtTopBot.Interval
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] [NoBotOrder α] [NoTopOrder α] : Filter.Tendsto (fun p => Finset.Ioo p.1 p.2) (Filter.atBot ×ˢ Filter.atTop) Filter.atTop - Finset.tendsto_Ioo_neg_atTop_atTop 📋 Mathlib.Order.Filter.AtTopBot.Interval
{α : Type u_1} [AddCommGroup α] [PartialOrder α] [IsOrderedAddMonoid α] [LocallyFiniteOrder α] [NoBotOrder α] [NoTopOrder α] : Filter.Tendsto (fun a => Finset.Ioo (-a) a) Filter.atTop Filter.atTop - Finset.tendsto_Ioo_neg 📋 Mathlib.Order.Filter.AtTopBot.Interval
{R : Type u_1} [Ring R] [PartialOrder R] [IsOrderedRing R] [LocallyFiniteOrder R] [Archimedean R] [Nontrivial R] : Filter.Tendsto (fun n => Finset.Ioo (-↑n) ↑n) Filter.atTop Filter.atTop - SummationFilter.symmetricIoo_filter 📋 Mathlib.Topology.Algebra.InfiniteSum.ConditionalInt
(G : Type u_1) [Neg G] [Preorder G] [LocallyFiniteOrder G] : (SummationFilter.symmetricIoo G).filter = Filter.map (fun g => Finset.Ioo (-g) g) Filter.atTop - Int.cast_mem_Ioo_iff 📋 Mathlib.Order.Interval.Finset.Floor
{α : Type u_1} [Ring α] [LinearOrder α] [FloorRing α] {a b : α} {n : ℤ} : ↑n ∈ Set.Ioo a b ↔ n ∈ Finset.Ioo ⌊a⌋ ⌈b⌉ - Nat.cast_mem_Ioo_iff 📋 Mathlib.Order.Interval.Finset.Floor
{α : Type u_1} [Semiring α] [LinearOrder α] [FloorSemiring α] {a b : α} {n : ℕ} (ha : 0 ≤ a) : ↑n ∈ Set.Ioo a b ↔ n ∈ Finset.Ioo ⌊a⌋₊ ⌈b⌉₊
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