Loogle!
Result
Found 268 declarations mentioning Finset.Iic. Of these, only the first 200 are shown.
- Finset.Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : Finset α - Finset.coe_Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : ↑(Finset.Iic a) = Set.Iic a - Set.toFinset_Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_3} [Preorder α] [LocallyFiniteOrderBot α] (a : α) [Fintype ↑(Set.Iic a)] : (Set.Iic a).toFinset = Finset.Iic a - Fintype.card_Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) [Fintype ↑(Set.Iic a)] : Fintype.card ↑(Set.Iic a) = (Finset.Iic a).card - Finset.mem_Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] {a x : α} : x ∈ Finset.Iic a ↔ x ≤ a - Finset.Iic_eq_Icc 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrder α] [OrderBot α] (a : α) : Finset.Iic a = Finset.Icc ⊥ a - Finset.subtype_Iic_eq 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] (p : α → Prop) [DecidablePred p] [LocallyFiniteOrderBot α] (a : Subtype p) : Finset.Iic a = Finset.subtype p (Finset.Iic ↑a) - Finset.Ici_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : Finset.Ici (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Iic a) - Finset.Iic_toDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : α) : Finset.Iic (OrderDual.toDual a) = Finset.map OrderDual.toDual.toEmbedding (Finset.Ici a) - 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.Ici_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : αᵒᵈ) : Finset.Ici (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Iic a) - Finset.Iic_ofDual 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : αᵒᵈ) : Finset.Iic (OrderDual.ofDual a) = Finset.map OrderDual.ofDual.toEmbedding (Finset.Ici a) - Finset.map_subtype_embedding_Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] (p : α → Prop) [DecidablePred p] [LocallyFiniteOrderBot α] (a : Subtype p) (hp : ∀ ⦃a x : α⦄, x ≤ a → p a → p x) : Finset.map (Function.Embedding.subtype p) (Finset.Iic a) = Finset.Iic ↑a - Ici_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : αᵒᵈ) : Finset.Ici a = Finset.map OrderDual.toDual.toEmbedding (Finset.Iic (OrderDual.ofDual a)) - Iic_orderDual_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} [Preorder α] [LocallyFiniteOrderTop α] (a : αᵒᵈ) : Finset.Iic a = Finset.map OrderDual.toDual.toEmbedding (Finset.Ici (OrderDual.ofDual a)) - Finset.Iic_product_Iic 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] [DecidableLE (α × β)] (a : α) (b : β) : Finset.Iic a ×ˢ Finset.Iic b = Finset.Iic (a, b) - Finset.Iic_prod_def 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] [DecidableLE (α × β)] (x : α × β) : Finset.Iic x = Finset.Iic x.1 ×ˢ Finset.Iic x.2 - Finset.card_Iic_prod 📋 Mathlib.Order.Interval.Finset.Defs
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] [DecidableLE (α × β)] (x : α × β) : (Finset.Iic x).card = (Finset.Iic x.1).card * (Finset.Iic x.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) - Finset.nonempty_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a : α} [Preorder α] [LocallyFiniteOrderBot α] : (Finset.Iic a).Nonempty - Finset.Iio_subset_Iic_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Preorder α] [LocallyFiniteOrderBot α] {a : α} : Finset.Iio a ⊆ Finset.Iic a - Finset.Iic_top 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Preorder α] [LocallyFiniteOrderBot α] [OrderTop α] [Fintype α] : Finset.Iic ⊤ = Finset.univ - Finset.Iic_erase 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrderBot α] [DecidableEq α] (b : α) : (Finset.Iic b).erase b = Finset.Iio b - Equiv.IicFinsetSet 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : ↥(Finset.Iic a) ≃ ↑(Set.Iic 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.Ico_subset_Iic_self 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] [LocallyFiniteOrder α] : Finset.Ico a b ⊆ Finset.Iic b - 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.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.Iic_eq_cons_Iio 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrderBot α] (b : α) : Finset.Iic b = Finset.cons b (Finset.Iio b) ⋯ - Finset.Iio_insert 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrderBot α] [DecidableEq α] (b : α) : insert b (Finset.Iio b) = Finset.Iic b - Finset.Icc_bot 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a : α} [Preorder α] [LocallyFiniteOrder α] [OrderBot α] : Finset.Icc ⊥ a = Finset.Iic a - 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.Iic_ssubset_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] : Finset.Iic a ⊂ Finset.Iic b ↔ a < b - Finset.Iic_subset_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a b : α} [Preorder α] [LocallyFiniteOrderBot α] : Finset.Iic a ⊆ Finset.Iic b ↔ a ≤ b - Finset.sup'_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [SemilatticeSup α] [LocallyFiniteOrderBot α] (a : α) : (Finset.Iic a).sup' ⋯ id = a - Finset.sup_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [SemilatticeSup α] [LocallyFiniteOrderBot α] [OrderBot α] (a : α) : (Finset.Iic a).sup id = a - Finset.card_Iio_eq_card_Iic_sub_one 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrderBot α] (a : α) : (Finset.Iio a).card = (Finset.Iic a).card - 1 - Finset.filter_ge_eq_Iic 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [Preorder α] [LocallyFiniteOrderBot α] {a : α} [Fintype α] [DecidablePred fun x => x ≤ a] : {x | x ≤ a} = Finset.Iic a - Finset.instUniqueSubtypeMemIicBot 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrderBot α] [OrderBot α] : Unique ↥(Finset.Iic ⊥) - Finset.sup_Iic_of_monotone 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} {a : α} [Preorder α] [LocallyFiniteOrderBot α] {β : Type u_3} [SemilatticeSup β] [OrderBot β] {f : α → β} (hf : Monotone f) : (Finset.Iic a).sup f = f a - Finset.Iic_filter_lt_of_lt_right 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_3} [Preorder α] [LocallyFiniteOrderBot α] {a c : α} [DecidablePred fun x => x < c] (h : a < c) : {x ∈ Finset.Iic a | x < c} = Finset.Iic a - Finset.subset_Iic_sup_id 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [SemilatticeSup α] [LocallyFiniteOrderBot α] [OrderBot α] (s : Finset α) : s ⊆ Finset.Iic (s.sup id) - Finset.Iic_bot 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [PartialOrder α] [LocallyFiniteOrderBot α] [OrderBot α] : Finset.Iic ⊥ = {⊥} - Finset.image_subset_Iic_sup 📋 Mathlib.Order.Interval.Finset.Basic
{ι : Type u_1} {α : Type u_2} [SemilatticeSup α] [LocallyFiniteOrderBot α] [OrderBot α] [DecidableEq α] (f : ι → α) (s : Finset ι) : Finset.image f s ⊆ Finset.Iic (s.sup f) - 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.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 - Nat.card_Iic 📋 Mathlib.Order.Interval.Finset.Nat
(b : ℕ) : (Finset.Iic b).card = b + 1 - Nat.range_succ_eq_Iic 📋 Mathlib.Order.Interval.Finset.Nat
(n : ℕ) : Finset.range (n + 1) = Finset.Iic n - Nat.instUniqueSubtypeMemFinsetIicOfNat 📋 Mathlib.Order.Interval.Finset.Nat
: Unique ↥(Finset.Iic 0) - Fin.card_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (b : Fin n) : (Finset.Iic b).card = ↑b + 1 - Fin.map_valEmbedding_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a : Fin n) : Finset.map Fin.valEmbedding (Finset.Iic a) = Finset.Iic ↑a - Fin.finsetImage_val_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a : Fin n) : Finset.image Fin.val (Finset.Iic a) = Finset.Iic ↑a - Fin.finsetImage_rev_Ici 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.image Fin.rev (Finset.Ici i) = Finset.Iic i.rev - Fin.finsetImage_rev_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.image Fin.rev (Finset.Iic i) = Finset.Ici i.rev - Fin.map_revPerm_Ici 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Ici i) = Finset.Iic i.rev - Fin.map_revPerm_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map (Equiv.toEmbedding Fin.revPerm) (Finset.Iic i) = Finset.Ici i.rev - Fin.map_castLEEmb_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a : Fin n) (h : n ≤ m) : Finset.map (Fin.castLEEmb h) (Finset.Iic a) = Finset.Iic (Fin.castLE h a) - Fin.finsetImage_cast_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i : Fin n) : Finset.image (Fin.cast h) (Finset.Iic i) = Finset.Iic (Fin.cast h i) - Fin.finsetImage_castLE_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (a : Fin n) (h : n ≤ m) : Finset.image (Fin.castLE h) (Finset.Iic a) = Finset.Iic (Fin.castLE h a) - Fin.map_finCongr_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n m : ℕ} (h : n = m) (i : Fin n) : Finset.map (finCongr h).toEmbedding (Finset.Iic i) = Finset.Iic (Fin.cast h i) - Fin.Iic_sub_one_eq_Iio 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {b : Fin n} (hb : 0 < b) : Finset.Iic (b - 1) = Finset.Iio b - Fin.Iio_add_one_eq_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} {b : Fin n} (hb : ↑b + 1 < n) : Finset.Iio (b + 1) = Finset.Iic b - Fin.map_castAddEmb_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i : Fin n) : Finset.map (Fin.castAddEmb m) (Finset.Iic i) = Finset.Iic (Fin.castAdd m i) - Fin.finsetImage_castAdd_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (m : ℕ) (i : Fin n) : Finset.image (Fin.castAdd m) (Finset.Iic i) = Finset.Iic (Fin.castAdd m i) - Fin.attachFin_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (a : Fin n) : (Finset.Iic ↑a).attachFin ⋯ = Finset.Iic a - Fin.map_castSuccEmb_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.map Fin.castSuccEmb (Finset.Iic i) = Finset.Iic i.castSucc - Fin.finsetImage_castSucc_Iic 📋 Mathlib.Order.Interval.Finset.Fin
{n : ℕ} (i : Fin n) : Finset.image Fin.castSucc (Finset.Iic i) = Finset.Iic i.castSucc - 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_Iic_cast 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n m : ℕ} (h : n = m) (f : Fin m → M) (a : Fin n) : ∏ i ≤ Fin.cast h a, f i = ∏ i ≤ a, f (Fin.cast h i) - Fin.sum_Iic_cast 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n m : ℕ} (h : n = m) (f : Fin m → M) (a : Fin n) : ∑ i ≤ Fin.cast h a, f i = ∑ i ≤ a, f (Fin.cast h i) - Fin.prod_Iic_castLE 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n m : ℕ} (h : n ≤ m) (f : Fin m → M) (a : Fin n) : ∏ i ≤ Fin.castLE h a, f i = ∏ i ≤ a, f (Fin.castLE h i) - Fin.sum_Iic_castLE 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n m : ℕ} (h : n ≤ m) (f : Fin m → M) (a : Fin n) : ∑ i ≤ Fin.castLE h a, f i = ∑ i ≤ a, f (Fin.castLE h i) - Fin.prod_Iic_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a : Fin n) : ∏ i ≤ Fin.castAdd m a, f i = ∏ i ≤ a, f (Fin.castAdd m i) - Fin.sum_Iic_castAdd 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (m : ℕ) (f : Fin (n + m) → M) (a : Fin n) : ∑ i ≤ Fin.castAdd m a, f i = ∑ i ≤ a, f (Fin.castAdd m i) - Fin.prod_Iic_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a : Fin n) : ∏ i ≤ a.castSucc, f i = ∏ i ≤ a, f i.castSucc - Fin.sum_Iic_castSucc 📋 Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M) (a : Fin n) : ∑ i ≤ a.castSucc, f i = ∑ i ≤ a, f i.castSucc - Finset.Iic_pred_eq_Iio 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrderBot α] [PredOrder α] [NoMinOrder α] (b : α) : Finset.Iic (Order.pred b) = Finset.Iio b - Finset.Iio_succ_eq_Iic 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrderBot α] [SuccOrder α] [NoMaxOrder α] (b : α) : Finset.Iio (Order.succ b) = Finset.Iic b - Finset.Iic_pred_eq_Iio_of_not_isMin 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrderBot α] [PredOrder α] {b : α} (hb : ¬IsMin b) : Finset.Iic (Order.pred b) = Finset.Iio b - Finset.Iio_succ_eq_Iic_of_not_isMax 📋 Mathlib.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [LocallyFiniteOrderBot α] [SuccOrder α] {b : α} (hb : ¬IsMax b) : Finset.Iio (Order.succ b) = Finset.Iic b - Finset.Iic_sub_one_eq_Iio 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrderBot α] [Sub α] [PredSubOrder α] [NoMinOrder α] (b : α) : Finset.Iic (b - 1) = Finset.Iio b - Finset.Iio_add_one_eq_Iic 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrderBot α] [Add α] [SuccAddOrder α] [NoMaxOrder α] (b : α) : Finset.Iio (b + 1) = Finset.Iic b - Finset.Iic_sub_one_eq_Iio_of_not_isMin 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrderBot α] [Sub α] [PredSubOrder α] {b : α} (hb : ¬IsMin b) : Finset.Iic (b - 1) = Finset.Iio b - Finset.Iio_add_one_eq_Iic_of_not_isMax 📋 Mathlib.Algebra.Order.Interval.Finset.SuccPred
{α : Type u_1} [LinearOrder α] [One α] [LocallyFiniteOrderBot α] [Add α] [SuccAddOrder α] {b : α} (hb : ¬IsMax b) : Finset.Iio (b + 1) = Finset.Iic b - partialSups_apply 📋 Mathlib.Order.PartialSups
{α : Type u_1} {ι : Type u_3} [SemilatticeSup α] [Preorder ι] [LocallyFiniteOrderBot ι] (f : ι → α) (i : ι) : (partialSups f) i = (Finset.Iic i).sup' ⋯ f - biUnion_Iic_disjointed 📋 Mathlib.Order.Disjointed
{ι : Type u_2} [PartialOrder ι] [LocallyFiniteOrderBot ι] {α : Type u_3} (f : ι → Set α) (n : ι) : ⋃ i ∈ Finset.Iic n, disjointed f i = (partialSups f) n - Finset.disjiUnion_Iic_disjointed 📋 Mathlib.Order.Disjointed
{α : Type u_1} {ι : Type u_2} [LinearOrder ι] [LocallyFiniteOrderBot ι] [DecidableEq α] (n : ι) (t : ι → Finset α) : (Finset.Iic n).disjiUnion (disjointed t) ⋯ = (partialSups t) n - Finset.add_sum_Iio_eq_sum_Iic 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] {f : α → M} [PartialOrder α] [LocallyFiniteOrderBot α] (a : α) : f a + ∑ x < a, f x = ∑ x ≤ a, f x - Finset.mul_prod_Iio_eq_prod_Iic 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] {f : α → M} [PartialOrder α] [LocallyFiniteOrderBot α] (a : α) : f a * ∏ x < a, f x = ∏ x ≤ a, f x - Finset.prod_Iio_mul_eq_prod_Iic 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] {f : α → M} [PartialOrder α] [LocallyFiniteOrderBot α] (a : α) : (∏ x < a, f x) * f a = ∏ x ≤ a, f x - Finset.sum_Iio_add_eq_sum_Iic 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] {f : α → M} [PartialOrder α] [LocallyFiniteOrderBot α] (a : α) : ∑ x < a, f x + f a = ∑ x ≤ a, f x - Finset.prod_Iic_add_one 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] [LinearOrder α] [LocallyFiniteOrderBot α] [Add α] [One α] [SuccAddOrder α] [NoMaxOrder α] (a : α) (f : α → M) : ∏ i ≤ a + 1, f i = (∏ i ≤ a, f i) * f (a + 1) - Finset.prod_Iic_add_one_comm 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] [LinearOrder α] [LocallyFiniteOrderBot α] [Add α] [One α] [SuccAddOrder α] [NoMaxOrder α] (a : α) (f : α → M) : ∏ i ≤ a + 1, f i = f (a + 1) * ∏ i ≤ a, f i - Finset.sum_Iic_add_zero 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] [LinearOrder α] [LocallyFiniteOrderBot α] [Add α] [One α] [SuccAddOrder α] [NoMaxOrder α] (a : α) (f : α → M) : ∑ i ≤ a + 1, f i = ∑ i ≤ a, f i + f (a + 1) - Finset.sum_Iic_add_zero_comm 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] [LinearOrder α] [LocallyFiniteOrderBot α] [Add α] [One α] [SuccAddOrder α] [NoMaxOrder α] (a : α) (f : α → M) : ∑ i ≤ a + 1, f i = f (a + 1) + ∑ i ≤ a, f i - Fin.prod_Iic_div 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [CommGroup M] {n : ℕ} (a : Fin n) (f : Fin (n + 1) → M) : ∏ i ≤ a, f i.succ / f i.castSucc = f a.succ / f 0 - Fin.sum_Iic_sub 📋 Mathlib.Algebra.BigOperators.Intervals
{M : Type u_3} [AddCommGroup M] {n : ℕ} (a : Fin n) (f : Fin (n + 1) → M) : ∑ i ≤ a, (f i.succ - f i.castSucc) = f a.succ - f 0 - Finset.Iic_add_Iic_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [Preorder α] [DecidableEq α] [AddLeftMono α] [AddRightMono α] [LocallyFiniteOrderBot α] (a b : α) : Finset.Iic a + Finset.Iic b ⊆ Finset.Iic (a + b) - Finset.Iic_mul_Iic_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [Preorder α] [DecidableEq α] [MulLeftMono α] [MulRightMono α] [LocallyFiniteOrderBot α] (a b : α) : Finset.Iic a * Finset.Iic b ⊆ Finset.Iic (a * b) - Finset.Iic_add_Iio_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [PartialOrder α] [DecidableEq α] [AddLeftStrictMono α] [AddRightStrictMono α] [LocallyFiniteOrderBot α] (a b : α) : Finset.Iic a + Finset.Iio b ⊆ Finset.Iio (a + b) - Finset.Iic_mul_Iio_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [PartialOrder α] [DecidableEq α] [MulLeftStrictMono α] [MulRightStrictMono α] [LocallyFiniteOrderBot α] (a b : α) : Finset.Iic a * Finset.Iio b ⊆ Finset.Iio (a * b) - Finset.Iio_add_Iic_subset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Add α] [PartialOrder α] [DecidableEq α] [AddLeftStrictMono α] [AddRightStrictMono α] [LocallyFiniteOrderBot α] (a b : α) : Finset.Iio a + Finset.Iic b ⊆ Finset.Iio (a + b) - Finset.Iio_mul_Iic_subset' 📋 Mathlib.Algebra.Group.Pointwise.Finset.Interval
{α : Type u_1} [Mul α] [PartialOrder α] [DecidableEq α] [MulLeftStrictMono α] [MulRightStrictMono α] [LocallyFiniteOrderBot α] (a b : α) : Finset.Iio a * Finset.Iic b ⊆ Finset.Iio (a * b) - RootPairing.Base.exists_eq_sum_and_forall_sum_mem_of_isPos 📋 Mathlib.LinearAlgebra.RootSystem.Base
{ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {P : RootPairing ι R M N} {b : P.Base} [CharZero R] [Finite ι] [IsDomain R] [P.IsCrystallographic] {i : ι} (hi : b.IsPos i) : ∃ n f, Set.range f ⊆ ↑b.support ∧ P.root i = ∑ m, P.root (f m) ∧ ∀ (m : Fin n), ∑ m' ≤ m, P.root (f m') ∈ Set.range ⇑P.root - Filter.tendsto_finset_Iic_atTop_atTop 📋 Mathlib.Order.Filter.AtTopBot.Finset
{α : Type u_2} [Preorder α] [LocallyFiniteOrderBot α] : Filter.Tendsto Finset.Iic Filter.atTop Filter.atTop - SummationFilter.conditional_filter_eq_map_Iic 📋 Mathlib.Topology.Algebra.InfiniteSum.SummationFilter
{γ : Type u_4} [PartialOrder γ] [LocallyFiniteOrder γ] [OrderBot γ] : (SummationFilter.conditional γ).filter = Filter.map Finset.Iic Filter.atTop - WithSeminorms.partial_sups 📋 Mathlib.Analysis.LocallyConvex.WithSeminorms
{𝕜 : Type u_2} {E : Type u_6} {ι : Type u_9} [NormedField 𝕜] [AddCommGroup E] [Module 𝕜 E] [Preorder ι] [LocallyFiniteOrderBot ι] {p : SeminormFamily 𝕜 E ι} [TopologicalSpace E] (hp : WithSeminorms p) : WithSeminorms fun i => (Finset.Iic i).sup p - Finsupp.card_Iic 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [AddCommMonoid α] [PartialOrder α] [IsBotZeroClass α] [OrderBot α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f : ι →₀ α) : (Finset.Iic f).card = ∏ i ∈ f.support, (Finset.Iic (f i)).card - Finsupp.card_Iio 📋 Mathlib.Data.Finsupp.Interval
{ι : Type u_1} {α : Type u_2} [AddCommMonoid α] [PartialOrder α] [IsBotZeroClass α] [OrderBot α] [LocallyFiniteOrder α] [DecidableEq ι] [DecidableEq α] (f : ι →₀ α) : (Finset.Iio f).card = ∏ i ∈ f.support, (Finset.Iic (f i)).card - 1 - SchwartzMap.one_add_le_sup_seminorm_apply 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
{𝕜 : Type u_2} {E : Type u_5} {F : Type u_6} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [NormedField 𝕜] [NormedSpace 𝕜 F] [SMulCommClass ℝ 𝕜 F] {m : ℕ × ℕ} {k n : ℕ} (hk : k ≤ m.1) (hn : n ≤ m.2) (f : SchwartzMap E F) (x : E) : (1 + ‖x‖) ^ k * ‖iteratedFDeriv ℝ n (⇑f) x‖ ≤ 2 ^ m.1 * ((Finset.Iic m).sup fun m => SchwartzMap.seminorm 𝕜 m.1 m.2) f - SchwartzMap.eLpNorm_le_seminorm 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
(𝕜 : Type u_2) {E : Type u_5} (F : Type u_6) [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [MeasurableSpace E] [OpensMeasurableSpace E] [NormedField 𝕜] [NormedSpace 𝕜 F] [SMulCommClass ℝ 𝕜 F] (p : ENNReal) (μ : MeasureTheory.Measure E := by volume_tac) [hμ : μ.HasTemperateGrowth] : ∃ k C, ∀ (f : SchwartzMap E F), MeasureTheory.eLpNorm (⇑f) p μ ≤ ↑C * ENNReal.ofReal (((Finset.Iic (k, 0)).sup (schwartzSeminormFamily 𝕜 E F)) f) - SchwartzMap.norm_toLp_le_seminorm 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
(𝕜 : Type u_2) {E : Type u_5} (F : Type u_6) [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [MeasurableSpace E] [OpensMeasurableSpace E] [NormedField 𝕜] [NormedSpace 𝕜 F] [SMulCommClass ℝ 𝕜 F] [SecondCountableTopologyEither E F] (p : ENNReal) (μ : MeasureTheory.Measure E := by volume_tac) [hμ : μ.HasTemperateGrowth] : ∃ k C, 0 ≤ C ∧ ∀ (f : SchwartzMap E F), ‖f.toLp p μ‖ ≤ C * ((Finset.Iic (k, 0)).sup (schwartzSeminormFamily 𝕜 E F)) f - Finset.Iic_eq_powerset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] (s : Finset α) : Finset.Iic s = s.powerset - Finset.card_Iic_finset 📋 Mathlib.Data.Finset.Interval
{α : Type u_1} [DecidableEq α] {s : Finset α} : (Finset.Iic s).card = 2 ^ s.card - Polynomial.Chebyshev.eval_T_real_node 📋 Mathlib.Analysis.SpecialFunctions.Trigonometric.Chebyshev.Extremal
{n i : ℕ} (hi : i ∈ Finset.Iic n) : Polynomial.eval (Polynomial.Chebyshev.node n i) (Polynomial.Chebyshev.T ℝ ↑n) = (-1) ^ i - sum_Iic_pow_mul_exp_neg_le 📋 Mathlib.Analysis.SumIntegralExpDecay
{k M : ℕ} {c : ℝ} (hc : 0 < c) : ∑ i ≤ M, ↑i ^ k * Real.exp (-(c * ↑i)) ≤ Real.exp c * ↑k.factorial / c ^ (k + 1) - sum_Iic_pow_mul_two_pow_neg_le 📋 Mathlib.Analysis.SumIntegralExpDecay
{k M : ℕ} {c : ℝ} (hc : 0 < c) : ∑ i ≤ M, ↑i ^ k * 2 ^ (-(c * ↑i)) ≤ 2 ^ c * ↑k.factorial / (Real.log 2 * c) ^ (k + 1) - Finset.sum_card_slice 📋 Mathlib.Data.Finset.Slice
{α : Type u_1} (𝒜 : Finset (Finset α)) [Fintype α] : ∑ r ≤ Fintype.card α, (𝒜.slice r).card = 𝒜.card - Finset.biUnion_slice 📋 Mathlib.Data.Finset.Slice
{α : Type u_1} (𝒜 : Finset (Finset α)) [Fintype α] [DecidableEq α] : (Finset.Iic (Fintype.card α)).biUnion 𝒜.slice = 𝒜 - Nat.bell_succ 📋 Mathlib.Combinatorics.Enumerative.Bell
(n : ℕ) : (n + 1).bell = ∑ i ≤ n, n.choose i * (n - i).bell - IncidenceAlgebra.moebius_inversion_bot 📋 Mathlib.Combinatorics.Enumerative.IncidenceAlgebra
{𝕜 : Type u_1} {α : Type u_4} [Ring 𝕜] [PartialOrder α] [OrderBot α] [LocallyFiniteOrder α] [DecidableEq α] (f g : α → 𝕜) (h : ∀ (x : α), g x = ∑ y ≤ x, f y) (x : α) : f x = ∑ y ≤ x, (IncidenceAlgebra.mu 𝕜) y x * g y - Nat.largeSchroder_succ 📋 Mathlib.Combinatorics.Enumerative.Schroder
(n : ℕ) : (n + 1).largeSchroder = n.largeSchroder + ∑ i ≤ n, i.largeSchroder * (n - i).largeSchroder - Finset.card_shatterer_le_sum_vcDim 📋 Mathlib.Combinatorics.SetFamily.Shatter
{α : Type u_1} [DecidableEq α] {𝒜 : Finset (Finset α)} [Fintype α] : 𝒜.shatterer.card ≤ ∑ k ≤ 𝒜.vcDim, (Fintype.card α).choose k - DFinsupp.card_Iic 📋 Mathlib.Data.DFinsupp.Interval
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → DecidableEq (α i)] [(i : ι) → AddCommMonoid (α i)] [(i : ι) → PartialOrder (α i)] [∀ (i : ι), IsBotZeroClass (α i)] [(i : ι) → OrderBot (α i)] [(i : ι) → LocallyFiniteOrder (α i)] (f : Π₀ (i : ι), α i) : (Finset.Iic f).card = ∏ i ∈ f.support, (Finset.Iic (f i)).card - DFinsupp.card_Iio 📋 Mathlib.Data.DFinsupp.Interval
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ι] [(i : ι) → DecidableEq (α i)] [(i : ι) → AddCommMonoid (α i)] [(i : ι) → PartialOrder (α i)] [∀ (i : ι), IsBotZeroClass (α i)] [(i : ι) → OrderBot (α i)] [(i : ι) → LocallyFiniteOrder (α i)] (f : Π₀ (i : ι), α i) : (Finset.Iio f).card = ∏ i ∈ f.support, (Finset.Iic (f i)).card - 1 - Multiset.card_Iic 📋 Mathlib.Data.Multiset.Interval
{α : Type u_1} [DecidableEq α] (s : Multiset α) : (Finset.Iic s).card = ∏ i ∈ s.toFinset, (Multiset.count i s + 1) - Nat.divisors_eq_image_Iic_factorization_prod_pow 📋 Mathlib.Data.Nat.Factorization.Divisors
{n : ℕ} (hn : n ≠ 0) : n.divisors = Finset.image (fun x => x.prod fun x1 x2 => x1 ^ x2) (Finset.Iic n.factorization) - Nat.Iic_factorization_prod_pow_injective 📋 Mathlib.Data.Nat.Factorization.Divisors
(n : ℕ) : Function.Injective fun x => (↑x).prod fun x1 x2 => x1 ^ x2 - Nat.divisors_eq_map_attach_Iic_factorization_prod_pow 📋 Mathlib.Data.Nat.Factorization.Divisors
{n : ℕ} (hn : n ≠ 0) : n.divisors = Finset.map { toFun := fun x => (↑x).prod fun x1 x2 => x1 ^ x2, inj' := ⋯ } (Finset.Iic n.factorization).attach - Pi.card_Iic 📋 Mathlib.Data.Pi.Interval
{ι : Type u_1} {α : ι → Type u_2} [Fintype ι] [DecidableEq ι] [(i : ι) → DecidableEq (α i)] [(i : ι) → PartialOrder (α i)] [(i : ι) → LocallyFiniteOrderBot (α i)] (b : (i : ι) → α i) : (Finset.Iic b).card = ∏ i, (Finset.Iic (b i)).card - Pi.card_Iio 📋 Mathlib.Data.Pi.Interval
{ι : Type u_1} {α : ι → Type u_2} [Fintype ι] [DecidableEq ι] [(i : ι) → DecidableEq (α i)] [(i : ι) → PartialOrder (α i)] [(i : ι) → LocallyFiniteOrderBot (α i)] (b : (i : ι) → α i) : (Finset.Iio b).card = ∏ i, (Finset.Iic (b i)).card - 1 - Sigma.Iic_mk 📋 Mathlib.Data.Sigma.Interval
{ι : Type u_1} {α : ι → Type u_2} [(i : ι) → Preorder (α i)] [(i : ι) → LocallyFiniteOrderBot (α i)] (i : ι) (a : α i) : Finset.Iic ⟨i, a⟩ = Finset.map (Function.Embedding.sigmaMk i) (Finset.Iic a) - Sum.Iic_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (a : α) : Finset.Iic (Sum.inl a) = Finset.map Function.Embedding.inl (Finset.Iic a) - Sum.Iic_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iic (Sum.inr b) = Finset.map Function.Embedding.inr (Finset.Iic b) - Sum.Lex.Iic_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iic (Sum.inrₗ b) = Finset.map toLex.toEmbedding (Finset.univ.disjSum (Finset.Iic b)) - Sum.Lex.Iic_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (a : α) : Finset.Iic (Sum.inlₗ a) = Finset.map (Function.Embedding.inl.trans toLex.toEmbedding) (Finset.Iic a) - Sum.Lex.Icc_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Icc (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum (Finset.Iic b)) - Sum.Lex.Ioc_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ioc (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum (Finset.Iic b)) - MeasureTheory.measurableCylinders_nat 📋 Mathlib.MeasureTheory.Constructions.Cylinders
{X : ℕ → Type u_1} [(n : ℕ) → MeasurableSpace (X n)] : MeasureTheory.measurableCylinders X = ⋃ a, ⋃ S, ⋃ (_ : MeasurableSet S), {MeasureTheory.cylinder (Finset.Iic a) S} - Preorder.updateFinset_frestrictLe 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] [DecidableEq α] (a : α) (x : (a : α) → π a) : Function.updateFinset x (Finset.Iic a) (Preorder.frestrictLe a x) = x - Preorder.frestrictLe 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] (a : α) (f : (i : α) → π i) (i : ↥(Finset.Iic a)) : π ↑i - Preorder.dependsOn_frestrictLe 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] (a : α) : DependsOn (Preorder.frestrictLe a) (Set.Iic a) - Preorder.frestrictLe_apply 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] (a : α) (f : (a : α) → π a) (i : ↥(Finset.Iic a)) : Preorder.frestrictLe a f i = f ↑i - Preorder.frestrictLe₂ 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] {a b : α} (hab : a ≤ b) (f : (i : ↥(Finset.Iic b)) → π ↑i) (i : ↥(Finset.Iic a)) : π ↑i - Preorder.frestrictLe_updateFinset 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] [DecidableEq α] {a : α} (x : (a : α) → π a) (y : (b : ↥(Finset.Iic a)) → π ↑b) : Preorder.frestrictLe a (Function.updateFinset x (Finset.Iic a) y) = y - Preorder.frestrictLe_updateFinset_of_le 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] [DecidableEq α] {a b : α} (hab : a ≤ b) (x : (c : α) → π c) (y : (c : ↥(Finset.Iic b)) → π ↑c) : Preorder.frestrictLe a (Function.updateFinset x (Finset.Iic b) y) = Preorder.frestrictLe₂ hab y - Preorder.frestrictLe₂_comp_frestrictLe 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] {a b : α} (hab : a ≤ b) : Preorder.frestrictLe₂ hab ∘ Preorder.frestrictLe b = Preorder.frestrictLe a - Preorder.frestrictLe₂_apply 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] {a b : α} (hab : a ≤ b) (f : (i : ↥(Finset.Iic b)) → π ↑i) (i : ↥(Finset.Iic a)) : Preorder.frestrictLe₂ hab f i = f ⟨↑i, ⋯⟩ - Preorder.frestrictLe₂_comp_frestrictLe₂ 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] {a b c : α} (hab : a ≤ b) (hbc : b ≤ c) : Preorder.frestrictLe₂ hab ∘ Preorder.frestrictLe₂ hbc = Preorder.frestrictLe₂ ⋯ - Preorder.piCongrLeft_comp_frestrictLe 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] {a : α} : ⇑(Equiv.piCongrLeft (fun i => π ↑i) (Equiv.IicFinsetSet a)) ∘ Preorder.frestrictLe a = Preorder.restrictLe a - Preorder.piCongrLeft_comp_restrictLe 📋 Mathlib.Order.Restriction
{α : Type u_1} [Preorder α] {π : α → Type u_2} [LocallyFiniteOrderBot α] {a : α} : ⇑(Equiv.piCongrLeft (fun i => π ↑i) (Equiv.IicFinsetSet a).symm) ∘ Preorder.restrictLe a = Preorder.frestrictLe a - Preorder.measurable_frestrictLe 📋 Mathlib.MeasureTheory.MeasurableSpace.PreorderRestrict
{α : Type u_1} [Preorder α] {X : α → Type u_2} [(a : α) → MeasurableSpace (X a)] [LocallyFiniteOrderBot α] (a : α) : Measurable (Preorder.frestrictLe a) - Preorder.measurable_frestrictLe₂ 📋 Mathlib.MeasureTheory.MeasurableSpace.PreorderRestrict
{α : Type u_1} [Preorder α] {X : α → Type u_2} [(a : α) → MeasurableSpace (X a)] [LocallyFiniteOrderBot α] {a b : α} (hab : a ≤ b) : Measurable (Preorder.frestrictLe₂ hab) - MeasureTheory.Filtration.piLE_eq_comap_frestrictLe 📋 Mathlib.Probability.Process.Filtration
{ι : Type u_2} [Preorder ι] {X : ι → Type u_4} [(i : ι) → MeasurableSpace (X i)] [LocallyFiniteOrderBot ι] (i : ι) : ↑MeasureTheory.Filtration.piLE i = MeasurableSpace.comap (Preorder.frestrictLe i) MeasurableSpace.pi - MeasureTheory.stoppedValue_eq' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} [Nonempty ι] {τ : Ω → WithTop ι} {E : Type u_4} {u : ι → Ω → E} [Preorder ι] [LocallyFiniteOrderBot ι] [AddCommMonoid E] {N : ι} (hbdd : ∀ (ω : Ω), τ ω ≤ ↑N) : MeasureTheory.stoppedValue u τ = ∑ i ≤ N, {ω | τ ω = ↑i}.indicator (u i) - Nat.cast_mem_Iic_iff 📋 Mathlib.Order.Interval.Finset.Floor
{α : Type u_1} [Semiring α] [LinearOrder α] [FloorSemiring α] {b : α} {n : ℕ} (hb : 0 ≤ b) : ↑n ∈ Set.Iic b ↔ n ∈ Finset.Iic ⌊b⌋₊ - Set.ncard_Iic 📋 Mathlib.Order.Interval.Set.Card
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : (Set.Iic a).ncard = (Finset.Iic a).card - Set.encard_Iic 📋 Mathlib.Order.Interval.Set.Card
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : (Set.Iic a).encard = ↑(Finset.Iic a).card - Set.cardinalMk_Iic 📋 Mathlib.Order.Interval.Set.Card
{α : Type u_1} [Preorder α] [LocallyFiniteOrderBot α] (a : α) : Cardinal.mk ↑(Set.Iic a) = ↑(Finset.Iic a).card - IicProdIoc 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] (a b : ι) (x : ((i : ↥(Finset.Iic a)) → X ↑i) × ((i : ↥(Finset.Ioc a b)) → X ↑i)) (i : ↥(Finset.Iic b)) : X ↑i - IicProdIoc_self 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] (a : ι) : IicProdIoc a a = Prod.fst - MeasurableEquiv.IicProdIoi 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] [(i : ι) → MeasurableSpace (X i)] (a : ι) : ((i : ↥(Finset.Iic a)) → X ↑i) × ((i : ↑(Set.Ioi a)) → X ↑i) ≃ᵐ ((n : ι) → X n) - IicProdIoc_le 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] {a b : ι} (hba : b ≤ a) : IicProdIoc a b = Preorder.frestrictLe₂ hba ∘ Prod.fst - frestrictLe₂_comp_IicProdIoc 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] {a b : ι} (hab : a ≤ b) : Preorder.frestrictLe₂ hab ∘ IicProdIoc a b = Prod.fst - IicProdIoc_comp_restrict₂ 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] {a b : ι} : Finset.restrict₂ ⋯ ∘ IicProdIoc a b = Prod.snd - restrict₂_comp_IicProdIoc 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] (a b : ι) : Finset.restrict₂ ⋯ ∘ IicProdIoc a b = Prod.snd - measurable_IicProdIoc 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] [(i : ι) → MeasurableSpace (X i)] {m n : ι} : Measurable (IicProdIoc m n) - MeasurableEquiv.IicProdIoc 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] [(i : ι) → MeasurableSpace (X i)] {a b : ι} (hab : a ≤ b) : ((i : ↥(Finset.Iic a)) → X ↑i) × ((i : ↥(Finset.Ioc a b)) → X ↑i) ≃ᵐ ((i : ↥(Finset.Iic b)) → X ↑i) - IicProdIoc_preimage 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] {a b : ι} (hab : a ≤ b) (s : (i : ↥(Finset.Iic b)) → Set (X ↑i)) : IicProdIoc a b ⁻¹' Set.univ.pi s = Set.univ.pi (Preorder.frestrictLe₂ hab s) ×ˢ Set.univ.pi (Finset.restrict₂ ⋯ s) - IicProdIoc_def 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] (a b : ι) : IicProdIoc a b = fun x i => if h : ↑i ≤ a then x.1 ⟨↑i, ⋯⟩ else x.2 ⟨↑i, ⋯⟩ - MeasurableEquiv.coe_IicProdIoc 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] [(i : ι) → MeasurableSpace (X i)] {a b : ι} (hab : a ≤ b) : ⇑(MeasurableEquiv.IicProdIoc hab) = IicProdIoc a b - MeasurableEquiv.coe_IicProdIoc_symm 📋 Mathlib.Probability.Kernel.IonescuTulcea.Maps
{ι : Type u_1} [LinearOrder ι] [LocallyFiniteOrder ι] [DecidableLE ι] {X : ι → Type u_2} [LocallyFiniteOrderBot ι] [(i : ι) → MeasurableSpace (X i)] {a b : ι} (hab : a ≤ b) : ⇑(MeasurableEquiv.IicProdIoc hab).symm = fun x => (Preorder.frestrictLe₂ hab x, Finset.restrict₂ ⋯ x) - ProbabilityTheory.Kernel.lmarginalPartialTraj 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} (κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))) (a b : ℕ) (f : ((n : ℕ) → X n) → ENNReal) (x₀ : (n : ℕ) → X n) : ENNReal - ProbabilityTheory.Kernel.measurable_lmarginalPartialTraj 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (a b : ℕ) {f : ((n : ℕ) → X n) → ENNReal} (hf : Measurable f) : Measurable (ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b f) - ProbabilityTheory.Kernel.lmarginalPartialTraj_le 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b : ℕ} (κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))) (hba : b ≤ a) {f : ((n : ℕ) → X n) → ENNReal} (mf : Measurable f) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b f = f - ProbabilityTheory.Kernel.lmarginalPartialTraj_mono 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (a b : ℕ) {f g : ((n : ℕ) → X n) → ENNReal} (hfg : f ≤ g) (x₀ : (n : ℕ) → X n) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b f x₀ ≤ ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b g x₀ - ProbabilityTheory.Kernel.lmarginalPartialTraj_self 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b c : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (hab : a ≤ b) (hbc : b ≤ c) {f : ((n : ℕ) → X n) → ENNReal} (hf : Measurable f) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b (ProbabilityTheory.Kernel.lmarginalPartialTraj κ b c f) = ProbabilityTheory.Kernel.lmarginalPartialTraj κ a c f - DependsOn.lmarginalPartialTraj_of_le 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] (c : ℕ) {f : ((n : ℕ) → X n) → ENNReal} (mf : Measurable f) (hf : DependsOn f ↑(Finset.Iic a)) (hab : a ≤ b) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ b c f = f - DependsOn.dependsOn_lmarginalPartialTraj 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {b : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsSFiniteKernel (κ n)] (a : ℕ) {f : ((n : ℕ) → X n) → ENNReal} (hf : DependsOn f ↑(Finset.Iic b)) (mf : Measurable f) : DependsOn (ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b f) ↑(Finset.Iic a) - DependsOn.lmarginalPartialTraj_const_right 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b c : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] {d : ℕ} {f : ((n : ℕ) → X n) → ENNReal} (mf : Measurable f) (hf : DependsOn f ↑(Finset.Iic a)) (hac : a ≤ c) (had : a ≤ d) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ b c f = ProbabilityTheory.Kernel.lmarginalPartialTraj κ b d f - ProbabilityTheory.Kernel.partialTraj 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} (κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))) (a b : ℕ) : ProbabilityTheory.Kernel ((i : ↥(Finset.Iic a)) → X ↑i) ((i : ↥(Finset.Iic b)) → X ↑i) - ProbabilityTheory.Kernel.instIsSFiniteKernelForallValNatMemFinsetIicPartialTraj 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (a b : ℕ) : ProbabilityTheory.IsSFiniteKernel (ProbabilityTheory.Kernel.partialTraj κ a b) - ProbabilityTheory.Kernel.partialTraj_self 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (a : ℕ) : ProbabilityTheory.Kernel.partialTraj κ a a = ProbabilityTheory.Kernel.id - ProbabilityTheory.Kernel.instIsFiniteKernelForallValNatMemFinsetIicPartialTrajOfHAddOfNat 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsFiniteKernel (κ n)] (a b : ℕ) : ProbabilityTheory.IsFiniteKernel (ProbabilityTheory.Kernel.partialTraj κ a b) - ProbabilityTheory.Kernel.instIsMarkovKernelForallValNatMemFinsetIicPartialTrajOfHAddOfNat 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] (a b : ℕ) : ProbabilityTheory.IsMarkovKernel (ProbabilityTheory.Kernel.partialTraj κ a b) - ProbabilityTheory.Kernel.instIsZeroOrMarkovKernelForallValNatMemFinsetIicPartialTrajOfHAddOfNat 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsZeroOrMarkovKernel (κ n)] (a b : ℕ) : ProbabilityTheory.IsZeroOrMarkovKernel (ProbabilityTheory.Kernel.partialTraj κ a b) - ProbabilityTheory.Kernel.partialTraj_le 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (hba : b ≤ a) : ProbabilityTheory.Kernel.partialTraj κ a b = ProbabilityTheory.Kernel.deterministic (Preorder.frestrictLe₂ hba) ⋯ - ProbabilityTheory.Kernel.partialTraj_zero 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} : ProbabilityTheory.Kernel.partialTraj κ a 0 = ProbabilityTheory.Kernel.deterministic (Preorder.frestrictLe₂ ⋯) ⋯ - ProbabilityTheory.Kernel.lmarginalPartialTraj_succ 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsSFiniteKernel (κ n)] (a : ℕ) {f : ((n : ℕ) → X n) → ENNReal} (mf : Measurable f) (x₀ : (n : ℕ) → X n) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ a (a + 1) f x₀ = ∫⁻ (x : X (a + 1)), f (Function.update x₀ (a + 1) x) ∂(κ a) (Preorder.frestrictLe a x₀) - ProbabilityTheory.Kernel.partialTraj_comp_partialTraj 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b c : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (hab : a ≤ b) (hbc : b ≤ c) : (ProbabilityTheory.Kernel.partialTraj κ b c).comp (ProbabilityTheory.Kernel.partialTraj κ a b) = ProbabilityTheory.Kernel.partialTraj κ a c - ProbabilityTheory.Kernel.partialTraj_succ_eq_comp 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} (hab : a ≤ b) : ProbabilityTheory.Kernel.partialTraj κ a (b + 1) = (ProbabilityTheory.Kernel.partialTraj κ b (b + 1)).comp (ProbabilityTheory.Kernel.partialTraj κ a b) - ProbabilityTheory.Kernel.partialTraj_comp_partialTraj' 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] (c : ℕ) (hab : a ≤ b) : (ProbabilityTheory.Kernel.partialTraj κ b c).comp (ProbabilityTheory.Kernel.partialTraj κ a b) = ProbabilityTheory.Kernel.partialTraj κ a c - ProbabilityTheory.Kernel.partialTraj_comp_partialTraj'' 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] {b c : ℕ} (hcb : c ≤ b) : (ProbabilityTheory.Kernel.partialTraj κ b c).comp (ProbabilityTheory.Kernel.partialTraj κ a b) = ProbabilityTheory.Kernel.partialTraj κ a c - ProbabilityTheory.Kernel.partialTraj_map_frestrictLe₂ 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {b c : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] (a : ℕ) (hbc : b ≤ c) : (ProbabilityTheory.Kernel.partialTraj κ a c).map (Preorder.frestrictLe₂ hbc) = ProbabilityTheory.Kernel.partialTraj κ a b - ProbabilityTheory.Kernel.partialTraj_succ_map_frestrictLe₂ 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsMarkovKernel (κ n)] (a b : ℕ) : (ProbabilityTheory.Kernel.partialTraj κ a (b + 1)).map (Preorder.frestrictLe₂ ⋯) = ProbabilityTheory.Kernel.partialTraj κ a b - ProbabilityTheory.Kernel.lmarginalPartialTraj_eq_lintegral_map 📋 Mathlib.Probability.Kernel.IonescuTulcea.PartialTraj
{X : ℕ → Type u_1} {mX : (n : ℕ) → MeasurableSpace (X n)} {a b : ℕ} {κ : (n : ℕ) → ProbabilityTheory.Kernel ((i : ↥(Finset.Iic n)) → X ↑i) (X (n + 1))} [∀ (n : ℕ), ProbabilityTheory.IsSFiniteKernel (κ n)] {f : ((n : ℕ) → X n) → ENNReal} (mf : Measurable f) (x₀ : (n : ℕ) → X n) : ProbabilityTheory.Kernel.lmarginalPartialTraj κ a b f x₀ = ∫⁻ (x : (i : ↥(Finset.Ioc a b)) → X ↑i), f (Function.updateFinset x₀ (Finset.Ioc a b) x) ∂((ProbabilityTheory.Kernel.partialTraj κ a b).map (Finset.restrict₂ ⋯)) (Preorder.frestrictLe a x₀)
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 ce5dd8c