Loogle!
Result
Found 144 declarations mentioning Finset.biUnion.
- Finset.biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset α) (t : α → Finset β) : Finset β - Finset.biUnion_singleton_eq_self 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {s : Finset α} [DecidableEq α] : s.biUnion singleton = s - Finset.biUnion_empty 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {t : α → Finset β} [DecidableEq β] : ∅.biUnion t = ∅ - Finset.singleton_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {t : α → Finset β} [DecidableEq β] {a : α} : {a}.biUnion t = t a - Finset.biUnion_singleton 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} [DecidableEq β] {f : α → β} : (s.biUnion fun a => {f a}) = Finset.image f s - Finset.biUnion_val 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset α) (t : α → Finset β) : (s.biUnion t).val = (s.val.bind fun a => (t a).val).dedup - Finset.erase_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (f : α → Finset β) (s : Finset α) (b : β) : (s.biUnion f).erase b = s.biUnion fun x => (f x).erase b - Finset.bind_toFinset 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] [DecidableEq α] (s : Multiset α) (t : α → Multiset β) : (s.bind t).toFinset = s.toFinset.biUnion fun a => (t a).toFinset - Finset.image_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [DecidableEq β] [DecidableEq γ] {f : α → β} {s : Finset α} {t : β → Finset γ} : (Finset.image f s).biUnion t = s.biUnion fun a => t (f a) - Finset.Nonempty.biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [DecidableEq β] (hs : s.Nonempty) (ht : ∀ x ∈ s, (t x).Nonempty) : (s.biUnion t).Nonempty - Finset.biUnion_nonempty 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [DecidableEq β] : (s.biUnion t).Nonempty ↔ ∃ x ∈ s, (t x).Nonempty - Finset.filter_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset α) (f : α → Finset β) (p : β → Prop) [DecidablePred p] : Finset.filter p (s.biUnion f) = s.biUnion fun a => Finset.filter p (f a) - Finset.image_biUnion_filter_eq 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] [DecidableEq α] (s : Finset β) (g : β → α) : ((Finset.image g s).biUnion fun a => {c ∈ s | g c = a}) = s - Finset.disjiUnion_eq_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset α) (f : α → Finset β) (hf : (↑s).PairwiseDisjoint f) : s.disjiUnion f hf = s.biUnion f - Finset.biUnion_image 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [DecidableEq β] [DecidableEq γ] {s : Finset α} {t : α → Finset β} {f : β → γ} : Finset.image f (s.biUnion t) = s.biUnion fun a => Finset.image f (t a) - Finset.subset_biUnion_of_mem 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} [DecidableEq β] (u : α → Finset β) {x : α} (xs : x ∈ s) : u x ⊆ s.biUnion u - Finset.biUnion_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [DecidableEq β] [DecidableEq γ] (s : Finset α) (f : α → Finset β) (g : β → Finset γ) : (s.biUnion f).biUnion g = s.biUnion fun a => (f a).biUnion g - Finset.biUnion_inter 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset α) (f : α → Finset β) (t : Finset β) : s.biUnion f ∩ t = s.biUnion fun x => f x ∩ t - Finset.inter_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (t : Finset β) (s : Finset α) (f : α → Finset β) : t ∩ s.biUnion f = s.biUnion fun x => t ∩ f x - Finset.biUnion_insert 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [DecidableEq β] [DecidableEq α] {a : α} : (insert a s).biUnion t = t a ∪ s.biUnion t - Finset.biUnion_subset_biUnion_of_subset_left 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s₁ s₂ : Finset α} [DecidableEq β] (t : α → Finset β) (h : s₁ ⊆ s₂) : s₁.biUnion t ⊆ s₂.biUnion t - Finset.union_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s₁ s₂ : Finset α} {t : α → Finset β} [DecidableEq β] [DecidableEq α] : (s₁ ∪ s₂).biUnion t = s₁.biUnion t ∪ s₂.biUnion t - Finset.biUnion_union 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t₁ t₂ : α → Finset β} [DecidableEq β] : (s.biUnion fun x => t₁ x ∪ t₂ x) = s.biUnion t₁ ∪ s.biUnion t₂ - Finset.disjoint_biUnion_left 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset α) (f : α → Finset β) (t : Finset β) : Disjoint (s.biUnion f) t ↔ ∀ i ∈ s, Disjoint (f i) t - Finset.disjoint_biUnion_right 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] (s : Finset β) (t : Finset α) (f : α → Finset β) : Disjoint s (t.biUnion f) ↔ ∀ i ∈ t, Disjoint s (f i) - Finset.biUnion_congr 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s₁ s₂ : Finset α} {t₁ t₂ : α → Finset β} [DecidableEq β] (hs : s₁ = s₂) (ht : ∀ a ∈ s₁, t₁ a = t₂ a) : s₁.biUnion t₁ = s₂.biUnion t₂ - Finset.biUnion_subset 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [DecidableEq β] {s' : Finset β} : s.biUnion t ⊆ s' ↔ ∀ x ∈ s, t x ⊆ s' - Finset.biUnion_subset_iff_forall_subset 📋 Mathlib.Data.Finset.Union
{α : Type u_4} {β : Type u_5} [DecidableEq β] {s : Finset α} {t : Finset β} {f : α → Finset β} : s.biUnion f ⊆ t ↔ ∀ x ∈ s, f x ⊆ t - Finset.mem_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [DecidableEq β] {b : β} : b ∈ s.biUnion t ↔ ∃ a ∈ s, b ∈ t a - Finset.biUnion_filter_eq_of_maps_to 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} [DecidableEq β] [DecidableEq α] {s : Finset α} {t : Finset β} {f : α → β} (h : ∀ x ∈ s, f x ∈ t) : (t.biUnion fun a => {c ∈ s | f c = a}) = s - Finset.biUnion_mono 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t₁ t₂ : α → Finset β} [DecidableEq β] (h : ∀ a ∈ s, t₁ a ⊆ t₂ a) : s.biUnion t₁ ⊆ s.biUnion t₂ - Finset.coe_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} {t : α → Finset β} [DecidableEq β] : ↑(s.biUnion t) = ⋃ x ∈ ↑s, ↑(t x) - Finset.attach_biUnion 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} [DecidableEq β] {f : α → Finset β} : (s.attach.biUnion fun x => f ↑x) = s.biUnion f - Finset.attach_biUnion' 📋 Mathlib.Data.Finset.Union
{α : Type u_1} {β : Type u_2} {s : Finset α} [DecidableEq β] [DecidableEq α] {f : ↥s → Finset β} : s.attach.biUnion f = s.biUnion fun a => if h : a ∈ s then f ⟨a, h⟩ else ∅ - Finset.product_eq_biUnion 📋 Mathlib.Data.Finset.Prod
{α : Type u_1} {β : Type u_2} [DecidableEq (α × β)] (s : Finset α) (t : Finset β) : s ×ˢ t = s.biUnion fun a => Finset.image (fun b => (a, b)) t - Finset.product_eq_biUnion_right 📋 Mathlib.Data.Finset.Prod
{α : Type u_1} {β : Type u_2} [DecidableEq (α × β)] (s : Finset α) (t : Finset β) : s ×ˢ t = t.biUnion fun b => Finset.image (fun a => (a, b)) s - Finset.product_biUnion 📋 Mathlib.Data.Finset.Prod
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [DecidableEq γ] (s : Finset α) (t : Finset β) (f : α × β → Finset γ) : (s ×ˢ t).biUnion f = s.biUnion fun a => t.biUnion fun b => f (a, b) - Finset.pi_insert 📋 Mathlib.Data.Finset.Pi
{α : Type u_1} {β : α → Type u} [DecidableEq α] [(a : α) → DecidableEq (β a)] {s : Finset α} {t : (a : α) → Finset (β a)} {a : α} (ha : a ∉ s) : (insert a s).pi t = (t a).biUnion fun b => Finset.image (Finset.Pi.cons s a b) (s.pi t) - Finset.sup_eq_biUnion 📋 Mathlib.Data.Finset.Lattice.Union
{α : Type u_7} {β : Type u_8} [DecidableEq β] (s : Finset α) (t : α → Finset β) : s.sup t = s.biUnion t - Finset.inf_biUnion 📋 Mathlib.Data.Finset.Lattice.Union
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {f : β → α} [SemilatticeInf α] [OrderTop α] [DecidableEq β] (s : Finset γ) (t : γ → Finset β) : (s.biUnion t).inf f = s.inf fun x => (t x).inf f - Finset.sup_biUnion 📋 Mathlib.Data.Finset.Lattice.Union
{α : Type u_2} {β : Type u_3} {γ : Type u_4} {f : β → α} [SemilatticeSup α] [OrderBot α] [DecidableEq β] (s : Finset γ) (t : γ → Finset β) : (s.biUnion t).sup f = s.sup fun x => (t x).sup f - Finset.inf'_biUnion 📋 Mathlib.Data.Finset.Lattice.Union
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [SemilatticeInf α] (f : β → α) [DecidableEq β] {s : Finset γ} (Hs : s.Nonempty) {t : γ → Finset β} (Ht : ∀ (b : γ), (t b).Nonempty) : (s.biUnion t).inf' ⋯ f = s.inf' Hs fun b => (t b).inf' ⋯ f - Finset.sup'_biUnion 📋 Mathlib.Data.Finset.Lattice.Union
{α : Type u_2} {β : Type u_3} {γ : Type u_4} [SemilatticeSup α] (f : β → α) [DecidableEq β] {s : Finset γ} (Hs : s.Nonempty) {t : γ → Finset β} (Ht : ∀ (b : γ), (t b).Nonempty) : (s.biUnion t).sup' ⋯ f = s.sup' Hs fun b => (t b).sup' ⋯ f - Finset.powersetCard_biUnion 📋 Mathlib.Data.Finset.Powerset
{α : Type u_1} {s : Finset α} [DecidableEq α] {r : ℕ} (hr : r ≠ 0) (hrs : r ≤ s.card) : (Finset.powersetCard r s).biUnion id = s - Finset.powerset_card_biUnion 📋 Mathlib.Data.Finset.Powerset
{α : Type u_1} [DecidableEq (Finset α)] (s : Finset α) : s.powerset = (Finset.range (s.card + 1)).biUnion fun i => Finset.powersetCard i s - Finset.biUnion_id_subset_iff_subset_powerset 📋 Mathlib.Data.Finset.Powerset
{α : Type u_1} {t : Finset α} [DecidableEq α] {s : Finset (Finset α)} : s.biUnion id ⊆ t ↔ s ⊆ t.powerset - Finset.injOn_image_of_biUnion_injOn 📋 Mathlib.Data.Finset.Powerset
{α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] {S : Finset (Finset α)} {f : α → β} (hf : Set.InjOn f ↑(S.biUnion id)) : Set.InjOn (fun x => Finset.image f x) ↑S - Finset.eraseNone_eq_biUnion 📋 Mathlib.Data.Finset.Option
{α : Type u_1} [DecidableEq α] (s : Finset (Option α)) : Finset.eraseNone s = s.biUnion Option.toFinset - Set.toFinset_iUnion 📋 Mathlib.Data.Set.Finite.Lattice
{α : Type u} {β : Type v} [Fintype β] [DecidableEq α] (f : β → Set α) [(w : β) → Fintype ↑(f w)] : (⋃ x, f x).toFinset = Finset.univ.biUnion fun x => (f x).toFinset - Finset.set_biInter_biUnion 📋 Mathlib.Order.CompleteLattice.Finset
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [DecidableEq α] (s : Finset γ) (t : γ → Finset α) (f : α → Set β) : ⋂ y ∈ s.biUnion t, f y = ⋂ x ∈ s, ⋂ y ∈ t x, f y - Finset.set_biUnion_biUnion 📋 Mathlib.Order.CompleteLattice.Finset
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [DecidableEq α] (s : Finset γ) (t : γ → Finset α) (f : α → Set β) : ⋃ y ∈ s.biUnion t, f y = ⋃ x ∈ s, ⋃ y ∈ t x, f y - Finset.iInf_biUnion 📋 Mathlib.Order.CompleteLattice.Finset
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [CompleteLattice β] [DecidableEq α] (s : Finset γ) (t : γ → Finset α) (f : α → β) : ⨅ y ∈ s.biUnion t, f y = ⨅ x ∈ s, ⨅ y ∈ t x, f y - Finset.iSup_biUnion 📋 Mathlib.Order.CompleteLattice.Finset
{α : Type u_1} {β : Type u_2} {γ : Type u_3} [CompleteLattice β] [DecidableEq α] (s : Finset γ) (t : γ → Finset α) (f : α → β) : ⨆ y ∈ s.biUnion t, f y = ⨆ x ∈ s, ⨆ y ∈ t x, f y - Finset.sigma_eq_biUnion 📋 Mathlib.Data.Finset.Sigma
{ι : Type u_1} {α : ι → Type u_2} [DecidableEq ((i : ι) × α i)] (s : Finset ι) (t : (i : ι) → Finset (α i)) : s.sigma t = s.biUnion fun i => Finset.map (Function.Embedding.sigmaMk i) (t i) - Finset.card_biUnion_le 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {M : Type u_4} [DecidableEq M] {s : Finset ι} {t : ι → Finset M} : (s.biUnion t).card ≤ ∑ a ∈ s, (t a).card - Finset.card_biUnion 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {M : Type u_4} {s : Finset ι} [DecidableEq M] {t : ι → Finset M} (h : (↑s).PairwiseDisjoint t) : (s.biUnion t).card = ∑ u ∈ s, (t u).card - Finset.prod_biUnion 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [CommMonoid M] {f : ι → M} [DecidableEq ι] {s : Finset κ} {t : κ → Finset ι} (hs : (↑s).PairwiseDisjoint t) : ∏ x ∈ s.biUnion t, f x = ∏ x ∈ s, ∏ i ∈ t x, f i - Finset.sum_biUnion 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [AddCommMonoid M] {f : ι → M} [DecidableEq ι] {s : Finset κ} {t : κ → Finset ι} (hs : (↑s).PairwiseDisjoint t) : ∑ x ∈ s.biUnion t, f x = ∑ x ∈ s, ∑ i ∈ t x, f i - Finset.prod_biUnion_of_pairwise_eq_one 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [CommMonoid M] {f : ι → M} [DecidableEq ι] {s : Finset κ} {t : κ → Finset ι} (hs : (↑s).Pairwise fun i j => ∀ k ∈ t i ∩ t j, f k = 1) : ∏ x ∈ s.biUnion t, f x = ∏ x ∈ s, ∏ i ∈ t x, f i - Finset.sum_biUnion_of_pairwise_eq_zero 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {κ : Type u_2} {M : Type u_4} [AddCommMonoid M] {f : ι → M} [DecidableEq ι] {s : Finset κ} {t : κ → Finset ι} (hs : (↑s).Pairwise fun i j => ∀ k ∈ t i ∩ t j, f k = 0) : ∑ x ∈ s.biUnion t, f x = ∑ x ∈ s, ∑ i ∈ t x, f i - Submodule.span_attach_biUnion 📋 Mathlib.LinearAlgebra.Span.Defs
{R : Type u_1} {M : Type u_2} [Semiring R] [AddCommMonoid M] [Module R M] [DecidableEq M] {α : Type u_6} (s : Finset α) (f : ↥s → Finset M) : Submodule.span R ↑(s.attach.biUnion f) = ⨆ x, Submodule.span R ↑(f x) - Finset.SupIndep.biUnion 📋 Mathlib.Order.SupIndep
{α : Type u_1} {ι : Type u_3} {ι' : Type u_4} [Lattice α] [IsModularLattice α] [OrderBot α] [DecidableEq ι] {s : Finset ι'} {g : ι' → Finset ι} {f : ι → α} (hs : s.SupIndep fun i => (g i).sup f) (hg : ∀ i' ∈ s, (g i').SupIndep f) : (s.biUnion g).SupIndep f - Finsupp.support_finsetSum 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {β : Type u_7} {M : Type u_8} [DecidableEq β] [AddCommMonoid M] {s : Finset α} {f : α → β →₀ M} : (s.sum f).support ⊆ s.biUnion fun x => (f x).support - Finsupp.support_finset_sum 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {β : Type u_7} {M : Type u_8} [DecidableEq β] [AddCommMonoid M] {s : Finset α} {f : α → β →₀ M} : (s.sum f).support ⊆ s.biUnion fun x => (f x).support - Finsupp.support_sum 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {β : Type u_7} {M : Type u_8} {N : Type u_10} [DecidableEq β] [Zero M] [AddCommMonoid N] {f : α →₀ M} {g : α → M → β →₀ N} : (f.sum g).support ⊆ f.support.biUnion fun a => (g a (f a)).support - Finsupp.support_sum_eq_biUnion 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_16} {ι : Type u_17} {M : Type u_18} [DecidableEq α] [AddCommMonoid M] {g : ι → α →₀ M} (s : Finset ι) (h : ∀ (i₁ i₂ : ι), i₁ ≠ i₂ → Disjoint (g i₁).support (g i₂).support) : (∑ i ∈ s, g i).support = s.biUnion fun i => (g i).support - Finset.card_biUnion_le_card_mul 📋 Mathlib.Algebra.Order.BigOperators.Group.Finset
{ι : Type u_1} {β : Type u_3} [DecidableEq β] (s : Finset ι) (f : ι → Finset β) (n : ℕ) (h : ∀ a ∈ s, (f a).card ≤ n) : (s.biUnion f).card ≤ s.card * n - Finset.card_le_card_biUnion 📋 Mathlib.Algebra.Order.BigOperators.Group.Finset
{ι : Type u_1} {α : Type u_2} [DecidableEq α] {s : Finset ι} {f : ι → Finset α} (hs : (↑s).PairwiseDisjoint f) (hf : ∀ i ∈ s, (f i).Nonempty) : s.card ≤ (s.biUnion f).card - Finset.card_le_card_biUnion_add_one 📋 Mathlib.Algebra.Order.BigOperators.Group.Finset
{ι : Type u_1} {α : Type u_2} [DecidableEq α] {s : Finset ι} {f : ι → Finset α} (hf : Function.Injective f) (hs : (↑s).PairwiseDisjoint f) : s.card ≤ (s.biUnion f).card + 1 - Finset.card_le_card_biUnion_add_card_fiber 📋 Mathlib.Algebra.Order.BigOperators.Group.Finset
{ι : Type u_1} {α : Type u_2} [DecidableEq α] {s : Finset ι} {f : ι → Finset α} (hs : (↑s).PairwiseDisjoint f) : s.card ≤ (s.biUnion f).card + {i ∈ s | f i = ∅}.card - DFinsupp.support_sum 📋 Mathlib.Data.DFinsupp.BigOperators
{ι : Type u} {β : ι → Type v} [DecidableEq ι] {ι₁ : Type u₁} [DecidableEq ι₁] {β₁ : ι₁ → Type v₁} [(i₁ : ι₁) → Zero (β₁ i₁)] [(i : ι₁) → (x : β₁ i) → Decidable (x ≠ 0)] [(i : ι) → AddCommMonoid (β i)] [(i : ι) → (x : β i) → Decidable (x ≠ 0)] {f : Π₀ (i₁ : ι₁), β₁ i₁} {g : (i₁ : ι₁) → β₁ i₁ → Π₀ (i : ι), β i} : (f.sum g).support ⊆ f.support.biUnion fun i => (g i (f i)).support - Finset.biUnion_image_left 📋 Mathlib.Data.Finset.NAry
{α : Type u_1} {β : Type u_3} {γ : Type u_5} [DecidableEq γ] {f : α → β → γ} {s : Finset α} {t : Finset β} : (s.biUnion fun a => Finset.image (f a) t) = Finset.image₂ f s t - Finset.biUnion_image_right 📋 Mathlib.Data.Finset.NAry
{α : Type u_1} {β : Type u_3} {γ : Type u_5} [DecidableEq γ] {f : α → β → γ} {s : Finset α} {t : Finset β} : (t.biUnion fun b => Finset.image (fun a => f a b) s) = Finset.image₂ f s t - Algebra.adjoin_attach_biUnion 📋 Mathlib.Algebra.Algebra.Subalgebra.Lattice
{R : Type uR} {A : Type uA} [CommSemiring R] [Semiring A] [Algebra R A] [DecidableEq A] {α : Type u_2} {s : Finset α} (f : ↥s → Finset A) : Algebra.adjoin R ↑(s.attach.biUnion f) = ⨆ x, Algebra.adjoin R ↑(f x) - MvPolynomial.support_sum 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {α : Type u_2} [DecidableEq σ] {s : Finset α} {f : α → MvPolynomial σ R} : (∑ x ∈ s, f x).support ⊆ s.biUnion fun x => (f x).support - Finset.dens_biUnion_le 📋 Mathlib.Algebra.BigOperators.Field
{α : Type u_3} {β : Type u_4} [Fintype β] {s : Finset α} {t : α → Finset β} [DecidableEq β] : (s.biUnion t).dens ≤ ∑ a ∈ s, (t a).dens - Finset.dens_biUnion 📋 Mathlib.Algebra.BigOperators.Field
{α : Type u_3} {β : Type u_4} [Fintype β] {s : Finset α} {t : α → Finset β} [DecidableEq β] (h : (↑s).PairwiseDisjoint t) : (s.biUnion t).dens = ∑ u ∈ s, (t u).dens - Finset.biUnion_smul_finset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [DecidableEq β] [SMul α β] (s : Finset α) (t : Finset β) : (s.biUnion fun x => x • t) = s • t - Finset.biUnion_vadd_finset 📋 Mathlib.Algebra.Group.Pointwise.Finset.Scalar
{α : Type u_1} {β : Type u_2} [DecidableEq β] [VAdd α β] (s : Finset α) (t : Finset β) : (s.biUnion fun x => x +ᵥ t) = s +ᵥ t - Finset.piAntidiag_insert 📋 Mathlib.Algebra.Order.Antidiag.Pi
{ι : Type u_1} {μ : Type u_2} [DecidableEq ι] [AddCancelCommMonoid μ] [Finset.HasAntidiagonal μ] [DecidableEq μ] {i : ι} {s : Finset ι} [DecidableEq (ι → μ)] (hi : i ∉ s) (n : μ) : (insert i s).piAntidiag n = (Finset.HasAntidiagonal.antidiagonal n).biUnion fun p => Finset.image (fun f j => f j + if j = i then p.1 else 0) (s.piAntidiag p.2) - Finset.finsuppAntidiag_insert 📋 Mathlib.Algebra.Order.Antidiag.Finsupp
{ι : Type u_1} {μ : Type u_2} [DecidableEq ι] [AddCommMonoid μ] [Finset.HasAntidiagonal μ] [DecidableEq μ] {a : ι} {s : Finset ι} (h : a ∉ s) (n : μ) : (insert a s).finsuppAntidiag n = (Finset.HasAntidiagonal.antidiagonal n).biUnion fun p => Finset.map { toFun := fun f => (↑f).update a p.1, inj' := ⋯ } (s.finsuppAntidiag p.2).attach - Equiv.Perm.support_noncommProd 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {ι : Type u_2} {k : ι → Equiv.Perm α} {s : Finset ι} (hs : (↑s).Pairwise fun i j => (k i).Disjoint (k j)) : (s.noncommProd k ⋯).support = s.biUnion fun i => (k i).support - MvPolynomial.vars_eq_support_biUnion_support 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] (p : MvPolynomial σ R) [DecidableEq σ] : p.vars = p.support.biUnion Finsupp.support - MvPolynomial.vars_sum_subset 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] {ι : Type u_3} (t : Finset ι) (φ : ι → MvPolynomial σ R) [DecidableEq σ] : (∑ i ∈ t, φ i).vars ⊆ t.biUnion fun i => (φ i).vars - MvPolynomial.vars_prod 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] {ι : Type u_3} [DecidableEq σ] {s : Finset ι} (f : ι → MvPolynomial σ R) : (∏ i ∈ s, f i).vars ⊆ s.biUnion fun i => (f i).vars - MvPolynomial.vars_sum_of_disjoint 📋 Mathlib.Algebra.MvPolynomial.Variables
{R : Type u} {σ : Type u_1} [CommSemiring R] {ι : Type u_3} (t : Finset ι) (φ : ι → MvPolynomial σ R) [DecidableEq σ] (h : Pairwise (Function.onFun Disjoint fun i => (φ i).vars)) : (∑ i ∈ t, φ i).vars = t.biUnion fun i => (φ i).vars - Finset.biUnion_op_smul_finset 📋 Mathlib.Algebra.Group.Action.Pointwise.Finset
{α : Type u_2} [Mul α] [DecidableEq α] (s t : Finset α) : (t.biUnion fun a => MulOpposite.op a • s) = s * t - Finset.biUnion_op_vadd_finset 📋 Mathlib.Algebra.Group.Action.Pointwise.Finset
{α : Type u_2} [Add α] [DecidableEq α] (s t : Finset α) : (t.biUnion fun a => AddOpposite.op a +ᵥ s) = s + t - MvPolynomial.vars_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] [DecidableEq τ] (f : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : ((MvPolynomial.bind₁ f) φ).vars ⊆ φ.vars.biUnion fun i => (f i).vars - Algebra.FormallyUnramified.finite_of_free_aux 📋 Mathlib.RingTheory.Unramified.Finite
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (I : Type u_4) [DecidableEq I] (b : Module.Basis I R S) (f : I →₀ S) (x : S) (a : I → I →₀ R) (ha : a = fun i => b.repr (b i * x)) : (1 ⊗ₜ[R] x * f.sum fun i y => y ⊗ₜ[R] b i) = ∑ k ∈ f.support.biUnion fun i => (a i).support, (b.repr (f.sum fun i y => (a i) k • y)).sum fun j c => c • b j ⊗ₜ[R] b k - Finset.prod_indicator_biUnion_finset_sub_indicator 📋 Mathlib.Combinatorics.Enumerative.InclusionExclusion
{ι : Type u_1} {α : Type u_2} {s : Finset ι} [DecidableEq α] (hs : s.Nonempty) (S : ι → Finset α) (a : α) : ∏ i ∈ s, ((↑(s.biUnion S)).indicator 1 a - (↑(S i)).indicator 1 a) = 0 - Finset.inclusion_exclusion_card_biUnion 📋 Mathlib.Combinatorics.Enumerative.InclusionExclusion
{ι : Type u_1} {α : Type u_2} [DecidableEq α] (s : Finset ι) (S : ι → Finset α) : ↑(s.biUnion S).card = ∑ t, (-1) ^ ((↑t).card + 1) * ↑((↑t).inf' ⋯ S).card - Finset.inclusion_exclusion_sum_biUnion 📋 Mathlib.Combinatorics.Enumerative.InclusionExclusion
{ι : Type u_1} {α : Type u_2} {G : Type u_3} [AddCommGroup G] [DecidableEq α] (s : Finset ι) (S : ι → Finset α) (f : α → G) : ∑ a ∈ s.biUnion S, f a = ∑ t, (-1) ^ ((↑t).card + 1) • ∑ a ∈ (↑t).inf' ⋯ S, f a - BoxIntegral.Prepartition.biUnion_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) : (π.biUnion πi).boxes = π.boxes.biUnion fun J => (πi J).boxes - BoxIntegral.Prepartition.sum_biUnion_boxes 📋 Mathlib.Analysis.BoxIntegral.Partition.Basic
{ι : Type u_1} {I : BoxIntegral.Box ι} {M : Type u_2} [AddCommMonoid M] (π : BoxIntegral.Prepartition I) (πi : (J : BoxIntegral.Box ι) → BoxIntegral.Prepartition J) (f : BoxIntegral.Box ι → M) : ∑ J ∈ π.boxes.biUnion fun J => (πi J).boxes, f J = ∑ J ∈ π.boxes, ∑ J' ∈ (πi J).boxes, f J' - SkewMonoidAlgebra.support_sum 📋 Mathlib.Algebra.SkewMonoidAlgebra.Support
{k : Type u_1} {G : Type u_2} [AddCommMonoid k] {k' : Type u_3} {G' : Type u_4} [DecidableEq G'] [AddCommMonoid k'] {f : SkewMonoidAlgebra k G} {g : G → k → SkewMonoidAlgebra k' G'} : (f.sum g).support ⊆ f.support.biUnion fun a => (g a (f.coeff a)).support - MvPolynomial.support_esymm' 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.Defs
(σ : Type u_5) (R : Type u_6) [CommSemiring R] [Fintype σ] [DecidableEq σ] [Nontrivial R] (n : ℕ) : (MvPolynomial.esymm σ R n).support = (Finset.powersetCard n Finset.univ).biUnion fun t => {∑ i ∈ t, fun₀ | i => 1} - MvPolynomial.support_esymm'' 📋 Mathlib.RingTheory.MvPolynomial.Symmetric.Defs
(σ : Type u_5) (R : Type u_6) [CommSemiring R] [Fintype σ] [DecidableEq σ] [Nontrivial R] (n : ℕ) : (MvPolynomial.esymm σ R n).support = (Finset.powersetCard n Finset.univ).biUnion fun t => (fun₀ | ∑ i ∈ t, fun₀ | i => 1 => 1).support - HallMarriageTheorem.hall_hard_inductive 📋 Mathlib.Combinatorics.Hall.Finite
{ι : Type u} {α : Type v} [DecidableEq α] {t : ι → Finset α} [Finite ι] (ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) : ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x - Finset.all_card_le_biUnion_card_iff_existsInjective' 📋 Mathlib.Combinatorics.Hall.Finite
{ι : Type u_1} {α : Type u_2} [Finite ι] [DecidableEq α] (t : ι → Finset α) : (∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) ↔ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x - HallMarriageTheorem.hall_cond_of_restrict 📋 Mathlib.Combinatorics.Hall.Finite
{α : Type v} [DecidableEq α] {ι : Type u} {t : ι → Finset α} {s : Finset ι} (ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) (s' : Finset ↑↑s) : s'.card ≤ (s'.biUnion fun a' => t ↑a').card - HallMarriageTheorem.hall_cond_of_erase 📋 Mathlib.Combinatorics.Hall.Finite
{ι : Type u} {α : Type v} [DecidableEq α] {t : ι → Finset α} [Fintype ι] {x : ι} (a : α) (ha : ∀ (s : Finset ι), s.Nonempty → s ≠ Finset.univ → s.card < (s.biUnion t).card) (s' : Finset ↑{x' | x' ≠ x}) : s'.card ≤ (s'.biUnion fun x' => (t ↑x').erase a).card - HallMarriageTheorem.hall_cond_of_compl 📋 Mathlib.Combinatorics.Hall.Finite
{α : Type v} [DecidableEq α] {ι : Type u} {t : ι → Finset α} {s : Finset ι} (hus : s.card = (s.biUnion t).card) (ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) (s' : Finset ↑(↑s)ᶜ) : s'.card ≤ (s'.biUnion fun x' => t ↑x' \ s.biUnion t).card - HallMarriageTheorem.hall_hard_inductive_step_B 📋 Mathlib.Combinatorics.Hall.Finite
{ι : Type u} {α : Type v} [DecidableEq α] {t : ι → Finset α} [Fintype ι] {n : ℕ} (hn : Fintype.card ι = n + 1) (ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) (ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x) (s : Finset ι) (hs : s.Nonempty) (hns : s ≠ Finset.univ) (hus : s.card = (s.biUnion t).card) : ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x - HallMarriageTheorem.hall_hard_inductive_step_A 📋 Mathlib.Combinatorics.Hall.Finite
{ι : Type u} {α : Type v} [DecidableEq α] {t : ι → Finset α} [Fintype ι] {n : ℕ} (hn : Fintype.card ι = n + 1) (ht : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) (ih : ∀ {ι' : Type u} [inst : Fintype ι'] (t' : ι' → Finset α), Fintype.card ι' ≤ n → (∀ (s' : Finset ι'), s'.card ≤ (s'.biUnion t').card) → ∃ f, Function.Injective f ∧ ∀ (x : ι'), f x ∈ t' x) (ha : ∀ (s : Finset ι), s.Nonempty → s ≠ Finset.univ → s.card < (s.biUnion t).card) : ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x - hallMatchingsOn.nonempty 📋 Mathlib.Combinatorics.Hall.Basic
{ι : Type u} {α : Type v} [DecidableEq α] (t : ι → Finset α) (h : ∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) (ι' : Finset ι) : Nonempty ↑(hallMatchingsOn t ι') - Finset.all_card_le_biUnion_card_iff_exists_injective 📋 Mathlib.Combinatorics.Hall.Basic
{ι : Type u} {α : Type v} [DecidableEq α] (t : ι → Finset α) : (∀ (s : Finset ι), s.card ≤ (s.biUnion t).card) ↔ ∃ f, Function.Injective f ∧ ∀ (x : ι), f x ∈ t x - IsPrimitiveRoot.nthRoots_one_eq_biUnion_primitiveRoots 📋 Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
{R : Type u_4} [CommRing R] [IsDomain R] [DecidableEq R] {n : ℕ} : Polynomial.nthRootsFinset n 1 = n.divisors.biUnion fun i => primitiveRoots i R - Finset.sum_card_eq_sum_biUnion_card 📋 Mathlib.Combinatorics.Enumerative.DoubleCounting
{α : Type u_2} {β : Type u_3} [Fintype α] [DecidableEq α] [DecidableEq β] (B : α → Finset β) (s : Finset α) : ∑ j ∈ s, (B j).card = ∑ x ∈ s.biUnion B, {j | j ∈ s ∧ x ∈ B j}.card - Finset.exists_mem_exists_mem_inf'_card_lt 📋 Mathlib.Combinatorics.Pigeonhole
{α : Type u} {β : Type v} [DecidableEq β] {s : Finset α} [DecidableEq α] [Fintype α] {f : α → Finset β} (h₁ : s.Nonempty) (h₂ : ∀ j ∈ s, 0 < (f j).card) (h₃ : (s.biUnion f).card < s.card) : ∃ a ∈ s, ∃ x ∈ f a, (s.inf' h₁ fun j => (f j).card) < {j | j ∈ s ∧ x ∈ f j}.card - Finpartition.biUnion_parts 📋 Mathlib.Order.Partition.Finpartition
{α : Type u_1} [DecidableEq α] {s : Finset α} (P : Finpartition s) : P.parts.biUnion id = s - Finpartition.combine_parts 📋 Mathlib.Order.Partition.Finpartition
{α : Type u_1} [Lattice α] [OrderBot α] [IsModularLattice α] [DecidableEq α] {ι : Type u_2} {I : Finset ι} {a : ι → α} (P : (i : ι) → Finpartition (a i)) (ha : I.SupIndep a) : (Finpartition.combine P ha).parts = I.biUnion fun i => (P i).parts - Finpartition.biUnion_filter_atomise 📋 Mathlib.Order.Partition.Finpartition
{α : Type u_1} [DecidableEq α] {s t : Finset α} {F : Finset (Finset α)} (ht : t ∈ F) (hts : t ⊆ s) : {u ∈ (Finpartition.atomise s F).parts | u ⊆ t ∧ u.Nonempty}.biUnion id = t - Finpartition.bind_parts 📋 Mathlib.Order.Partition.Finpartition
{α : Type u_1} [Lattice α] [OrderBot α] [IsModularLattice α] [DecidableEq α] {a : α} (P : Finpartition a) (Q : (i : α) → i ∈ P.parts → Finpartition i) : (P.bind Q).parts = P.parts.attach.biUnion fun i => (Q ↑i ⋯).parts - Finpartition.card_parts_equitabilise_subset_le 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Equitabilise
{α : Type u_1} [DecidableEq α] {s t : Finset α} {m a b : ℕ} (P : Finpartition s) (h : a * m + b * (m + 1) = s.card) : t ∈ P.parts → (t \ {u ∈ (Finpartition.equitabilise h).parts | u ⊆ t}.biUnion id).card ≤ m - Finpartition.equitabilise_aux 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Equitabilise
{α : Type u_1} [DecidableEq α] {s : Finset α} {m a b : ℕ} {P : Finpartition s} (hs : a * m + b * (m + 1) = s.card) : ∃ Q, (∀ x ∈ Q.parts, x.card = m ∨ x.card = m + 1) ∧ (∀ x ∈ P.parts, (x \ {y ∈ Q.parts | y ⊆ x}.biUnion id).card ≤ m) ∧ {i ∈ Q.parts | i.card = m + 1}.card = b - SimpleGraph.interedges_biUnion_left 📋 Mathlib.Combinatorics.SimpleGraph.Density
{ι : Type u_2} {α : Type u_4} (G : SimpleGraph α) [DecidableRel G.Adj] [DecidableEq α] (s : Finset ι) (t : Finset α) (f : ι → Finset α) : G.interedges (s.biUnion f) t = s.biUnion fun a => G.interedges (f a) t - SimpleGraph.interedges_biUnion_right 📋 Mathlib.Combinatorics.SimpleGraph.Density
{ι : Type u_2} {α : Type u_4} (G : SimpleGraph α) [DecidableRel G.Adj] [DecidableEq α] (s : Finset α) (t : Finset ι) (f : ι → Finset α) : G.interedges s (t.biUnion f) = t.biUnion fun b => G.interedges s (f b) - Rel.interedges_biUnion_left 📋 Mathlib.Combinatorics.SimpleGraph.Density
{ι : Type u_2} {α : Type u_4} {β : Type u_5} (r : α → β → Prop) [(a : α) → DecidablePred (r a)] [DecidableEq α] [DecidableEq β] (s : Finset ι) (t : Finset β) (f : ι → Finset α) : Rel.interedges r (s.biUnion f) t = s.biUnion fun a => Rel.interedges r (f a) t - Rel.interedges_biUnion_right 📋 Mathlib.Combinatorics.SimpleGraph.Density
{ι : Type u_2} {α : Type u_4} {β : Type u_5} (r : α → β → Prop) [(a : α) → DecidablePred (r a)] [DecidableEq α] [DecidableEq β] (s : Finset α) (t : Finset ι) (f : ι → Finset β) : Rel.interedges r s (t.biUnion f) = t.biUnion fun b => Rel.interedges r s (f b) - Rel.interedges_eq_biUnion 📋 Mathlib.Combinatorics.SimpleGraph.Density
{α : Type u_4} {β : Type u_5} (r : α → β → Prop) [(a : α) → DecidablePred (r a)] {s : Finset α} {t : Finset β} [DecidableEq α] [DecidableEq β] : Rel.interedges r s t = s.biUnion fun x => Finset.map { toFun := fun x_1 => (x, x_1), inj' := ⋯ } ({y ∈ t | r x y}) - SimpleGraph.interedges_biUnion 📋 Mathlib.Combinatorics.SimpleGraph.Density
{ι : Type u_2} {κ : Type u_3} {α : Type u_4} (G : SimpleGraph α) [DecidableRel G.Adj] [DecidableEq α] (s : Finset ι) (t : Finset κ) (f : ι → Finset α) (g : κ → Finset α) : G.interedges (s.biUnion f) (t.biUnion g) = (s ×ˢ t).biUnion fun ab => G.interedges (f ab.1) (g ab.2) - Rel.interedges_biUnion 📋 Mathlib.Combinatorics.SimpleGraph.Density
{ι : Type u_2} {κ : Type u_3} {α : Type u_4} {β : Type u_5} (r : α → β → Prop) [(a : α) → DecidablePred (r a)] [DecidableEq α] [DecidableEq β] (s : Finset ι) (t : Finset κ) (f : ι → Finset α) (g : κ → Finset β) : Rel.interedges r (s.biUnion f) (t.biUnion g) = (s ×ˢ t).biUnion fun ab => Rel.interedges r (f ab.1) (g ab.2) - Finpartition.IsEquipartition.card_biUnion_offDiag_le' 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
{α : Type u_1} {𝕜 : Type u_2} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [DecidableEq α] {A : Finset α} {P : Finpartition A} (hP : P.IsEquipartition) : ↑(P.parts.biUnion Finset.offDiag).card ≤ ↑A.card * (↑A.card + ↑P.parts.card) / ↑P.parts.card - Finpartition.IsEquipartition.card_interedges_sparsePairs_le' 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
{α : Type u_1} {𝕜 : Type u_2} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [DecidableEq α] {A : Finset α} {P : Finpartition A} {G : SimpleGraph α} [DecidableRel G.Adj] {ε : 𝕜} (hP : P.IsEquipartition) (hε : 0 ≤ ε) : ↑((P.sparsePairs G ε).biUnion fun x => match x with | (U, V) => G.interedges U V).card ≤ ε * (↑A.card + ↑P.parts.card) ^ 2 - Finpartition.IsEquipartition.card_interedges_sparsePairs_le 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
{α : Type u_1} {𝕜 : Type u_2} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [DecidableEq α] {A : Finset α} {P : Finpartition A} {G : SimpleGraph α} [DecidableRel G.Adj] {ε : 𝕜} (hP : P.IsEquipartition) (hε : 0 ≤ ε) : ↑((P.sparsePairs G ε).biUnion fun x => match x with | (U, V) => G.interedges U V).card ≤ 4 * ε * ↑A.card ^ 2 - Finpartition.IsEquipartition.sum_nonUniforms_lt 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
{α : Type u_1} {𝕜 : Type u_2} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [DecidableEq α] {A : Finset α} {P : Finpartition A} {G : SimpleGraph α} [DecidableRel G.Adj] {ε : 𝕜} (hA : A.Nonempty) (hε : 0 < ε) (hP : P.IsEquipartition) (hG : P.IsUniform G ε) : ↑((P.nonUniforms G ε).biUnion fun x => match x with | (U, V) => U ×ˢ V).card < 4 * ε * ↑A.card ^ 2 - Finpartition.IsEquipartition.card_biUnion_offDiag_le 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
{α : Type u_1} {𝕜 : Type u_2} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [DecidableEq α] {A : Finset α} {P : Finpartition A} {ε : 𝕜} (hε : 0 < ε) (hP : P.IsEquipartition) (hP' : 4 / ε ≤ ↑P.parts.card) : ↑(P.parts.biUnion Finset.offDiag).card ≤ ε / 2 * ↑A.card ^ 2 - SimpleGraph.unreduced_edges_subset 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
{α : Type u_1} {𝕜 : Type u_2} [Field 𝕜] [LinearOrder 𝕜] [DecidableEq α] {A : Finset α} {P : Finpartition A} {G : SimpleGraph α} [DecidableRel G.Adj] {ε : 𝕜} : {x ∈ A ×ˢ A | match x with | (x, y) => G.Adj x y ∧ ¬(SimpleGraph.regularityReduced P G (ε / 8) (ε / 4)).Adj x y} ⊆ ((P.nonUniforms G (ε / 8)).biUnion fun x => match x with | (U, V) => U ×ˢ V) ∪ P.parts.biUnion Finset.offDiag ∪ (P.sparsePairs G (ε / 4)).biUnion fun x => match x with | (U, V) => G.interedges U V - SzemerediRegularity.biUnion_star_subset_nonuniformWitness 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Chunk
{α : Type u_1} [Fintype α] [DecidableEq α] {P : Finpartition Finset.univ} (hP : P.IsEquipartition) (G : SimpleGraph α) [DecidableRel G.Adj] (ε : ℝ) {U : Finset α} (hU : U ∈ P.parts) (V : Finset α) : (SzemerediRegularity.star hP G ε hU V).biUnion id ⊆ G.nonuniformWitness ε U V - SzemerediRegularity.card_biUnion_star_le_m_add_one_card_star_mul 📋 Mathlib.Combinatorics.SimpleGraph.Regularity.Chunk
{α : Type u_1} [Fintype α] [DecidableEq α] {P : Finpartition Finset.univ} {hP : P.IsEquipartition} {G : SimpleGraph α} [DecidableRel G.Adj] {ε : ℝ} {U : Finset α} {hU : U ∈ P.parts} {V : Finset α} : ↑((SzemerediRegularity.star hP G ε hU V).biUnion id).card ≤ ↑(SzemerediRegularity.star hP G ε hU V).card * (↑(Fintype.card α / SzemerediRegularity.stepBound P.parts.card) + 1) - Finset.biUnion_slice 📋 Mathlib.Data.Finset.Slice
{α : Type u_1} (𝒜 : Finset (Finset α)) [Fintype α] [DecidableEq α] : (Finset.Iic (Fintype.card α)).biUnion 𝒜.slice = 𝒜 - BinaryTree.treesOfNumNodesEq_succ 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
(n : ℕ) : BinaryTree.treesOfNumNodesEq (n + 1) = (Finset.HasAntidiagonal.antidiagonal n).biUnion fun ij => BinaryTree.pairwiseNode (BinaryTree.treesOfNumNodesEq ij.1) (BinaryTree.treesOfNumNodesEq ij.2) - Finset.biUnion_image_sdiff_left 📋 Mathlib.Data.Finset.Sups
{α : Type u_2} [DecidableEq α] [GeneralizedBooleanAlgebra α] (s t : Finset α) : (s.biUnion fun a => Finset.image (fun x => a \ x) t) = s.diffs t - Finset.biUnion_image_sdiff_right 📋 Mathlib.Data.Finset.Sups
{α : Type u_2} [DecidableEq α] [GeneralizedBooleanAlgebra α] (s t : Finset α) : (t.biUnion fun b => Finset.image (fun x => x \ b) s) = s.diffs t - Finset.biUnion_image_inf_left 📋 Mathlib.Data.Finset.Sups
{α : Type u_2} [DecidableEq α] [SemilatticeInf α] (s t : Finset α) : (s.biUnion fun a => Finset.image (fun x => a ⊓ x) t) = s ⊼ t - Finset.biUnion_image_inf_right 📋 Mathlib.Data.Finset.Sups
{α : Type u_2} [DecidableEq α] [SemilatticeInf α] (s t : Finset α) : (t.biUnion fun b => Finset.image (fun x => x ⊓ b) s) = s ⊼ t - Finset.biUnion_image_sup_left 📋 Mathlib.Data.Finset.Sups
{α : Type u_2} [DecidableEq α] [SemilatticeSup α] (s t : Finset α) : (s.biUnion fun a => Finset.image (fun x => a ⊔ x) t) = s ⊻ t - Finset.biUnion_image_sup_right 📋 Mathlib.Data.Finset.Sups
{α : Type u_2} [DecidableEq α] [SemilatticeSup α] (s t : Finset α) : (t.biUnion fun b => Finset.image (fun x => x ⊔ b) s) = s ⊻ t - Finset.card_biUnion_le_of_intersecting 📋 Mathlib.Combinatorics.SetFamily.Kleitman
{ι : Type u_1} {α : Type u_2} [Fintype α] [DecidableEq α] [Nonempty α] (s : Finset ι) (f : ι → Finset (Finset α)) (hf : ∀ i ∈ s, (↑(f i)).Intersecting) : (s.biUnion f).card ≤ 2 ^ Fintype.card α - 2 ^ (Fintype.card α - s.card) - SimpleGraph.CompleteEquipartiteSubgraph.verts_eq_biUnion 📋 Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
{V : Type u_1} {G : SimpleGraph V} {r t : ℕ} (K : G.CompleteEquipartiteSubgraph r t) : K.verts = K.parts.biUnion id - Turing.PartrecToTM2.supports_biUnion 📋 Mathlib.Computability.TuringMachine.ToPartrec
{K : Option Turing.PartrecToTM2.Γ' → Finset Turing.PartrecToTM2.Λ'} {S : Finset Turing.PartrecToTM2.Λ'} : Turing.PartrecToTM2.Supports (Finset.univ.biUnion K) S ↔ ∀ (a : Option Turing.PartrecToTM2.Γ'), Turing.PartrecToTM2.Supports (K a) S - Equiv.Perm.Basis.ofPermHom_support 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (τ : ↥(Equiv.Perm.OnCycleFactors.range_toPermHom' g)) : (a.ofPermHom τ).support = (↑τ).support.biUnion fun c => (↑c).support - Nat.roughNumbersUpTo_eq_biUnion 📋 Mathlib.NumberTheory.SmoothNumbers
(N k : ℕ) : N.roughNumbersUpTo k = ((N + 1).primesBelow \ k.primesBelow).biUnion fun p => {m ∈ Finset.range (N + 1) | m ≠ 0 ∧ p ∣ m}
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