Loogle!
Result
Found 6678 declarations mentioning instOfNatNat, Nat, OfNat.ofNat, and Fin. Of these, 239 match your pattern(s). Of these, only the first 200 are shown.
- Fin.elim0 π Init.Data.Fin.Basic
{Ξ± : Sort u} : Fin 0 β Ξ± - Fin.subsingleton_zero π Init.Data.Fin.Lemmas
: Subsingleton (Fin 0) - Fin.forall_fin_zero π Init.Data.Fin.Lemmas
{p : Fin 0 β Prop} : (β (i : Fin 0), p i) β True - Fin.exists_fin_zero π Init.Data.Fin.Lemmas
{p : Fin 0 β Prop} : (β i, p i) β False - Fin.foldl_zero π Init.Data.Fin.Fold
{Ξ± : Sort u_1} (f : Ξ± β Fin 0 β Ξ±) (x : Ξ±) : Fin.foldl 0 f x = x - Fin.foldr_zero π Init.Data.Fin.Fold
{Ξ± : Sort u_1} (f : Fin 0 β Ξ± β Ξ±) (x : Ξ±) : Fin.foldr 0 f x = x - Fin.foldlM_zero π Init.Data.Fin.Fold
{m : Type u_1 β Type u_2} {Ξ± : Type u_1} [Monad m] (f : Ξ± β Fin 0 β m Ξ±) : Fin.foldlM 0 f = pure - Fin.foldrM_zero π Init.Data.Fin.Fold
{m : Type u_1 β Type u_2} {Ξ± : Type u_1} [Monad m] (f : Fin 0 β Ξ± β m Ξ±) : Fin.foldrM 0 f = pure - List.ofFn_zero π Init.Data.List.OfFn
{Ξ± : Type u_1} {f : Fin 0 β Ξ±} : List.ofFn f = [] - List.ofFnM_zero π Init.Data.List.OfFn
{m : Type u_1 β Type u_2} {Ξ± : Type u_1} [Monad m] [LawfulMonad m] {f : Fin 0 β m Ξ±} : List.ofFnM f = pure [] - List.finRange_zero π Init.Data.List.FinRange
: List.finRange 0 = [] - Array.ofFn_zero π Init.Data.Array.OfFn
{Ξ± : Type u_1} {f : Fin 0 β Ξ±} : Array.ofFn f = #[] - Array.ofFnM_zero π Init.Data.Array.OfFn
{m : Type u_1 β Type u_2} {Ξ± : Type u_1} [Monad m] {f : Fin 0 β m Ξ±} : Array.ofFnM f = pure #[] - Array.finRange_zero π Init.Data.Array.FinRange
: Array.finRange 0 = #[] - Vector.ofFnM_zero π Init.Data.Vector.OfFn
{m : Type u_1 β Type u_2} {Ξ± : Type u_1} [Monad m] {f : Fin 0 β m Ξ±} : Vector.ofFnM f = pure #v[] - Vector.finRange_zero π Init.Data.Vector.FinRange
: Vector.finRange 0 = #v[] - Vector.findFinIdx?_empty π Init.Data.Vector.Find
{Ξ± : Type u_1} {p : Ξ± β Bool} : Vector.findFinIdx? p #v[] = none - Fin.instLeast?OfNatNat π Init.Data.Range.Polymorphic.Fin
: Std.PRange.Least? (Fin 0) - Fin.instLawfulUpwardEnumerableLeast?OfNatNat π Init.Data.Range.Polymorphic.Fin
: Std.PRange.LawfulUpwardEnumerableLeast? (Fin 0) - Fin.least?_eq_of_zero π Init.Data.Range.Polymorphic.Fin
: Std.PRange.least? = none - Nat.ofBits_zero π Batteries.Data.Nat.Lemmas
(f : Fin 0 β Bool) : Nat.ofBits f = 0 - Int.ofBits_zero π Batteries.Data.Int
(f : Fin 0 β Bool) : Int.ofBits f = 0 - ByteArray.ofFn_zero π Batteries.Data.ByteArray
(f : Fin 0 β UInt8) : ByteArray.ofFn f = ByteArray.empty - Fin.dfoldl_zero π Batteries.Data.Fin.Fold
{Ξ± : Fin (0 + 1) β Type u_1} (f : (i : Fin 0) β Ξ± i.castSucc β Ξ± i.succ) (x : Ξ± 0) : Fin.dfoldl 0 Ξ± f x = x - Fin.dfoldr_zero π Batteries.Data.Fin.Fold
{Ξ± : Fin (0 + 1) β Type u_1} (f : (i : Fin 0) β Ξ± i.succ β Ξ± i.castSucc) (x : Ξ± (Fin.last 0)) : Fin.dfoldr 0 Ξ± f x = x - Fin.dfoldrM_zero π Batteries.Data.Fin.Fold
{m : Type u_1 β Type u_2} {Ξ± : Fin (0 + 1) β Type u_1} [Monad m] (f : (i : Fin 0) β Ξ± i.succ β m (Ξ± i.castSucc)) (x : Ξ± (Fin.last 0)) : Fin.dfoldrM 0 Ξ± f x = pure x - Fin.dfoldlM_zero π Batteries.Data.Fin.Fold
{m : Type u_1 β Type u_2} {Ξ± : Fin (0 + 1) β Type u_1} [Monad m] (f : (i : Fin 0) β Ξ± i.castSucc β m (Ξ± i.succ)) (x : Ξ± 0) : Fin.dfoldlM 0 Ξ± f x = pure x - Fin.countP_zero π Batteries.Data.Fin.Lemmas
(p : Fin 0 β Bool) : Fin.countP p = 0 - Fin.findSome?_zero π Batteries.Data.Fin.Lemmas
{Ξ± : Type u_1} {f : Fin 0 β Option Ξ±} : Fin.findSome? f = none - Fin.findSomeRev?_zero π Batteries.Data.Fin.Lemmas
{Ξ± : Type u_1} {f : Fin 0 β Option Ξ±} : Fin.findSomeRev? f = none - Fin.find?_zero π Batteries.Data.Fin.Lemmas
{p : Fin 0 β Bool} : Fin.find? p = none - Fin.findRev?_zero π Batteries.Data.Fin.Lemmas
{p : Fin 0 β Bool} : Fin.findRev? p = none - Fin.prod_zero π Batteries.Data.Fin.Lemmas
{Ξ± : Type u_1} [One Ξ±] [Mul Ξ±] (x : Fin 0 β Ξ±) : Fin.prod x = 1 - Fin.sum_zero π Batteries.Data.Fin.Lemmas
{Ξ± : Type u_1} [Zero Ξ±] [Add Ξ±] (x : Fin 0 β Ξ±) : Fin.sum x = 0 - Vector.finIdxOf?_empty π Batteries.Data.Vector.Lemmas
{Ξ± : Type u_1} {a : Ξ±} [BEq Ξ±] (v : Vector Ξ± 0) : v.finIdxOf? a = none - Fin.isEmpty π Mathlib.Logic.IsEmpty.Defs
: IsEmpty (Fin 0) - finZeroEquiv π Mathlib.Logic.Equiv.Defs
: Fin 0 β Empty - finZeroEquiv' π Mathlib.Logic.Equiv.Defs
: Fin 0 β PEmpty.{u} - Lean.Meta.instFastIsEmptyFinOfNatNat π Mathlib.Lean.Meta.CongrTheorems
: Lean.Meta.FastIsEmpty (Fin 0) - finZeroElim π Mathlib.Data.Fin.Basic
{Ξ± : Fin 0 β Sort u_1} (x : Fin 0) : Ξ± x - Fin.rec0 π Mathlib.Data.Fin.Basic
{Ξ± : Fin 0 β Sort u_1} (i : Fin 0) : Ξ± i - Fin.forall_fin_zero_pi π Mathlib.Data.Fin.Tuple.Basic
{Ξ± : Fin 0 β Sort u_1} {P : ((i : Fin 0) β Ξ± i) β Prop} : (β (x : (i : Fin 0) β Ξ± i), P x) β P finZeroElim - Fin.exists_fin_zero_pi π Mathlib.Data.Fin.Tuple.Basic
{Ξ± : Fin 0 β Sort u_1} {P : ((i : Fin 0) β Ξ± i) β Prop} : (β x, P x) β P finZeroElim - Fin.tuple0_le π Mathlib.Data.Fin.Tuple.Basic
{Ξ± : Fin 0 β Type u_1} [(i : Fin 0) β Preorder (Ξ± i)] (f g : (i : Fin 0) β Ξ± i) : f β€ g - Fin.repeat_zero π Mathlib.Data.Fin.Tuple.Basic
{n : β} {Ξ± : Sort u_1} (a : Fin n β Ξ±) : Fin.repeat 0 a = Fin.elim0 β Fin.cast β― - Fin.snoc_zero π Mathlib.Data.Fin.Tuple.Basic
{Ξ± : Sort u_2} (p : Fin 0 β Ξ±) (x : Ξ±) : Fin.snoc p x = fun x_1 => x - piFinTwoEquiv_symm_apply π Mathlib.Data.Fin.Tuple.Basic
(Ξ± : Fin 2 β Type u) : β(piFinTwoEquiv Ξ±).symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - Finsupp.linearCombination_fin_zero π Mathlib.LinearAlgebra.Finsupp.LinearCombination
{M : Type u_2} (R : Type u_5) [Semiring R] [AddCommMonoid M] [Module R M] (f : Fin 0 β M) : Finsupp.linearCombination R f = 0 - Matrix.vecEmpty π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} : Fin 0 β Ξ± - Matrix.empty_eq π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} (v : Fin 0 β Ξ±) : v = ![] - Matrix.empty_val' π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} {n' : Type u_1} (j : n') : (fun i => ![] i j) = ![] - Matrix.range_empty π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} (u : Fin 0 β Ξ±) : Set.range u = β - Matrix.cons_val_fin_one π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} (x : Ξ±) (u : Fin 0 β Ξ±) (i : Fin 1) : Matrix.vecCons x u i = x - Matrix.cons_fin_one π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} (x : Ξ±) (u : Fin 0 β Ξ±) : Matrix.vecCons x u = fun x_1 => x - Matrix.range_cons_empty π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} (x : Ξ±) (u : Fin 0 β Ξ±) : Set.range (Matrix.vecCons x u) = {x} - Matrix.empty_vecAlt0 π Mathlib.Data.Fin.VecNotation
(Ξ± : Type u_1) {h : 0 = 0 + 0} : Matrix.vecAlt0 h ![] = ![] - Matrix.empty_vecAlt1 π Mathlib.Data.Fin.VecNotation
(Ξ± : Type u_1) {h : 0 = 0 + 0} : Matrix.vecAlt1 h ![] = ![] - Matrix.range_cons_cons_empty π Mathlib.Data.Fin.VecNotation
{Ξ± : Type u} (x y : Ξ±) (u : Fin 0 β Ξ±) : Set.range (Matrix.vecCons x (Matrix.vecCons y u)) = {x, y} - Fin.preimage_apply_01_prod π Mathlib.Logic.Equiv.Fin.Basic
{Ξ± : Fin 2 β Type u} (s : Set (Ξ± 0)) (t : Set (Ξ± 1)) : (fun f => (f 0, f 1)) β»ΒΉ' s ΓΛ’ t = Set.univ.pi (Fin.cons s (Fin.cons t finZeroElim)) - prodEquivPiFinTwo_symm_apply π Mathlib.Logic.Equiv.Fin.Basic
(Ξ± Ξ² : Type u) : β(prodEquivPiFinTwo Ξ± Ξ²).symm = fun f => (f 0, f 1) - prodEquivPiFinTwo_apply π Mathlib.Logic.Equiv.Fin.Basic
(Ξ± Ξ² : Type u) : β(prodEquivPiFinTwo Ξ± Ξ²) = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - Fin.prod_univ_zero π Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [CommMonoid M] (f : Fin 0 β M) : β i, f i = 1 - Fin.sum_univ_zero π Mathlib.Algebra.BigOperators.Fin
{M : Type u_2} [AddCommMonoid M] (f : Fin 0 β M) : β i, f i = 0 - Matrix.neg_empty π Mathlib.Algebra.Group.Fin.Tuple
{Ξ± : Type u_1} [Neg Ξ±] (v : Fin 0 β Ξ±) : -v = ![] - Matrix.zero_empty π Mathlib.Algebra.Group.Fin.Tuple
{Ξ± : Type u_1} [Zero Ξ±] : 0 = ![] - Matrix.smul_empty π Mathlib.Algebra.Group.Fin.Tuple
{Ξ± : Type u_1} {M : Type u_2} [SMul M Ξ±] (x : M) (v : Fin 0 β Ξ±) : x β’ v = ![] - Matrix.empty_add_empty π Mathlib.Algebra.Group.Fin.Tuple
{Ξ± : Type u_1} [Add Ξ±] (v w : Fin 0 β Ξ±) : v + w = ![] - Matrix.empty_sub_empty π Mathlib.Algebra.Group.Fin.Tuple
{Ξ± : Type u_1} [Sub Ξ±] (v w : Fin 0 β Ξ±) : v - w = ![] - LinearMap.vecEmpty π Mathlib.LinearAlgebra.Pi
{R : Type u} {M : Type v} {Mβ : Type y} [Semiring R] [AddCommMonoid M] [AddCommMonoid Mβ] [Module R M] [Module R Mβ] : M ββ[R] Fin 0 β Mβ - LinearMap.vecEmpty_apply π Mathlib.LinearAlgebra.Pi
{R : Type u} {M : Type v} {Mβ : Type y} [Semiring R] [AddCommMonoid M] [AddCommMonoid Mβ] [Module R M] [Module R Mβ] (m : M) : LinearMap.vecEmpty m = ![] - LinearMap.vecEmptyβ π Mathlib.LinearAlgebra.Pi
{R : Type u} {M : Type v} {Mβ : Type w} {Mβ : Type y} [CommSemiring R] [AddCommMonoid M] [AddCommMonoid Mβ] [AddCommMonoid Mβ] [Module R M] [Module R Mβ] [Module R Mβ] : M ββ[R] Mβ ββ[R] Fin 0 β Mβ - LinearMap.vecEmptyβ_apply π Mathlib.LinearAlgebra.Pi
{R : Type u} {M : Type v} {Mβ : Type w} {Mβ : Type y} [CommSemiring R] [AddCommMonoid M] [AddCommMonoid Mβ] [AddCommMonoid Mβ] [Module R M] [Module R Mβ] [Module R Mβ] (xβ : M) : LinearMap.vecEmptyβ xβ = LinearMap.vecEmpty - LinearEquiv.piFinTwo_symm_apply π Mathlib.LinearAlgebra.Pi
(R : Type u) [Semiring R] (M : Fin 2 β Type v) [(i : Fin 2) β AddCommMonoid (M i)] [(i : Fin 2) β Module R (M i)] : β(LinearEquiv.piFinTwo R M).symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - finRotate_zero π Mathlib.Logic.Equiv.Fin.Rotate
: finRotate 0 = Equiv.refl (Fin 0) - Matrix.replicateCol_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {ΞΉ : Type u_1} (v : Fin 0 β Ξ±) : Matrix.replicateCol ΞΉ v = ![] - Matrix.empty_mulVec π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {n' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] [Fintype n'] (A : Matrix (Fin 0) n' Ξ±) (v : n' β Ξ±) : A.mulVec v = ![] - Matrix.vecMul_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {n' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] [Fintype n'] (v : n' β Ξ±) (B : Matrix n' (Fin 0) Ξ±) : Matrix.vecMul v B = ![] - Matrix.empty_vecMulVec π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {n' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] (v : Fin 0 β Ξ±) (w : n' β Ξ±) : Matrix.vecMulVec v w = ![] - Matrix.submatrix_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} {n' : Type uβ} {o' : Type uβ} (A : Matrix m' n' Ξ±) (row : Fin 0 β m') (col : o' β n') : A.submatrix row col = ![] - Matrix.dotProduct_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} [AddCommMonoid Ξ±] [Mul Ξ±] (v w : Fin 0 β Ξ±) : v β¬α΅₯ w = 0 - Matrix.empty_vecMul π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {o' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] (v : Fin 0 β Ξ±) (B : Matrix (Fin 0) o' Ξ±) : Matrix.vecMul v B = 0 - Matrix.mulVec_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] (A : Matrix m' (Fin 0) Ξ±) (v : Fin 0 β Ξ±) : A.mulVec v = 0 - Matrix.smul_mat_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} [NonUnitalNonAssocSemiring Ξ±] {m' : Type u_1} (x : Ξ±) (A : Fin 0 β m' β Ξ±) : x β’ A = ![] - Matrix.empty_mul_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} {o' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] (A : Matrix m' (Fin 0) Ξ±) (B : Matrix (Fin 0) o' Ξ±) : A * B = 0 - Matrix.replicateRow_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {ΞΉ : Type u_1} : Matrix.replicateRow ΞΉ ![] = Matrix.of fun x => ![] - Matrix.transpose_empty_cols π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} (A : Matrix (Fin 0) m' Ξ±) : A.transpose = Matrix.of fun x => ![] - Matrix.transpose_empty_rows π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} (A : Matrix m' (Fin 0) Ξ±) : A.transpose = Matrix.of ![] - Matrix.vecMulVec_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] (v : m' β Ξ±) (w : Fin 0 β Ξ±) : Matrix.vecMulVec v w = Matrix.of fun x => ![] - Matrix.empty_mul π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {n' : Type uβ} {o' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] [Fintype n'] (A : Matrix (Fin 0) n' Ξ±) (B : Matrix n' o' Ξ±) : A * B = Matrix.of ![] - Matrix.mul_empty π Mathlib.LinearAlgebra.Matrix.Notation
{Ξ± : Type u} {m' : Type uβ} {n' : Type uβ} [NonUnitalNonAssocSemiring Ξ±] [Fintype n'] (A : Matrix m' n' Ξ±) (B : Matrix n' (Fin 0) Ξ±) : A * B = Matrix.of fun x => ![] - Submodule.basisOfPid_bot π Mathlib.LinearAlgebra.FreeModule.PID
{R : Type u_2} [CommRing R] {M : Type u_3} [AddCommGroup M] [Module R M] [IsPrincipalIdealRing R] [IsDomain R] {ΞΉ : Type u_4} [Finite ΞΉ] (b : Module.Basis ΞΉ R M) : Submodule.basisOfPid b β₯ = β¨0, Module.Basis.empty β₯β₯β© - MvPolynomial.isNoetherianRing_fin_0 π Mathlib.RingTheory.Polynomial.Basic
{R : Type u} [CommRing R] [IsNoetherianRing R] : IsNoetherianRing (MvPolynomial (Fin 0) R) - Homeomorph.piFinTwo_symm_apply π Mathlib.Topology.Homeomorph.Lemmas
(X : Fin 2 β Type u) [(i : Fin 2) β TopologicalSpace (X i)] : β(Homeomorph.piFinTwo X).symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - Finset.Nat.antidiagonalTuple_zero_succ π Mathlib.Data.Fin.Tuple.NatAntidiagonal
(n : β) : Finset.Nat.antidiagonalTuple 0 n.succ = β - List.Nat.antidiagonalTuple_zero_succ π Mathlib.Data.Fin.Tuple.NatAntidiagonal
(n : β) : List.Nat.antidiagonalTuple 0 (n + 1) = [] - List.Nat.antidiagonalTuple_zero_zero π Mathlib.Data.Fin.Tuple.NatAntidiagonal
: List.Nat.antidiagonalTuple 0 0 = [![]] - Multiset.Nat.antidiagonalTuple_zero_succ π Mathlib.Data.Fin.Tuple.NatAntidiagonal
(n : β) : Multiset.Nat.antidiagonalTuple 0 n.succ = 0 - Finset.Nat.antidiagonalTuple_zero_zero π Mathlib.Data.Fin.Tuple.NatAntidiagonal
: Finset.Nat.antidiagonalTuple 0 0 = {![]} - Multiset.Nat.antidiagonalTuple_zero_zero π Mathlib.Data.Fin.Tuple.NatAntidiagonal
: Multiset.Nat.antidiagonalTuple 0 0 = {![]} - Matrix.det_fin_zero π Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{R : Type v} [CommRing R] {A : Matrix (Fin 0) (Fin 0) R} : A.det = 1 - ContinuousLinearEquiv.piFinTwo_symm_apply π Mathlib.Topology.Algebra.Module.Equiv
(R : Type u_2) [Semiring R] (M : Fin 2 β Type u_4) [(i : Fin 2) β AddCommMonoid (M i)] [(i : Fin 2) β Module R (M i)] [(i : Fin 2) β TopologicalSpace (M i)] : β(ContinuousLinearEquiv.piFinTwo R M).symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - UniformEquiv.piFinTwo_symm_apply π Mathlib.Topology.UniformSpace.Equiv
(Ξ± : Fin 2 β Type u) [(i : Fin 2) β UniformSpace (Ξ± i)] : β(UniformEquiv.piFinTwo Ξ±).symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - Matrix.adjugate_fin_zero π Mathlib.LinearAlgebra.Matrix.Adjugate
{Ξ± : Type w} [CommRing Ξ±] (A : Matrix (Fin 0) (Fin 0) Ξ±) : A.adjugate = 0 - Matrix.trace_fin_zero π Mathlib.LinearAlgebra.Matrix.Trace
{R : Type u_6} [AddCommMonoid R] (A : Matrix (Fin 0) (Fin 0) R) : A.trace = 0 - ExteriorAlgebra.ΞΉMulti_zero_apply π Mathlib.LinearAlgebra.ExteriorAlgebra.Basic
{R : Type u1} [CommRing R] {M : Type u2} [AddCommGroup M] [Module R M] (v : Fin 0 β M) : (ExteriorAlgebra.ΞΉMulti R 0) v = 1 - ExteriorAlgebra.liftAlternating_one π Mathlib.LinearAlgebra.ExteriorAlgebra.OfAlternating
{R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (f : (i : β) β M [β^Fin i]ββ[R] N) : (ExteriorAlgebra.liftAlternating f) 1 = (f 0) 0 - ExteriorAlgebra.liftAlternating_algebraMap π Mathlib.LinearAlgebra.ExteriorAlgebra.OfAlternating
{R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [AddCommGroup N] [Module R M] [Module R N] (f : (i : β) β M [β^Fin i]ββ[R] N) (r : R) : (ExteriorAlgebra.liftAlternating f) ((algebraMap R (ExteriorAlgebra R M)) r) = r β’ (f 0) 0 - exteriorPower.zeroEquiv_ΞΉMulti π Mathlib.LinearAlgebra.ExteriorPower.Basic
{R : Type u} [CommRing R] {M : Type u_1} [AddCommGroup M] [Module R M] (f : Fin 0 β M) : (exteriorPower.zeroEquiv R M) ((exteriorPower.ΞΉMulti R 0) f) = 1 - exteriorPower.zeroEquiv_symm_apply π Mathlib.LinearAlgebra.ExteriorPower.Basic
(R : Type u) [CommRing R] (M : Type u_1) [AddCommGroup M] [Module R M] (a : R) : (exteriorPower.zeroEquiv R M).symm a = a β’ (exteriorPower.ΞΉMulti R 0) fun a => β―.elim - ModuleCat.exteriorPower.isoβ_hom_apply π Mathlib.Algebra.Category.ModuleCat.ExteriorPower
{R : Type u} [CommRing R] {M : ModuleCat R} (f : Fin 0 β βM) : (CategoryTheory.ConcreteCategory.hom (ModuleCat.exteriorPower.isoβ M).hom) (ModuleCat.exteriorPower.mk f) = 1 - CategoryTheory.IsSifted.nonempty_of_colim_preservesLimitsOfShapeFinZero π Mathlib.CategoryTheory.Limits.Sifted
(C : Type u) [CategoryTheory.SmallCategory C] [CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete (Fin 0)) CategoryTheory.Limits.colim] : Nonempty C - MeasurableEquiv.finTwoArrow_symm_apply π Mathlib.MeasureTheory.MeasurableSpace.Embedding
{Ξ± : Type u_1} [MeasurableSpace Ξ±] : βMeasurableEquiv.finTwoArrow.symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - MeasurableEquiv.piFinTwo_symm_apply π Mathlib.MeasureTheory.MeasurableSpace.Embedding
(Ξ± : Fin 2 β Type u_8) [(i : Fin 2) β MeasurableSpace (Ξ± i)] : β(MeasurableEquiv.piFinTwo Ξ±).symm = fun p => Fin.cons p.1 (Fin.cons p.2 finZeroElim) - IsometryEquiv.piFinTwo_symm_apply π Mathlib.Topology.MetricSpace.Isometry
(Ξ± : Fin 2 β Type u_3) [(i : Fin 2) β PseudoEMetricSpace (Ξ± i)] (p : Ξ± 0 Γ Ξ± 1) (i : Fin (1 + 1)) : (IsometryEquiv.piFinTwo Ξ±).symm p i = Fin.cons p.1 (Fin.cons p.2 finZeroElim) i - ContinuousMultilinearMap.norm_mkPiAlgebraFin_zero π Mathlib.Analysis.Normed.Module.Multilinear.Basic
{π : Type u} [NontriviallyNormedField π] {A : Type u_1} [SeminormedRing A] [NormedAlgebra π A] : βContinuousMultilinearMap.mkPiAlgebraFin π 0 Aβ = β1β - Orientation.volumeForm_zero_pos π Mathlib.Analysis.InnerProductSpace.Orientation
{E : Type u_1} [NormedAddCommGroup E] [InnerProductSpace β E] [_i : Fact (Module.finrank β E = 0)] : positiveOrientation.volumeForm = AlternatingMap.constLinearEquivOfIsEmpty 1 - Orientation.volumeForm_zero_neg π Mathlib.Analysis.InnerProductSpace.Orientation
{E : Type u_1} [NormedAddCommGroup E] [InnerProductSpace β E] [_i : Fact (Module.finrank β E = 0)] : (-positiveOrientation).volumeForm = -AlternatingMap.constLinearEquivOfIsEmpty 1 - Orientation.volumeForm_def π Mathlib.Analysis.InnerProductSpace.Orientation
{E : Type u_2} [NormedAddCommGroup E] [InnerProductSpace β E] {n : β} [_i : Fact (Module.finrank β E = n)] (o : Orientation β E (Fin n)) : o.volumeForm = Nat.casesAuxOn (motive := fun a => n = a β E [β^Fin n]ββ[β] β) n (fun h => Eq.ndrec (motive := fun {n} => [_i : Fact (Module.finrank β E = n)] β Orientation β E (Fin n) β E [β^Fin n]ββ[β] β) (fun [Fact (Module.finrank β E = 0)] o => have opos := AlternatingMap.constOfIsEmpty β E (Fin 0) 1; β―.by_cases (fun x => opos) fun x => -opos) β― o) (fun n_1 h => Eq.ndrec (motive := fun {n} => [_i : Fact (Module.finrank β E = n)] β Orientation β E (Fin n) β E [β^Fin n]ββ[β] β) (fun [Fact (Module.finrank β E = n_1 + 1)] o => (Orientation.finOrthonormalBasis β― β― o).toBasis.det) β― o) β― - Nat.finMulAntidiag_zero_left π Mathlib.Algebra.Order.Antidiag.Nat
{n : β} (hn : n β 1) : Nat.finMulAntidiag 0 n = β - Polynomial.ofFn_zero' π Mathlib.Algebra.Polynomial.OfFn
{R : Type u_1} [Semiring R] [DecidableEq R] (v : Fin 0 β R) : (Polynomial.ofFn 0) v = 0 - ContinuousMultilinearMap.curry0 π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun x => G) G') : G' - ContinuousMultilinearMap.uncurry0 π Mathlib.Analysis.Normed.Module.Multilinear.Curry
(π : Type u) (G : Type wG) {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (x : G') : ContinuousMultilinearMap π (fun i => G) G' - ContinuousMultilinearMap.uncurry0_norm π Mathlib.Analysis.Normed.Module.Multilinear.Curry
(π : Type u) (G : Type wG) {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (x : G') : βContinuousMultilinearMap.uncurry0 π G xβ = βxβ - ContinuousMultilinearMap.uncurry0_curry0 π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') : ContinuousMultilinearMap.uncurry0 π G f.curry0 = f - ContinuousMultilinearMap.uncurry0_apply π Mathlib.Analysis.Normed.Module.Multilinear.Curry
(π : Type u) {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (x : G') (m : Fin 0 β G) : (ContinuousMultilinearMap.uncurry0 π G x) m = x - ContinuousMultilinearMap.curry0_norm π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') : βf.curry0β = βfβ - ContinuousMultilinearMap.curry0_apply π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') : f.curry0 = f 0 - ContinuousMultilinearMap.apply_zero_uncurry0 π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') {x : Fin 0 β G} : ContinuousMultilinearMap.uncurry0 π G (f x) = f - ContinuousMultilinearMap.fin0_apply_norm π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') {x : Fin 0 β G} : βf xβ = βfβ - continuousMultilinearCurryFin0 π Mathlib.Analysis.Normed.Module.Multilinear.Curry
(π : Type u) (G : Type wG) (G' : Type wG') [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] : ContinuousMultilinearMap π (fun i => G) G' ββα΅’[π] G' - ContinuousMultilinearMap.fin0_apply_enorm π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') {x : Fin 0 β G} : βf xββ = βfββ - continuousMultilinearCurryFin0_apply π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') : (continuousMultilinearCurryFin0 π G G') f = f 0 - continuousMultilinearCurryFin0_symm_apply π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (x : G') : (continuousMultilinearCurryFin0 π G G').symm x = ContinuousMultilinearMap.uncurry0 π G x - continuousMultilinearCurryFin0_symm_apply_apply π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (x : G') (v : Fin 0 β G) : ((continuousMultilinearCurryFin0 π G G').symm x) v = x - continuousMultilinearCurryFin1_apply π Mathlib.Analysis.Normed.Module.Multilinear.Curry
{π : Type u} {G : Type wG} {G' : Type wG'} [NontriviallyNormedField π] [NormedAddCommGroup G] [NormedSpace π G] [NormedAddCommGroup G'] [NormedSpace π G'] (f : ContinuousMultilinearMap π (fun i => G) G') (x : G) : ((continuousMultilinearCurryFin1 π G G') f) x = f (Fin.snoc 0 x) - FormalMultilinearSeries.removeZero_coeff_zero π Mathlib.Analysis.Calculus.FormalMultilinearSeries
{π : Type u} {E : Type v} {F : Type w} [Semiring π] [AddCommMonoid E] [Module π E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousConstSMul π E] [AddCommMonoid F] [Module π F] [TopologicalSpace F] [ContinuousAdd F] [ContinuousConstSMul π F] (p : FormalMultilinearSeries π E F) : p.removeZero 0 = 0 - FormalMultilinearSeries.order_eq_zero_iff π Mathlib.Analysis.Calculus.FormalMultilinearSeries
{π : Type u} {E : Type v} {F : Type w} [Semiring π] [AddCommMonoid E] [Module π E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousConstSMul π E] [AddCommMonoid F] [Module π F] [TopologicalSpace F] [ContinuousAdd F] [ContinuousConstSMul π F] {p : FormalMultilinearSeries π E F} (hp : p β 0) : p.order = 0 β p 0 β 0 - FormalMultilinearSeries.order_eq_zero_iff' π Mathlib.Analysis.Calculus.FormalMultilinearSeries
{π : Type u} {E : Type v} {F : Type w} [Semiring π] [AddCommMonoid E] [Module π E] [TopologicalSpace E] [ContinuousAdd E] [ContinuousConstSMul π E] [AddCommMonoid F] [Module π F] [TopologicalSpace F] [ContinuousAdd F] [ContinuousConstSMul π F] {p : FormalMultilinearSeries π E F} : p.order = 0 β p = 0 β¨ p 0 β 0 - ContinuousLinearMap.fpowerSeries_apply_zero π Mathlib.Analysis.Calculus.FormalMultilinearSeries
{π : Type u} {E : Type v} {F : Type w} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] (f : E βL[π] F) (x : E) : f.fpowerSeries x 0 = ContinuousMultilinearMap.uncurry0 π E (f x) - constFormalMultilinearSeries_apply_zero π Mathlib.Analysis.Calculus.FormalMultilinearSeries
{π : Type u} {E : Type v} {F : Type w} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedAddCommGroup F] [NormedSpace π E] [NormedSpace π F] {c : F} : constFormalMultilinearSeries π E c 0 = ContinuousMultilinearMap.uncurry0 π E c - compContinuousLinearMap_zero π Mathlib.Analysis.Calculus.FormalMultilinearSeries
{π : Type u} {E : Type v} {F : Type w} {G : Type x} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] (p : FormalMultilinearSeries π F G) : p.compContinuousLinearMap 0 = constFormalMultilinearSeries π E ((p 0) 0) - HasFPowerSeriesAt.coeff_zero π Mathlib.Analysis.Analytic.Basic
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {pf : FormalMultilinearSeries π E F} {x : E} (hf : HasFPowerSeriesAt f pf x) (v : Fin 0 β E) : (pf 0) v = f x - HasFPowerSeriesOnBall.coeff_zero π Mathlib.Analysis.Analytic.Basic
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {pf : FormalMultilinearSeries π E F} {x : E} {r : ENNReal} (hf : HasFPowerSeriesOnBall f pf x r) (v : Fin 0 β E) : (pf 0) v = f x - HasFPowerSeriesWithinAt.coeff_zero π Mathlib.Analysis.Analytic.Basic
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {pf : FormalMultilinearSeries π E F} {s : Set E} {x : E} (hf : HasFPowerSeriesWithinAt f pf s x) (v : Fin 0 β E) : (pf 0) v = f x - HasFPowerSeriesWithinOnBall.coeff_zero π Mathlib.Analysis.Analytic.Basic
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {pf : FormalMultilinearSeries π E F} {s : Set E} {x : E} {r : ENNReal} (hf : HasFPowerSeriesWithinOnBall f pf s x r) (v : Fin 0 β E) : (pf 0) v = f x - ContinuousLinearMap.fpowerSeriesBilinear_apply_zero π Mathlib.Analysis.Analytic.Linear
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] {G : Type u_4} [NormedAddCommGroup G] [NormedSpace π G] (f : E βL[π] F βL[π] G) (x : E Γ F) : f.fpowerSeriesBilinear x 0 = ContinuousMultilinearMap.uncurry0 π (E Γ F) ((f x.1) x.2) - FormalMultilinearSeries.id_apply_zero π Mathlib.Analysis.Analytic.Composition
(π : Type u_1) (E : Type u_2) [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] (x : E) (v : Fin 0 β E) : (FormalMultilinearSeries.id π E x 0) v = x - FormalMultilinearSeries.comp_coeff_zero'' π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} [CommRing π] [AddCommGroup E] [AddCommGroup F] [Module π E] [Module π F] [TopologicalSpace E] [TopologicalSpace F] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] (q : FormalMultilinearSeries π E F) (p : FormalMultilinearSeries π E E) : q.comp p 0 = q 0 - FormalMultilinearSeries.comp_coeff_zero π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] [IsTopologicalAddGroup G] [ContinuousConstSMul π G] (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (v : Fin 0 β E) (v' : Fin 0 β F) : (q.comp p 0) v = (q 0) v' - FormalMultilinearSeries.comp_coeff_zero' π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] [IsTopologicalAddGroup G] [ContinuousConstSMul π G] (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (v : Fin 0 β E) : (q.comp p 0) v = (q 0) fun _i => 0 - FormalMultilinearSeries.id_comp π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (v0 : Fin 0 β E) : (FormalMultilinearSeries.id π F ((p 0) v0)).comp p = p - FormalMultilinearSeries.id_comp' π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (x : F) (v0 : Fin 0 β E) (h : x = (p 0) v0) : (FormalMultilinearSeries.id π F x).comp p = p - FormalMultilinearSeries.leftInv_coeff_zero π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) : p.leftInv i x 0 = ContinuousMultilinearMap.uncurry0 π F x - FormalMultilinearSeries.rightInv_coeff_zero π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) : p.rightInv i x 0 = ContinuousMultilinearMap.uncurry0 π F x - HasFPowerSeriesAt.tendsto_partialSum_prod_of_comp π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] {G : Type u_4} [NormedAddCommGroup G] [NormedSpace π G] {f : E β G} {q : FormalMultilinearSeries π F G} {p : FormalMultilinearSeries π E F} {x : E} (hf : HasFPowerSeriesAt f (q.comp p) x) (hq : 0 < q.radius) (hp : 0 < p.radius) : βαΆ (y : E) in nhds 0, Filter.Tendsto (fun a => q.partialSum a.1 (p.partialSum a.2 y - (p 0) fun x => 0)) Filter.atTop (nhds (f (x + y))) - FormalMultilinearSeries.comp_rightInv π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) (h : p 1 = (continuousMultilinearCurryFin1 π E F).symm βi) : p.comp (p.rightInv i x) = FormalMultilinearSeries.id π F ((p 0) 0) - iteratedFDerivWithin_zero_eq π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} : iteratedFDerivWithin π 0 f s = iteratedFDeriv π 0 f - norm_iteratedFDeriv_zero π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {x : E} : βiteratedFDeriv π 0 f xβ = βf xβ - norm_iteratedFDerivWithin_zero π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {x : E} : βiteratedFDerivWithin π 0 f s xβ = βf xβ - iteratedFDeriv_zero_apply π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {x : E} (m : Fin 0 β E) : (iteratedFDeriv π 0 f x) m = f x - iteratedFDerivWithin_zero_apply π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {x : E} (m : Fin 0 β E) : (iteratedFDerivWithin π 0 f s x) m = f x - dist_iteratedFDerivWithin_zero π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] (f : E β F) (s : Set E) (x : E) (g : E β F) (t : Set E) (y : E) : dist (iteratedFDerivWithin π 0 f s x) (iteratedFDerivWithin π 0 g t y) = dist (f x) (g y) - iteratedFDeriv_zero_eq_comp π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} : iteratedFDeriv π 0 f = β(continuousMultilinearCurryFin0 π E F).symm β f - iteratedFDerivWithin_zero_eq_comp π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} : iteratedFDerivWithin π 0 f s = β(continuousMultilinearCurryFin0 π E F).symm β f - HasFTaylorSeriesUpTo.zero_eq' π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {n : WithTop ββ} {p : E β FormalMultilinearSeries π E F} (h : HasFTaylorSeriesUpTo n f p) (x : E) : p x 0 = (continuousMultilinearCurryFin0 π E F).symm (f x) - HasFTaylorSeriesUpToOn.zero_eq' π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {n : WithTop ββ} {p : E β FormalMultilinearSeries π E F} (h : HasFTaylorSeriesUpToOn n f p s) {x : E} (hx : x β s) : p x 0 = (continuousMultilinearCurryFin0 π E F).symm (f x) - hasFTaylorSeriesUpTo_succ_nat_iff_right π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {f : E β F} {p : E β FormalMultilinearSeries π E F} {n : β} : HasFTaylorSeriesUpTo (β(n + 1)) f p β (β (x : E), (p x 0).curry0 = f x) β§ (β (x : E), HasFDerivAt (fun y => p y 0) (p x 1).curryLeft x) β§ HasFTaylorSeriesUpTo (βn) (fun x => (continuousMultilinearCurryFin1 π E F) (p x 1)) fun x => (p x).shift - hasFTaylorSeriesUpToOn_top_iff_right π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {N : WithTop ββ} {p : E β FormalMultilinearSeries π E F} (hN : ββ€ β€ N) : HasFTaylorSeriesUpToOn N f p s β (β x β s, (p x 0).curry0 = f x) β§ (β x β s, HasFDerivWithinAt (fun y => p y 0) (p x 1).curryLeft s x) β§ HasFTaylorSeriesUpToOn N (fun x => (continuousMultilinearCurryFin1 π E F) (p x 1)) (fun x => (p x).shift) s - hasFTaylorSeriesUpToOn_succ_iff_right π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {n : WithTop ββ} {p : E β FormalMultilinearSeries π E F} : HasFTaylorSeriesUpToOn (n + 1) f p s β (β x β s, (p x 0).curry0 = f x) β§ (β x β s, HasFDerivWithinAt (fun y => p y 0) (p x 1).curryLeft s x) β§ HasFTaylorSeriesUpToOn n (fun x => (continuousMultilinearCurryFin1 π E F) (p x 1)) (fun x => (p x).shift) s - hasFTaylorSeriesUpToOn_succ_nat_iff_right π Mathlib.Analysis.Calculus.ContDiff.FTaylorSeries
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {p : E β FormalMultilinearSeries π E F} {n : β} : HasFTaylorSeriesUpToOn (β(n + 1)) f p s β (β x β s, (p x 0).curry0 = f x) β§ (β x β s, HasFDerivWithinAt (fun y => p y 0) (p x 1).curryLeft s x) β§ HasFTaylorSeriesUpToOn (βn) (fun x => (continuousMultilinearCurryFin1 π E F) (p x 1)) (fun x => (p x).shift) s - HasFPowerSeriesOnBall.iteratedFDeriv_zero_apply_diag π Mathlib.Analysis.Calculus.FDeriv.Analytic
{π : Type u_1} [NontriviallyNormedField π] {E : Type u} [NormedAddCommGroup E] [NormedSpace π E] {F : Type v} [NormedAddCommGroup F] [NormedSpace π F] {p : FormalMultilinearSeries π E F} {f : E β F} {x : E} {r : ENNReal} (h : HasFPowerSeriesOnBall f p x r) : iteratedFDeriv π 0 f x = p 0 - HasFTaylorSeriesUpToOn.analyticOn π Mathlib.Analysis.Calculus.ContDiff.Defs
{π : Type u} [NontriviallyNormedField π] {E : Type uE} [NormedAddCommGroup E] [NormedSpace π E] {F : Type uF} [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {f : E β F} {p : E β FormalMultilinearSeries π E F} (hf : HasFTaylorSeriesUpToOn β€ f p s) (h : AnalyticOn π (fun x => p x 0) s) : AnalyticOn π f s - ContinuousAlternatingMap.alternatizeUncurryFin_constOfIsEmptyLIE_comp π Mathlib.Analysis.Normed.Module.Alternating.Uncurry.Fin
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] (f : E βL[π] F) : ContinuousAlternatingMap.alternatizeUncurryFin ((β(ContinuousAlternatingMap.constOfIsEmptyLIE π E F (Fin 0)).toContinuousLinearEquiv).comp f) = (ContinuousAlternatingMap.ofSubsingleton π E F 0) f - extDeriv_constOfIsEmpty π Mathlib.Analysis.Calculus.DifferentialForm.Basic
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] (f : E β F) (x : E) : extDeriv (fun x => ContinuousAlternatingMap.constOfIsEmpty π E (Fin 0) (f x)) x = (ContinuousAlternatingMap.ofSubsingleton π E F 0) (fderiv π f x) - extDerivWithin_constOfIsEmpty π Mathlib.Analysis.Calculus.DifferentialForm.Basic
{π : Type u_1} {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] {s : Set E} {x : E} (f : E β F) (hs : UniqueDiffWithinAt π s x) : extDerivWithin (fun x => ContinuousAlternatingMap.constOfIsEmpty π E (Fin 0) (f x)) s x = (ContinuousAlternatingMap.ofSubsingleton π E F 0) (fderivWithin π f s x) - LineDeriv.iteratedLineDerivOp_fin_zero π Mathlib.Analysis.Distribution.DerivNotation
{V : Type u_11} {E : Type u_12} [LineDeriv V E E] (m : Fin 0 β V) (f : E) : LineDeriv.iteratedLineDerivOp m f = f - ContDiffMapSupportedIn.structureMapLM_zero_injective π Mathlib.Analysis.Distribution.ContDiffMapSupportedIn
(π : Type u_1) {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace β E] [NormedAddCommGroup F] [NormedSpace β F] [NormedSpace π F] [SMulCommClass β π F] {n : ββ} {K : TopologicalSpace.Compacts E} : Function.Injective β(ContDiffMapSupportedIn.structureMapLM π n 0) - ContDiffMapSupportedIn.structureMapLM_zero_apply π Mathlib.Analysis.Distribution.ContDiffMapSupportedIn
(π : Type u_1) {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace β E] [NormedAddCommGroup F] [NormedSpace β F] [NormedSpace π F] [SMulCommClass β π F] {n : ββ} {K : TopologicalSpace.Compacts E} {f : ContDiffMapSupportedIn E F n K} {x : E} : ((ContDiffMapSupportedIn.structureMapLM π n 0) f) x = ContinuousMultilinearMap.uncurry0 β E (f x) - ContDiffMapSupportedIn.structureMapCLM_zero_injective π Mathlib.Analysis.Distribution.ContDiffMapSupportedIn
(π : Type u_1) {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace β E] [NormedAddCommGroup F] [NormedSpace β F] [NormedSpace π F] [SMulCommClass β π F] {n : ββ} {K : TopologicalSpace.Compacts E} : Function.Injective β(ContDiffMapSupportedIn.structureMapCLM π n 0) - ContDiffMapSupportedIn.structureMapCLM_zero_apply π Mathlib.Analysis.Distribution.ContDiffMapSupportedIn
(π : Type u_1) {E : Type u_2} {F : Type u_3} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace β E] [NormedAddCommGroup F] [NormedSpace β F] [NormedSpace π F] [SMulCommClass β π F] {n : ββ} {K : TopologicalSpace.Compacts E} {f : ContDiffMapSupportedIn E F n K} {x : E} : ((ContDiffMapSupportedIn.structureMapCLM π n 0) f) x = ContinuousMultilinearMap.uncurry0 β E (f x) - Orientation.areaForm_def π Mathlib.Analysis.InnerProductSpace.TwoDim
{E : Type u_2} [NormedAddCommGroup E] [InnerProductSpace β E] [Fact (Module.finrank β E = 2)] (o : Orientation β E (Fin 2)) : o.areaForm = have z := AlternatingMap.constLinearEquivOfIsEmpty.symm; have y := (LinearMap.llcomp β E (E [β^Fin 0]ββ[β] β) β) βz ββ AlternatingMap.curryLeftLinearMap; y ββ AlternatingMap.curryLeftLinearMap o.volumeForm - Behrend.map_zero π Mathlib.Combinatorics.Additive.AP.Three.Behrend
(d : β) (a : Fin 0 β β) : (Behrend.map d) a = 0 - SimpleGraph.cycleGraph_zero_adj π Mathlib.Combinatorics.SimpleGraph.Circulant
{u v : Fin 0} : Β¬(SimpleGraph.cycleGraph 0).Adj u v - SimpleGraph.cycleGraph_zero_eq_bot π Mathlib.Combinatorics.SimpleGraph.Circulant
: SimpleGraph.cycleGraph 0 = β₯ - SimpleGraph.cycleGraph_zero_eq_top π Mathlib.Combinatorics.SimpleGraph.Circulant
: SimpleGraph.cycleGraph 0 = β€ - Function.fromTypes_zero_equiv π Mathlib.Logic.Function.FromTypes
(p : Fin 0 β Type u) (Ο : Type u) : Function.FromTypes p Ο β Ο - Function.fromTypes_zero π Mathlib.Logic.Function.FromTypes
(p : Fin 0 β Type u) (Ο : Type u) : Function.FromTypes p Ο = Ο - Function.FromTypes.const_zero π Mathlib.Logic.Function.FromTypes
(p : Fin 0 β Type u) {Ο : Type u} (t : Ο) : Function.FromTypes.const p t = t - Function.fromTypes_zero_equiv_apply π Mathlib.Logic.Function.FromTypes
(p : Fin 0 β Type u) (Ο : Type u) (a : Function.FromTypes p Ο) : (Function.fromTypes_zero_equiv p Ο) a = a - Function.fromTypes_zero_equiv_symm_apply π Mathlib.Logic.Function.FromTypes
(p : Fin 0 β Type u) (Ο : Type u) (a : Function.FromTypes p Ο) : (Function.fromTypes_zero_equiv p Ο).symm a = a - Fin.take_zero π Mathlib.Data.Fin.Tuple.Take
{n : β} {Ξ± : Fin n β Sort u_1} (v : (i : Fin n) β Ξ± i) : Fin.take 0 β― v = fun i => i.elim0 - FirstOrder.Language.funMap_eq_coe_constants π Mathlib.ModelTheory.Basic
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {c : L.Constants} {x : Fin 0 β M} : FirstOrder.Language.Structure.funMap c x = βc - FirstOrder.Language.withConstants_funMap_sumInr π Mathlib.ModelTheory.LanguageMap
(L : FirstOrder.Language) {M : Type w} [L.Structure M] (Ξ± : Type u_1) [(FirstOrder.Language.constantsOn Ξ±).Structure M] {a : Ξ±} {x : Fin 0 β M} : FirstOrder.Language.Structure.funMap (Sum.inr a) x = β(L.con a) - FirstOrder.Language.BoundedFormula.relabel_sumInl π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} {n : β} (Ο : L.BoundedFormula Ξ± n) : FirstOrder.Language.BoundedFormula.relabel Sum.inl Ο = FirstOrder.Language.BoundedFormula.castLE β― Ο - FirstOrder.Language.Formula.boundedFormula_realize_eq_realize π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} (Ο : L.Formula Ξ±) (x : Ξ± β M) (y : Fin 0 β M) : FirstOrder.Language.BoundedFormula.Realize Ο x y β Ο.Realize x - FirstOrder.Language.BoundedFormula.realize_iExs π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} {Ξ³ : Type u_3} [Finite Ξ³] {Ο : L.Formula (Ξ± β Ξ³)} {v : Ξ± β M} {v' : Fin 0 β M} : FirstOrder.Language.BoundedFormula.Realize (FirstOrder.Language.Formula.iExs Ξ³ Ο) v v' β β i, Ο.Realize (Sum.elim v i) - FirstOrder.Language.BoundedFormula.realize_iExsUnique π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} {Ξ³ : Type u_3} [Finite Ξ³] {Ο : L.Formula (Ξ± β Ξ³)} {v : Ξ± β M} {v' : Fin 0 β M} : FirstOrder.Language.BoundedFormula.Realize (FirstOrder.Language.Formula.iExsUnique Ξ³ Ο) v v' β β! i, Ο.Realize (Sum.elim v i) - FirstOrder.Language.BoundedFormula.realize_iAlls π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} {Ξ² : Type v'} [Finite Ξ²] {Ο : L.Formula (Ξ± β Ξ²)} {v : Ξ± β M} {v' : Fin 0 β M} : FirstOrder.Language.BoundedFormula.Realize (FirstOrder.Language.Formula.iAlls Ξ² Ο) v v' β β (i : Ξ² β M), Ο.Realize fun a => Sum.elim v i a - FirstOrder.Ring.CompatibleRing.funMap_one π Mathlib.ModelTheory.Algebra.Ring.Basic
{R : Type u_2} {instβ : Add R} {instβΒΉ : Mul R} {instβΒ² : Neg R} {instβΒ³ : One R} {instββ΄ : Zero R} [self : FirstOrder.Ring.CompatibleRing R] (x : Fin 0 β R) : FirstOrder.Language.Structure.funMap FirstOrder.Ring.oneFunc x = 1 - FirstOrder.Ring.CompatibleRing.funMap_zero π Mathlib.ModelTheory.Algebra.Ring.Basic
{R : Type u_2} {instβ : Add R} {instβΒΉ : Mul R} {instβΒ² : Neg R} {instβΒ³ : One R} {instββ΄ : Zero R} [self : FirstOrder.Ring.CompatibleRing R] (x : Fin 0 β R) : FirstOrder.Language.Structure.funMap FirstOrder.Ring.zeroFunc x = 0
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.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.
This is Loogle revision 128218b serving mathlib revision 4644b1d