Loogle!
Result
Found 47 declarations mentioning Finset.disjSum.
- Finset.disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) (t : Finset β) : Finset (α ⊕ β) - Finset.Injective2_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_4} {β : Type u_5} : Function.Injective2 Finset.disjSum - Finset.toLeft_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} : (s.disjSum t).toLeft = s - Finset.toRight_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} : (s.disjSum t).toRight = t - Finset.toLeft_disjSum_toRight 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {u : Finset (α ⊕ β)} : u.toLeft.disjSum u.toRight = u - Finset.disjSum_empty 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) : s.disjSum ∅ = Finset.map Function.Embedding.inl s - Finset.empty_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (t : Finset β) : ∅.disjSum t = Finset.map Function.Embedding.inr t - Finset.disjSum_mono_right 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) : Monotone s.disjSum - Finset.disjSum_strictMono_right 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) : StrictMono s.disjSum - Finset.val_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) (t : Finset β) : (s.disjSum t).val = s.val.disjSum t.val - Finset.card_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) (t : Finset β) : (s.disjSum t).card = s.card + t.card - Finset.disjSum_mono_left 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (t : Finset β) : Monotone fun s => s.disjSum t - Finset.disjSum_strictMono_left 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (t : Finset β) : StrictMono fun s => s.disjSum t - Finset.disjSum_inj 📋 Mathlib.Data.Finset.Sum
{α : Type u_4} {β : Type u_5} {s₁ s₂ : Finset α} {t₁ t₂ : Finset β} : s₁.disjSum t₁ = s₂.disjSum t₂ ↔ s₁ = s₂ ∧ t₁ = t₂ - Finset.disjSum_eq_iff 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {u : Finset (α ⊕ β)} : s.disjSum t = u ↔ s = u.toLeft ∧ t = u.toRight - Finset.eq_disjSum_iff 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {u : Finset (α ⊕ β)} : u = s.disjSum t ↔ u.toLeft = s ∧ u.toRight = t - Finset.map_inl_disjUnion_map_inr 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} (s : Finset α) (t : Finset β) : (Finset.map Function.Embedding.inl s).disjUnion (Finset.map Function.Embedding.inr t) ⋯ = s.disjSum t - Finset.disjSum_eq_empty 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} : s.disjSum t = ∅ ↔ s = ∅ ∧ t = ∅ - Finset.inl_mem_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {a : α} : Sum.inl a ∈ s.disjSum t ↔ a ∈ s - Finset.inr_mem_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {b : β} : Sum.inr b ∈ s.disjSum t ↔ b ∈ t - Finset.map_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {γ : Type u_3} {s : Finset α} {t : Finset β} (f : α ⊕ β ↪ γ) : Finset.map f (s.disjSum t) = (Finset.map (Function.Embedding.inl.trans f) s).disjUnion (Finset.map (Function.Embedding.inr.trans f) t) ⋯ - Finset.disjSum_mono 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s₁ s₂ : Finset α} {t₁ t₂ : Finset β} (hs : s₁ ⊆ s₂) (ht : t₁ ⊆ t₂) : s₁.disjSum t₁ ⊆ s₂.disjSum t₂ - Finset.disjSum_ssubset_disjSum_of_ssubset_of_subset 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s₁ s₂ : Finset α} {t₁ t₂ : Finset β} (hs : s₁ ⊂ s₂) (ht : t₁ ⊆ t₂) : s₁.disjSum t₁ ⊂ s₂.disjSum t₂ - Finset.disjSum_ssubset_disjSum_of_subset_of_ssubset 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s₁ s₂ : Finset α} {t₁ t₂ : Finset β} (hs : s₁ ⊆ s₂) (ht : t₁ ⊂ t₂) : s₁.disjSum t₁ ⊂ s₂.disjSum t₂ - Finset.disjSum_subset 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {u : Finset (α ⊕ β)} : s.disjSum t ⊆ u ↔ s ⊆ u.toLeft ∧ t ⊆ u.toRight - Finset.subset_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {u : Finset (α ⊕ β)} : u ⊆ s.disjSum t ↔ u.toLeft ⊆ s ∧ u.toRight ⊆ t - Finset.fold_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {γ : Type u_3} (s : Finset α) (t : Finset β) (f : α ⊕ β → γ) (b₁ b₂ : γ) (op : γ → γ → γ) [Std.Commutative op] [Std.Associative op] : Finset.fold op (op b₁ b₂) f (s.disjSum t) = op (Finset.fold op b₁ (fun x => f (Sum.inl x)) s) (Finset.fold op b₂ (fun x => f (Sum.inr x)) t) - Finset.mem_disjSum 📋 Mathlib.Data.Finset.Sum
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : Finset β} {x : α ⊕ β} : x ∈ s.disjSum t ↔ (∃ a ∈ s, Sum.inl a = x) ∨ ∃ b ∈ t, Sum.inr b = x - Finset.sumEquiv_symm_apply 📋 Mathlib.Data.Finset.Sum
{α : Type u_4} {β : Type u_5} (s : Finset α × Finset β) : Finset.sumEquiv.symm s = s.1.disjSum s.2 - Finset.inf_disjSum 📋 Mathlib.Data.Finset.Lattice.Fold
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [SemilatticeInf α] [OrderTop α] (s : Finset β) (t : Finset γ) (f : β ⊕ γ → α) : (s.disjSum t).inf f = (s.inf fun x => f (Sum.inl x)) ⊓ t.inf fun x => f (Sum.inr x) - Finset.sup_disjSum 📋 Mathlib.Data.Finset.Lattice.Fold
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [SemilatticeSup α] [OrderBot α] (s : Finset β) (t : Finset γ) (f : β ⊕ γ → α) : (s.disjSum t).sup f = (s.sup fun x => f (Sum.inl x)) ⊔ t.sup fun x => f (Sum.inr x) - Finset.prod_sumElim 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [CommMonoid M] (s : Finset ι) (t : Finset κ) (f : ι → M) (g : κ → M) : ∏ x ∈ s.disjSum t, Sum.elim f g x = (∏ x ∈ s, f x) * ∏ x ∈ t, g x - Finset.sum_sumElim 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [AddCommMonoid M] (s : Finset ι) (t : Finset κ) (f : ι → M) (g : κ → M) : ∑ x ∈ s.disjSum t, Sum.elim f g x = ∑ x ∈ s, f x + ∑ x ∈ t, g x - Finset.prod_disjSum 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [CommMonoid M] (s : Finset ι) (t : Finset κ) (f : ι ⊕ κ → M) : ∏ x ∈ s.disjSum t, f x = (∏ x ∈ s, f (Sum.inl x)) * ∏ x ∈ t, f (Sum.inr x) - Finset.sum_disjSum 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [AddCommMonoid M] (s : Finset ι) (t : Finset κ) (f : ι ⊕ κ → M) : ∑ x ∈ s.disjSum t, f x = ∑ x ∈ s, f (Sum.inl x) + ∑ x ∈ t, f (Sum.inr x) - Finset.univ_disjSum_univ 📋 Mathlib.Data.Fintype.Sum
{α : Type u_3} {β : Type u_4} [Fintype α] [Fintype β] : Finset.univ.disjSum Finset.univ = Finset.univ - Finsupp.sumElim_support 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [Zero γ] (f : α →₀ γ) (g : β →₀ γ) : (f.sumElim g).support = f.support.disjSum g.support - Finset.centerMass_segment' 📋 Mathlib.Analysis.Convex.Combination
{R : Type u_1} {E : Type u_3} {ι : Type u_5} {ι' : Type u_6} [Field R] [AddCommGroup E] [Module R E] (s : Finset ι) (t : Finset ι') (ws : ι → R) (zs : ι → E) (wt : ι' → R) (zt : ι' → E) (hws : ∑ i ∈ s, ws i = 1) (hwt : ∑ i ∈ t, wt i = 1) (a b : R) (hab : a + b = 1) : a • s.centerMass ws zs + b • t.centerMass wt zt = (s.disjSum t).centerMass (Sum.elim (fun i => a * ws i) fun j => b * wt j) (Sum.elim zs zt) - Finset.sumLexLift_inl_inr 📋 Mathlib.Data.Sum.Interval
{α₁ : Type u_1} {α₂ : Type u_2} {β₁ : Type u_3} {β₂ : Type u_4} {γ₁ : Type u_5} {γ₂ : Type u_6} (f₁ : α₁ → β₁ → Finset γ₁) (f₂ : α₂ → β₂ → Finset γ₂) (g₁ : α₁ → β₂ → Finset γ₁) (g₂ : α₁ → β₂ → Finset γ₂) (a : α₁) (b : β₂) : Finset.sumLexLift f₁ f₂ g₁ g₂ (Sum.inl a) (Sum.inr b) = (g₁ a b).disjSum (g₂ a b) - Sum.Lex.Ici_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (a : α) : Finset.Ici (Sum.inlₗ a) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum Finset.univ) - 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.Iio_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [Fintype α] [LocallyFiniteOrderBot α] [LocallyFiniteOrderBot β] (b : β) : Finset.Iio (Sum.inrₗ b) = Finset.map toLex.toEmbedding (Finset.univ.disjSum (Finset.Iio b)) - Sum.Lex.Ioi_inl 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrderTop α] [Fintype β] [LocallyFiniteOrderTop β] (a : α) : Finset.Ioi (Sum.inlₗ a) = Finset.map toLex.toEmbedding ((Finset.Ioi a).disjSum Finset.univ) - 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.Ico_inl_inr 📋 Mathlib.Data.Sum.Interval
{α : Type u_1} {β : Type u_2} [Preorder α] [Preorder β] [LocallyFiniteOrder α] [LocallyFiniteOrder β] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot β] (a : α) (b : β) : Finset.Ico (Sum.inlₗ a) (Sum.inrₗ b) = Finset.map toLex.toEmbedding ((Finset.Ici a).disjSum (Finset.Iio 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)) - 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))
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