Loogle!
Result
Found 182 declarations mentioning Compl.compl and Finset. Of these, 137 match your pattern(s).
- Finset.compl_empty 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] : ∅ᶜ = Finset.univ - Finset.compl_univ 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] : Finset.univᶜ = ∅ - Finset.compl_ne_univ_iff_nonempty 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : sᶜ ≠ Finset.univ ↔ s.Nonempty - Finset.compl_eq_univ_sdiff 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : sᶜ = Finset.univ \ s - Finset.union_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : s ∪ sᶜ = Finset.univ - Finset.compl_singleton 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (a : α) : {a}ᶜ = Finset.univ.erase a - Finset.inter_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : s ∩ sᶜ = ∅ - Finset.compl_eq_empty_iff 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : sᶜ = ∅ ↔ s = Finset.univ - Finset.compl_eq_univ_iff 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : sᶜ = Finset.univ ↔ s = ∅ - Finset.subset_compl_iff_disjoint_left 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s t : Finset α} [Fintype α] [DecidableEq α] : s ⊆ tᶜ ↔ Disjoint t s - Finset.subset_compl_iff_disjoint_right 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s t : Finset α} [Fintype α] [DecidableEq α] : s ⊆ tᶜ ↔ Disjoint s t - Finset.insert_compl_self 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (x : α) : insert x {x}ᶜ = Finset.univ - Finset.insert_inj_on' 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : Set.InjOn (fun a => insert a s) ↑sᶜ - Finset.sdiff_eq_inter_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s t : Finset α) : s \ t = s ∩ tᶜ - Finset.coe_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : ↑sᶜ = (↑s)ᶜ - Finset.compl_ssubset_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s t : Finset α} [Fintype α] [DecidableEq α] : sᶜ ⊂ tᶜ ↔ t ⊂ s - Finset.compl_subset_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s t : Finset α} [Fintype α] [DecidableEq α] : sᶜ ⊆ tᶜ ↔ t ⊆ s - Finset.mem_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] {a : α} : a ∈ sᶜ ↔ a ∉ s - Finset.notMem_compl 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] {a : α} : a ∉ sᶜ ↔ a ∈ s - Finset.subset_compl_comm 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s t : Finset α} [Fintype α] [DecidableEq α] : s ⊆ tᶜ ↔ t ⊆ sᶜ - Finset.compl_erase 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] {a : α} : (s.erase a)ᶜ = insert a sᶜ - Finset.compl_filter 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (p : α → Prop) [DecidablePred p] [(x : α) → Decidable ¬p x] : (Finset.filter p Finset.univ)ᶜ = {x | ¬p x} - Finset.compl_insert 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] {a : α} : (insert a s)ᶜ = sᶜ.erase a - Finset.subset_compl_singleton 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] {a : α} : s ⊆ {a}ᶜ ↔ a ∉ s - Finset.compl_inter 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s t : Finset α) : (s ∩ t)ᶜ = sᶜ ∪ tᶜ - Finset.compl_union 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} [Fintype α] [DecidableEq α] (s t : Finset α) : (s ∪ t)ᶜ = sᶜ ∩ tᶜ - Finset.insert_compl_insert 📋 Mathlib.Data.Finset.BooleanAlgebra
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] {a : α} (ha : a ∉ s) : insert a (insert a s)ᶜ = sᶜ - Set.toFinset_compl 📋 Mathlib.Data.Fintype.Sets
{α : Type u_1} (s : Set α) [DecidableEq α] [Fintype ↑s] [Fintype α] [Fintype ↑sᶜ] : sᶜ.toFinset = s.toFinsetᶜ - Fin.image_castSucc 📋 Mathlib.Data.Fintype.Basic
(n : ℕ) : Finset.image Fin.castSucc Finset.univ = {Fin.last n}ᶜ - Fin.image_succAbove_univ 📋 Mathlib.Data.Fintype.Basic
{n : ℕ} (i : Fin (n + 1)) : Finset.image i.succAbove Finset.univ = {i}ᶜ - Fin.image_succ_univ 📋 Mathlib.Data.Fintype.Basic
(n : ℕ) : Finset.image Fin.succ Finset.univ = {0}ᶜ - Finset.card_compl_lt_iff_nonempty 📋 Mathlib.Data.Fintype.Card
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) : sᶜ.card < Fintype.card α ↔ s.Nonempty - Finset.card_add_card_compl 📋 Mathlib.Data.Fintype.Card
{α : Type u_1} [DecidableEq α] [Fintype α] (s : Finset α) : s.card + sᶜ.card = Fintype.card α - Finset.card_compl 📋 Mathlib.Data.Fintype.Card
{α : Type u_1} [DecidableEq α] [Fintype α] (s : Finset α) : sᶜ.card = Fintype.card α - s.card - Finset.card_compl_add_card 📋 Mathlib.Data.Fintype.Card
{α : Type u_1} [DecidableEq α] [Fintype α] (s : Finset α) : sᶜ.card + s.card = Fintype.card α - Set.Finite.toFinset_compl 📋 Mathlib.Data.Set.Finite.Basic
{α : Type u} {s : Set α} [DecidableEq α] [Fintype α] (hs : s.Finite) (h : sᶜ.Finite) : h.toFinset = hs.toFinsetᶜ - Finset.preimage_compl' 📋 Mathlib.Data.Finset.Preimage
{α : Type u} {β : Type v} [DecidableEq α] [DecidableEq β] [Fintype α] [Fintype β] {f : α → β} (s : Finset β) (hfc : Set.InjOn f (f ⁻¹' ↑sᶜ)) (hf : Set.InjOn f (f ⁻¹' ↑s)) : sᶜ.preimage f hfc = (s.preimage f hf)ᶜ - Finset.preimage_compl 📋 Mathlib.Data.Finset.Preimage
{α : Type u} {β : Type v} [DecidableEq α] [DecidableEq β] [Fintype α] [Fintype β] {f : α → β} (s : Finset β) (hf : Function.Injective f) : sᶜ.preimage f ⋯ = (s.preimage f ⋯)ᶜ - Finset.Ioi_disjUnion_Iio 📋 Mathlib.Order.Interval.Finset.Basic
{α : Type u_2} [LinearOrder α] [Fintype α] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot α] (a : α) : (Finset.Ioi a).disjUnion (Finset.Iio a) ⋯ = {a}ᶜ - Finset.prod_compl_mul_prod 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {M : Type u_4} [CommMonoid M] [Fintype ι] [DecidableEq ι] (s : Finset ι) (f : ι → M) : (∏ i ∈ sᶜ, f i) * ∏ i ∈ s, f i = ∏ i, f i - Finset.prod_mul_prod_compl 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {M : Type u_4} [CommMonoid M] [Fintype ι] [DecidableEq ι] (s : Finset ι) (f : ι → M) : (∏ i ∈ s, f i) * ∏ i ∈ sᶜ, f i = ∏ i, f i - Finset.sum_add_sum_compl 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {M : Type u_4} [AddCommMonoid M] [Fintype ι] [DecidableEq ι] (s : Finset ι) (f : ι → M) : ∑ i ∈ s, f i + ∑ i ∈ sᶜ, f i = ∑ i, f i - Finset.sum_compl_add_sum 📋 Mathlib.Algebra.BigOperators.Group.Finset.Basic
{ι : Type u_1} {M : Type u_4} [AddCommMonoid M] [Fintype ι] [DecidableEq ι] (s : Finset ι) (f : ι → M) : ∑ i ∈ sᶜ, f i + ∑ i ∈ s, f i = ∑ i, f i - Finset.piecewise_compl 📋 Mathlib.Data.Finset.Piecewise
{ι : Type u_1} {π : ι → Sort u_2} [Fintype ι] [DecidableEq ι] (s : Finset ι) [(i : ι) → Decidable (i ∈ s)] [(i : ι) → Decidable (i ∈ sᶜ)] (f g : (i : ι) → π i) : sᶜ.piecewise f g = s.piecewise g f - Fintype.prod_eq_mul_prod_compl 📋 Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
{ι : Type u_1} {M : Type u_3} [CommMonoid M] [DecidableEq ι] [Fintype ι] (a : ι) (f : ι → M) : ∏ i, f i = f a * ∏ i ∈ {a}ᶜ, f i - Fintype.prod_eq_prod_compl_mul 📋 Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
{ι : Type u_1} {M : Type u_3} [CommMonoid M] [DecidableEq ι] [Fintype ι] (a : ι) (f : ι → M) : ∏ i, f i = (∏ i ∈ {a}ᶜ, f i) * f a - Fintype.sum_eq_add_sum_compl 📋 Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
{ι : Type u_1} {M : Type u_3} [AddCommMonoid M] [DecidableEq ι] [Fintype ι] (a : ι) (f : ι → M) : ∑ i, f i = f a + ∑ i ∈ {a}ᶜ, f i - Fintype.sum_eq_sum_compl_add 📋 Mathlib.Algebra.BigOperators.Group.Finset.Piecewise
{ι : Type u_1} {M : Type u_3} [AddCommMonoid M] [DecidableEq ι] [Fintype ι] (a : ι) (f : ι → M) : ∑ i, f i = ∑ i ∈ {a}ᶜ, f i + f a - Fintype.prod_add 📋 Mathlib.Algebra.BigOperators.Ring.Finset
{ι : Type u_5} {R : Type u_7} [Fintype ι] [CommSemiring R] [DecidableEq ι] (f g : ι → R) : ∏ a, (f a + g a) = ∑ t, (∏ a ∈ t, f a) * ∏ a ∈ tᶜ, g a - Fintype.linearIndependent_iffₒₛ 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] [LinearOrder R] [CanonicallyOrderedAdd R] [AddRightReflectLE R] [IsCancelAdd M] [DecidableEq ι] [Fintype ι] : LinearIndependent R v ↔ ∀ (t : Finset ι) (f : ι → R), ∑ i ∈ t, f i • v i = ∑ i ∈ tᶜ, f i • v i → ∀ (i : ι), f i = 0 - Fintype.not_linearIndependent_iffₒₛ 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] [LinearOrder R] [CanonicallyOrderedAdd R] [AddRightReflectLE R] [IsCancelAdd M] [DecidableEq ι] [Fintype ι] : ¬LinearIndependent R v ↔ ∃ t f, ∑ i ∈ t, f i • v i = ∑ i ∈ tᶜ, f i • v i ∧ ∃ i ∈ t, 0 < f i - Finset.prod_prod_Ioi_mul_eq_prod_prod_off_diag 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [CommMonoid M] [LinearOrder α] [Fintype α] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot α] (f : α → α → M) : ∏ i, ∏ j ∈ Finset.Ioi i, f j i * f i j = ∏ i, ∏ j ∈ {i}ᶜ, f j i - Finset.sum_sum_Ioi_add_eq_sum_sum_off_diag 📋 Mathlib.Algebra.Order.BigOperators.Group.LocallyFinite
{α : Type u_1} {M : Type u_2} [AddCommMonoid M] [LinearOrder α] [Fintype α] [LocallyFiniteOrderTop α] [LocallyFiniteOrderBot α] (f : α → α → M) : ∑ i, ∑ j ∈ Finset.Ioi i, (f j i + f i j) = ∑ i, ∑ j ∈ {i}ᶜ, f j i - Finset.orderEmbOfFin_compl_singleton_eq_succAboveOrderEmb 📋 Mathlib.Data.Finset.Sort
{n : ℕ} (i : Fin (n + 1)) : {i}ᶜ.orderEmbOfFin ⋯ = i.succAboveOrderEmb - Finset.orderEmbOfFin_compl_singleton 📋 Mathlib.Data.Finset.Sort
{n : ℕ} {i : Fin (n + 1)} {k : ℕ} (h : {i}ᶜ.card = k) : {i}ᶜ.orderEmbOfFin h = RelEmbedding.trans (Fin.castOrderIso ⋯).toOrderEmbedding i.succAboveOrderEmb - Finset.orderEmbOfFin_compl_singleton_apply 📋 Mathlib.Data.Finset.Sort
{n : ℕ} {i : Fin (n + 1)} {k : ℕ} (h : {i}ᶜ.card = k) (j : Fin k) : ({i}ᶜ.orderEmbOfFin h) j = i.succAbove (Fin.cast ⋯ j) - exists_sum_eq_one_iff_pairwise_coprime' 📋 Mathlib.RingTheory.Coprime.Lemmas
{R : Type u} {I : Type v} [CommSemiring R] {s : I → R} [Fintype I] [Nonempty I] [DecidableEq I] : (∃ μ, ∑ i, μ i * ∏ j ∈ {i}ᶜ, s j = 1) ↔ Pairwise (Function.onFun IsCoprime s) - Equiv.Perm.card_compl_support_modEq 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {p n : ℕ} [hp : Fact (Nat.Prime p)] {σ : Equiv.Perm α} (hσ : σ ^ p ^ n = 1) : σ.supportᶜ.card ≡ Fintype.card α [MOD p] - Matrix.adjp_apply 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] (s : ℤˣ) (A : Matrix n n R) (i j : n) : Matrix.adjp s A i j = ∑ σ ∈ Equiv.Perm.ofSign s with σ j = i, ∏ k ∈ {j}ᶜ, A k (σ k) - finSumEquivOfFinset 📋 Mathlib.Data.Fintype.Sort
{α : Type u_1} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α} (hm : s.card = m) (hn : sᶜ.card = n) : Fin m ⊕ Fin n ≃ α - finSumEquivOfFinset_inl 📋 Mathlib.Data.Fintype.Sort
{α : Type u_1} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α} (hm : s.card = m) (hn : sᶜ.card = n) (i : Fin m) : (finSumEquivOfFinset hm hn) (Sum.inl i) = (s.orderEmbOfFin hm) i - finSumEquivOfFinset_inr 📋 Mathlib.Data.Fintype.Sort
{α : Type u_1} [DecidableEq α] [Fintype α] [LinearOrder α] {m n : ℕ} {s : Finset α} (hm : s.card = m) (hn : sᶜ.card = n) (i : Fin n) : (finSumEquivOfFinset hm hn) (Sum.inr i) = (sᶜ.orderEmbOfFin hn) i - MultilinearMap.curryFinFinset 📋 Mathlib.LinearAlgebra.Multilinear.Curry
(R : Type uR) (M₂ : Type v₂) (M' : Type v') [CommSemiring R] [AddCommMonoid M'] [AddCommMonoid M₂] [Module R M'] [Module R M₂] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) : MultilinearMap R (fun x => M') M₂ ≃ₗ[R] MultilinearMap R (fun x => M') (MultilinearMap R (fun x => M') M₂) - MultilinearMap.curryFinFinset_apply_const 📋 Mathlib.LinearAlgebra.Multilinear.Curry
{R : Type uR} {M₂ : Type v₂} {M' : Type v'} [CommSemiring R] [AddCommMonoid M'] [AddCommMonoid M₂] [Module R M'] [Module R M₂] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : MultilinearMap R (fun x => M') M₂) (x y : M') : ((((MultilinearMap.curryFinFinset R M₂ M' hk hl) f) fun x_1 => x) fun x => y) = f (s.piecewise (fun x_1 => x) fun x => y) - MultilinearMap.curryFinFinset_apply 📋 Mathlib.LinearAlgebra.Multilinear.Curry
{R : Type uR} {M₂ : Type v₂} {M' : Type v'} [CommSemiring R] [AddCommMonoid M'] [AddCommMonoid M₂] [Module R M'] [Module R M₂] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : MultilinearMap R (fun x => M') M₂) (mk : Fin k → M') (ml : Fin l → M') : (((MultilinearMap.curryFinFinset R M₂ M' hk hl) f) mk) ml = f fun i => Sum.elim mk ml ((finSumEquivOfFinset hk hl).symm i) - MultilinearMap.curryFinFinset_symm_apply_const 📋 Mathlib.LinearAlgebra.Multilinear.Curry
{R : Type uR} {M₂ : Type v₂} {M' : Type v'} [CommSemiring R] [AddCommMonoid M'] [AddCommMonoid M₂] [Module R M'] [Module R M₂] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : MultilinearMap R (fun x => M') (MultilinearMap R (fun x => M') M₂)) (x : M') : (((MultilinearMap.curryFinFinset R M₂ M' hk hl).symm f) fun x_1 => x) = (f fun x_1 => x) fun x_1 => x - MultilinearMap.curryFinFinset_symm_apply_piecewise_const 📋 Mathlib.LinearAlgebra.Multilinear.Curry
{R : Type uR} {M₂ : Type v₂} {M' : Type v'} [CommSemiring R] [AddCommMonoid M'] [AddCommMonoid M₂] [Module R M'] [Module R M₂] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : MultilinearMap R (fun x => M') (MultilinearMap R (fun x => M') M₂)) (x y : M') : ((MultilinearMap.curryFinFinset R M₂ M' hk hl).symm f) (s.piecewise (fun x_1 => x) fun x => y) = (f fun x_1 => x) fun x => y - MultilinearMap.curryFinFinset_symm_apply 📋 Mathlib.LinearAlgebra.Multilinear.Curry
{R : Type uR} {M₂ : Type v₂} {M' : Type v'} [CommSemiring R] [AddCommMonoid M'] [AddCommMonoid M₂] [Module R M'] [Module R M₂] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : MultilinearMap R (fun x => M') (MultilinearMap R (fun x => M') M₂)) (m : Fin n → M') : ((MultilinearMap.curryFinFinset R M₂ M' hk hl).symm f) m = (f fun i => m ((finSumEquivOfFinset hk hl) (Sum.inl i))) fun i => m ((finSumEquivOfFinset hk hl) (Sum.inr i)) - Set.powersetCard.coe_compl 📋 Mathlib.Data.Set.PowersetCard
{α : Type u_1} {n : ℕ} [DecidableEq α] [Fintype α] {m : ℕ} {hm : m + n = Fintype.card α} {s : ↑(Set.powersetCard α n)} : ↑((Set.powersetCard.compl hm) s) = (↑s)ᶜ - Fin.succAboveOrderIso 📋 Mathlib.Order.Fin.SuccAboveOrderIso
{n : ℕ} (i : Fin (n + 2)) : Fin (n + 1) ≃o ↥{i}ᶜ - SSet.stdSimplex.faceSingletonComplIso 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.stdSimplex.obj (SimplexCategory.mk n) ≅ (SSet.stdSimplex.face {i}ᶜ).toSSet - SSet.stdSimplex.range_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.Subcomplex.range (SSet.stdSimplex.δ i) = SSet.stdSimplex.face {i}ᶜ - SSet.stdSimplex.finSuccAboveOrderIsoFinset 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : Fin (n + 1) ≃o ↥{i}ᶜ - SSet.stdSimplex.ofSimplex_yonedaEquiv_δ 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.Subcomplex.ofSimplex (SSet.yonedaEquiv (SSet.stdSimplex.δ i)) = SSet.stdSimplex.face {i}ᶜ - SSet.stdSimplex.face_singleton_compl 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : SSet.stdSimplex.face {i}ᶜ = SSet.Subcomplex.ofSimplex (SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ i)) - SSet.stdSimplex.faceSingletonComplIso_hom_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).hom (SSet.stdSimplex.face {i}ᶜ).ι = SSet.stdSimplex.δ i - SSet.stdSimplex.faceSingletonComplIso_hom_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.StdSimplex
{n : ℕ} (i : Fin (n + 2)) {Z : SSet} (h : SSet.stdSimplex.obj (SimplexCategory.mk (n + 1)) ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso i).hom (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {i}ᶜ).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ i) h - Finset.inclusion_exclusion_card_inf_compl 📋 Mathlib.Combinatorics.Enumerative.InclusionExclusion
{ι : Type u_1} {α : Type u_2} [DecidableEq α] [Fintype α] (s : Finset ι) (S : ι → Finset α) : ↑(s.inf fun i => (S i)ᶜ).card = ∑ t ∈ s.powerset, (-1) ^ t.card * ↑(t.inf S).card - Finset.inclusion_exclusion_sum_inf_compl 📋 Mathlib.Combinatorics.Enumerative.InclusionExclusion
{ι : Type u_1} {α : Type u_2} {G : Type u_3} [AddCommGroup G] [DecidableEq α] [Fintype α] (s : Finset ι) (S : ι → Finset α) (f : α → G) : ∑ a ∈ s.inf fun i => (S i)ᶜ, f a = ∑ t ∈ s.powerset, (-1) ^ t.card • ∑ a ∈ t.inf S, f a - SSet.boundary_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Boundary
(n : ℕ) : SSet.boundary n = ⨆ i, SSet.stdSimplex.face {i}ᶜ - SSet.horn.faceι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) : (SSet.stdSimplex.face {j}ᶜ).toSSet ⟶ (SSet.horn n i).toSSet - SSet.face_le_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (h : i ≠ j) : SSet.stdSimplex.face {i}ᶜ ≤ SSet.horn n j - SSet.horn.faceι_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) (SSet.horn n i).ι = (SSet.stdSimplex.face {j}ᶜ).ι - SSet.horn_eq_iSup 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
(n : ℕ) (i : Fin (n + 1)) : SSet.horn n i = ⨆ j, SSet.stdSimplex.face {↑j}ᶜ - SSet.horn.faceι_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 1)) (hij : j ≠ i) {Z : SSet} (h : SSet.stdSimplex.obj (SimplexCategory.mk n) ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) (CategoryTheory.CategoryStruct.comp (SSet.horn n i).ι h) = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.face {j}ᶜ).ι h - SSet.horn.faceSingletonComplIso_inv_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv (SSet.horn.ι i j hij) = SSet.horn.faceι i j hij - SSet.horn.faceSingletonComplIso_inv_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.Horn
{n : ℕ} (i j : Fin (n + 2)) (hij : j ≠ i) {Z : SSet} (h : (SSet.horn (n + 1) i).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso j).inv (CategoryTheory.CategoryStruct.comp (SSet.horn.ι i j hij) h) = CategoryTheory.CategoryStruct.comp (SSet.horn.faceι i j hij) h - SSet.horn.multicoequalizerDiagram 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} (i : Fin (n + 1)) : (SSet.horn n i).MulticoequalizerDiagram (fun j => SSet.stdSimplex.face {↑j}ᶜ) fun j k => SSet.stdSimplex.face {↑j, ↑k}ᶜ - SSet.horn₃₁.desc.multicofork 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : CategoryTheory.Limits.Multicofork ((CompleteLattice.MulticoequalizerDiagram.multispanIndex ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₂.desc.multicofork 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : CategoryTheory.Limits.Multicofork ((CompleteLattice.MulticoequalizerDiagram.multispanIndex ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt = X - SSet.horn₃₂.desc.multicofork_pt 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt = X - SSet.horn.isColimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{n : ℕ} (i : Fin (n + 1)) : CategoryTheory.Limits.IsColimit ((CompleteLattice.MulticoequalizerDiagram.multicofork ⋯).toLinearOrder.map SSet.Subcomplex.toSSetFunctor) - SSet.horn₃₁.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₁.desc.multicofork_π_two 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂ - SSet.horn₃₁.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₂.desc.multicofork_π_one 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁ - SSet.horn₃₂.desc.multicofork_π_three 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃ - SSet.horn₃₂.desc.multicofork_π_zero 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀ - SSet.horn₃₁.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨3, SSet.horn₃₁.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₁.desc.multicofork_π_two_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨2, SSet.horn₃₁.desc.multicofork_π_two._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 2).inv f₂) h - SSet.horn₃₁.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₂ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₁₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₂) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₂ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₃) {Z : SSet} (h : (SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₁.desc.multicofork f₀ f₂ f₃ h₁₂ h₁₃ h₂₃).π ⟨0, SSet.horn₃₁.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - SSet.horn₃₂.desc.multicofork_π_one_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨1, SSet.horn₃₂.desc.multicofork_π_one._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 1).inv f₁) h - SSet.horn₃₂.desc.multicofork_π_three_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨3, SSet.horn₃₂.desc.multicofork_π_three._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 3).inv f₃) h - SSet.horn₃₂.desc.multicofork_π_zero_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.HornColimits
{X : SSet} (f₀ f₁ f₃ : SSet.stdSimplex.obj (SimplexCategory.mk 2) ⟶ X) (h₀₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₁ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 1) f₃) (h₁₂ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 2) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₃) (h₂₃ : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₀ = CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.δ 0) f₁) {Z : SSet} (h : (SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).pt ⟶ Z) : CategoryTheory.CategoryStruct.comp ((SSet.horn₃₂.desc.multicofork f₀ f₁ f₃ h₀₂ h₁₂ h₂₃).π ⟨0, SSet.horn₃₂.desc.multicofork_π_zero._proof_1⟩) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.faceSingletonComplIso 0).inv f₀) h - ContinuousMultilinearMap.curryFinFinset 📋 Mathlib.Analysis.Normed.Module.Multilinear.Curry
(𝕜 : Type u) (G : Type wG) (G' : Type wG') [NontriviallyNormedField 𝕜] [NormedAddCommGroup G] [NormedSpace 𝕜 G] [NormedAddCommGroup G'] [NormedSpace 𝕜 G'] {k l n : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) : ContinuousMultilinearMap 𝕜 (fun i => G) G' ≃ₗᵢ[𝕜] ContinuousMultilinearMap 𝕜 (fun i => G) (ContinuousMultilinearMap 𝕜 (fun i => G) G') - ContinuousMultilinearMap.curryFinFinset_apply_const 📋 Mathlib.Analysis.Normed.Module.Multilinear.Curry
{𝕜 : Type u} {n : ℕ} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField 𝕜] [NormedAddCommGroup G] [NormedSpace 𝕜 G] [NormedAddCommGroup G'] [NormedSpace 𝕜 G'] {k l : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : ContinuousMultilinearMap 𝕜 (fun i => G) G') (x y : G) : ((((ContinuousMultilinearMap.curryFinFinset 𝕜 G G' hk hl) f) fun x_1 => x) fun x => y) = f (s.piecewise (fun x_1 => x) fun x => y) - ContinuousMultilinearMap.curryFinFinset_apply 📋 Mathlib.Analysis.Normed.Module.Multilinear.Curry
{𝕜 : Type u} {n : ℕ} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField 𝕜] [NormedAddCommGroup G] [NormedSpace 𝕜 G] [NormedAddCommGroup G'] [NormedSpace 𝕜 G'] {k l : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : ContinuousMultilinearMap 𝕜 (fun i => G) G') (mk : Fin k → G) (ml : Fin l → G) : (((ContinuousMultilinearMap.curryFinFinset 𝕜 G G' hk hl) f) mk) ml = f fun i => Sum.elim mk ml ((finSumEquivOfFinset hk hl).symm i) - ContinuousMultilinearMap.curryFinFinset_symm_apply_const 📋 Mathlib.Analysis.Normed.Module.Multilinear.Curry
{𝕜 : Type u} {n : ℕ} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField 𝕜] [NormedAddCommGroup G] [NormedSpace 𝕜 G] [NormedAddCommGroup G'] [NormedSpace 𝕜 G'] {k l : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : ContinuousMultilinearMap 𝕜 (fun i => G) (ContinuousMultilinearMap 𝕜 (fun i => G) G')) (x : G) : (((ContinuousMultilinearMap.curryFinFinset 𝕜 G G' hk hl).symm f) fun x_1 => x) = (f fun x_1 => x) fun x_1 => x - ContinuousMultilinearMap.curryFinFinset_symm_apply_piecewise_const 📋 Mathlib.Analysis.Normed.Module.Multilinear.Curry
{𝕜 : Type u} {n : ℕ} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField 𝕜] [NormedAddCommGroup G] [NormedSpace 𝕜 G] [NormedAddCommGroup G'] [NormedSpace 𝕜 G'] {k l : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : ContinuousMultilinearMap 𝕜 (fun i => G) (ContinuousMultilinearMap 𝕜 (fun i => G) G')) (x y : G) : ((ContinuousMultilinearMap.curryFinFinset 𝕜 G G' hk hl).symm f) (s.piecewise (fun x_1 => x) fun x => y) = (f fun x_1 => x) fun x => y - ContinuousMultilinearMap.curryFinFinset_symm_apply 📋 Mathlib.Analysis.Normed.Module.Multilinear.Curry
{𝕜 : Type u} {n : ℕ} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField 𝕜] [NormedAddCommGroup G] [NormedSpace 𝕜 G] [NormedAddCommGroup G'] [NormedSpace 𝕜 G'] {k l : ℕ} {s : Finset (Fin n)} (hk : s.card = k) (hl : sᶜ.card = l) (f : ContinuousMultilinearMap 𝕜 (fun i => G) (ContinuousMultilinearMap 𝕜 (fun i => G) G')) (m : Fin n → G) : ((ContinuousMultilinearMap.curryFinFinset 𝕜 G G' hk hl).symm f) m = (f fun i => m ((finSumEquivOfFinset hk hl) (Sum.inl i))) fun i => m ((finSumEquivOfFinset hk hl) (Sum.inr i)) - Affine.Simplex.faceOppositeCentroid_eq_affineCombination 📋 Mathlib.LinearAlgebra.AffineSpace.Simplex.Centroid
{k : Type u_1} {V : Type u_2} {P : Type u_3} [DivisionRing k] [AddCommGroup V] [Module k V] [AddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex k P n) (i : Fin (n + 1)) : s.faceOppositeCentroid i = (Finset.affineCombination k {i}ᶜ s.points) fun x => (↑n)⁻¹ - Finset.isCoatom_compl_singleton 📋 Mathlib.Data.Finset.Grade
{α : Type u_1} [Fintype α] [DecidableEq α] (a : α) : IsCoatom {a}ᶜ - Finset.isCoatom_iff 📋 Mathlib.Data.Finset.Grade
{α : Type u_1} {s : Finset α} [Fintype α] [DecidableEq α] : IsCoatom s ↔ ∃ a, s = {a}ᶜ - MeasureTheory.GridLines.T_lmarginal_antitone 📋 Mathlib.Analysis.FunctionalSpaces.SobolevInequality
{ι : Type u_1} {A : ι → Type u_2} [(i : ι) → MeasurableSpace (A i)] (μ : (i : ι) → MeasureTheory.Measure (A i)) [DecidableEq ι] {p : ℝ} [Fintype ι] [∀ (i : ι), MeasureTheory.SigmaFinite (μ i)] (hp₀ : 0 ≤ p) (hp : (↑(Fintype.card ι) - 1) * p ≤ 1) {f : ((i : ι) → A i) → ENNReal} (hf : Measurable f) : Antitone fun s => MeasureTheory.GridLines.T μ p (∫⋯∫⁻_sᶜ, f ∂μ) s - SimpleGraph.neighborFinset_compl 📋 Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} (G : SimpleGraph V) [Fintype V] [DecidableEq V] [DecidableRel G.Adj] (v : V) : Gᶜ.neighborFinset v = (G.neighborFinset v)ᶜ \ {v} - Numbering.prefixedEquiv 📋 Mathlib.Combinatorics.KatonaCircle
{X : Type u_1} [Fintype X] [DecidableEq X] (s : Finset X) : ↥(Numbering.prefixed s) ≃ Numbering ↥s × Numbering ↥sᶜ - SimpleGraph.neighborFinset_subset_between_union_compl 📋 Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} [DecidableEq V] [Fintype V] {s : Finset V} [DecidableRel G.Adj] (hw : w ∈ sᶜ) : G.neighborFinset w ⊆ (SimpleGraph.between (↑s) (↑s)ᶜ G).neighborFinset w ∪ sᶜ - SimpleGraph.degree_le_between_add_compl 📋 Mathlib.Combinatorics.SimpleGraph.Bipartite
{V : Type u_1} {w : V} {G : SimpleGraph V} [DecidableEq V] [Fintype V] {s : Finset V} [DecidableRel G.Adj] (hw : w ∈ sᶜ) : G.degree w ≤ (SimpleGraph.between (↑s) (↑s)ᶜ G).degree w + sᶜ.card - SimpleGraph.neighborFinset_completeEquipartiteGraph 📋 Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
{r t : ℕ} (v : Fin r × Fin t) : (SimpleGraph.completeEquipartiteGraph r t).neighborFinset v = {v.1}ᶜ ×ˢ Finset.univ - SimpleGraph.sdiff_compl_neighborFinset_inter_eq 📋 Mathlib.Combinatorics.SimpleGraph.StronglyRegular
{V : Type u} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] [DecidableEq V] {v w : V} (h : G.Adj v w) : ((G.neighborFinset v)ᶜ ∩ (G.neighborFinset w)ᶜ) \ ({w} ∪ {v}) = (G.neighborFinset v)ᶜ ∩ (G.neighborFinset w)ᶜ - SimpleGraph.compl_neighborFinset_sdiff_inter_eq 📋 Mathlib.Combinatorics.SimpleGraph.StronglyRegular
{V : Type u} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] [DecidableEq V] {v w : V} : (G.neighborFinset v)ᶜ \ {v} ∩ ((G.neighborFinset w)ᶜ \ {w}) = ((G.neighborFinset v)ᶜ ∩ (G.neighborFinset w)ᶜ) \ ({w} ∪ {v}) - Affine.Simplex.excenterExists_compl 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex ℝ P n) {signs : Finset (Fin (n + 1))} : s.ExcenterExists signsᶜ ↔ s.ExcenterExists signs - Affine.Simplex.excenter_compl 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex ℝ P n) (signs : Finset (Fin (n + 1))) : s.excenter signsᶜ = s.excenter signs - Affine.Simplex.exradius_compl 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex ℝ P n) (signs : Finset (Fin (n + 1))) : s.exradius signsᶜ = s.exradius signs - Affine.Simplex.exsphere_compl 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex ℝ P n) (signs : Finset (Fin (n + 1))) : s.exsphere signsᶜ = s.exsphere signs - Affine.Simplex.excenterWeights_compl 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex ℝ P n) (signs : Finset (Fin (n + 1))) : s.excenterWeights signsᶜ = s.excenterWeights signs - Affine.Simplex.excenterWeightsUnnorm_compl 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] (s : Affine.Simplex ℝ P n) (signs : Finset (Fin (n + 1))) : s.excenterWeightsUnnorm signsᶜ = -s.excenterWeightsUnnorm signs - Affine.Simplex.ExcenterExists.excenter_eq_excenter_iff 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] {s : Affine.Simplex ℝ P n} {signs₁ signs₂ : Finset (Fin (n + 1))} (h₁ : s.ExcenterExists signs₁) (h₂ : s.ExcenterExists signs₂) : s.excenter signs₁ = s.excenter signs₂ ↔ signs₁ = signs₂ ∨ signs₁ = signs₂ᶜ - Affine.Simplex.ExcenterExists.excenterWeights_eq_excenterWeights_iff 📋 Mathlib.Geometry.Euclidean.Incenter
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} [NeZero n] {s : Affine.Simplex ℝ P n} {signs₁ signs₂ : Finset (Fin (n + 1))} (h₁ : s.ExcenterExists signs₁) (h₂ : s.ExcenterExists signs₂) : s.excenterWeights signs₁ = s.excenterWeights signs₂ ↔ signs₁ = signs₂ ∨ signs₁ = signs₂ᶜ - Affine.Simplex.mongePointVSubFaceCentroidWeightsWithCircumcenter_eq_sub 📋 Mathlib.Geometry.Euclidean.MongePoint
{n : ℕ} {i₁ i₂ : Fin (n + 3)} (h : i₁ ≠ i₂) : Affine.Simplex.mongePointVSubFaceCentroidWeightsWithCircumcenter i₁ i₂ = Affine.Simplex.mongePointWeightsWithCircumcenter n - Affine.Simplex.centroidWeightsWithCircumcenter {i₁, i₂}ᶜ - Affine.Simplex.inner_mongePoint_vsub_face_centroid_vsub 📋 Mathlib.Geometry.Euclidean.MongePoint
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} (s : Affine.Simplex ℝ P (n + 2)) {i₁ i₂ : Fin (n + 3)} : inner ℝ (s.mongePoint -ᵥ Finset.centroid ℝ {i₁, i₂}ᶜ s.points) (s.points i₁ -ᵥ s.points i₂) = 0 - Affine.Simplex.mongePoint_vsub_face_centroid_eq_weightedVSub_of_pointsWithCircumcenter 📋 Mathlib.Geometry.Euclidean.MongePoint
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} (s : Affine.Simplex ℝ P (n + 2)) {i₁ i₂ : Fin (n + 3)} (h : i₁ ≠ i₂) : s.mongePoint -ᵥ Finset.centroid ℝ {i₁, i₂}ᶜ s.points = (Finset.univ.weightedVSub s.pointsWithCircumcenter) (Affine.Simplex.mongePointVSubFaceCentroidWeightsWithCircumcenter i₁ i₂) - Affine.Simplex.mongePlane_def 📋 Mathlib.Geometry.Euclidean.MongePoint
{V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] {n : ℕ} (s : Affine.Simplex ℝ P (n + 2)) (i₁ i₂ : Fin (n + 3)) : s.mongePlane i₁ i₂ = AffineSubspace.mk' (Finset.centroid ℝ {i₁, i₂}ᶜ s.points) (ℝ ∙ (s.points i₁ -ᵥ s.points i₂))ᗮ ⊓ affineSpan ℝ (Set.range s.points) - Set.powersetCard.coe_mulActionHom_compl 📋 Mathlib.GroupTheory.GroupAction.SubMulAction.Combination
(G : Type u_1) [Group G] (α : Type u_2) [MulAction G α] {n : ℕ} [DecidableEq α] [Fintype α] {m : ℕ} {hm : m + n = Fintype.card α} {s : ↑(Set.powersetCard α n)} : ↑((Set.powersetCard.mulActionHom_compl G α hm) s) = (↑s)ᶜ - NumberField.InfinitePlace.card_isUnramified_compl 📋 Mathlib.NumberTheory.NumberField.InfinitePlace.Ramification
(k : Type u_1) [Field k] (K : Type u_2) [Field K] [Algebra k K] [NumberField K] [NumberField k] [IsGalois k K] : {w | NumberField.InfinitePlace.IsUnramified k w}ᶜ.card = {w | NumberField.InfinitePlace.IsUnramifiedIn K w}ᶜ.card * (Module.finrank k K / 2) - NumberField.InfinitePlace.card_eq_card_isUnramifiedIn 📋 Mathlib.NumberTheory.NumberField.InfinitePlace.Ramification
(k : Type u_1) [Field k] (K : Type u_2) [Field K] [Algebra k K] [NumberField K] [NumberField k] [IsGalois k K] : Fintype.card (NumberField.InfinitePlace K) = {w | NumberField.InfinitePlace.IsUnramifiedIn K w}.card * Module.finrank k K + {w | NumberField.InfinitePlace.IsUnramifiedIn K w}ᶜ.card * (Module.finrank k K / 2)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using (by default) Ctrl-K Ctrl-S. 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.
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.
This is Loogle revision 401c76f serving mathlib revision a3d2529