Loogle!

Result

Found 56 declarations mentioning List.Vector.cons.

• List.Vector.cons 📋 Mathlib.Data.Vector.Defs
  {α : Type u_1} {n : ℕ} : α → List.Vector α n → List.Vector α n.succ
• List.Vector.head_cons 📋 Mathlib.Data.Vector.Defs
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : (a ::ᵥ v).head = a
• List.Vector.toList_cons 📋 Mathlib.Data.Vector.Defs
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : (a ::ᵥ v).toList = a :: v.toList
• List.Vector.tail_cons 📋 Mathlib.Data.Vector.Defs
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : (a ::ᵥ v).tail = v
• List.Vector.map_cons 📋 Mathlib.Data.Vector.Defs
  {α : Type u_1} {β : Type u_2} {n : ℕ} (f : α → β) (a : α) (v : List.Vector α n) : List.Vector.map f (a ::ᵥ v) = f a ::ᵥ List.Vector.map f v
• List.Vector.cons_head_tail 📋 Mathlib.Data.Vector.Defs
  {α : Type u_1} {n : ℕ} (v : List.Vector α n.succ) : v.head ::ᵥ v.tail = v
• List.Vector.exists_eq_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (v : List.Vector α n.succ) : ∃ a as, v = a ::ᵥ as
• List.Vector.get_cons_succ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) (i : Fin n) : (a ::ᵥ v).get i.succ = v.get i
• List.Vector.get_cons_zero 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : (a ::ᵥ v).get 0 = a
• List.Vector.get_cons_nil 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {ix : Fin 1} (x : α) : (x ::ᵥ List.Vector.nil).get ix = x
• List.Vector.casesOn 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {m : ℕ} {motive : {n : ℕ} → List.Vector α n → Sort u_8} (v : List.Vector α m) (nil : motive List.Vector.nil) (cons : {n : ℕ} → (hd : α) → (tl : List.Vector α n) → motive (hd ::ᵥ tl)) : motive v
• List.Vector.inductionOn 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {C : {n : ℕ} → List.Vector α n → Sort u_6} {n : ℕ} (v : List.Vector α n) (nil : C List.Vector.nil) (cons : {n : ℕ} → {x : α} → {w : List.Vector α n} → C w → C (x ::ᵥ w)) : C v
• List.Vector.cons_val 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : ↑(a ::ᵥ v) = a :: ↑v
• List.Vector.replicate_succ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (val : α) : List.Vector.replicate (n + 1) val = val ::ᵥ List.Vector.replicate n val
• List.Vector.scanl_nil 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_6} (f : β → α → β) (b : β) : List.Vector.scanl f b List.Vector.nil = b ::ᵥ List.Vector.nil
• List.Vector.map₂_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {n : ℕ} (hd₁ : α) (tl₁ : List.Vector α n) (hd₂ : β) (tl₂ : List.Vector β n) (f : α → β → γ) : List.Vector.map₂ f (hd₁ ::ᵥ tl₁) (hd₂ ::ᵥ tl₂) = f hd₁ hd₂ ::ᵥ List.Vector.map₂ f tl₁ tl₂
• List.Vector.casesOn₂ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {m : ℕ} {β : Type u_6} {motive : {n : ℕ} → List.Vector α n → List.Vector β n → Sort u_8} (v₁ : List.Vector α m) (v₂ : List.Vector β m) (nil : motive List.Vector.nil List.Vector.nil) (cons : {n : ℕ} → (x : α) → (y : β) → (xs : List.Vector α n) → (ys : List.Vector β n) → motive (x ::ᵥ xs) (y ::ᵥ ys)) : motive v₁ v₂
• List.Vector.eq_cons_iff 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n.succ) (v' : List.Vector α n) : v = a ::ᵥ v' ↔ v.head = a ∧ v.tail = v'
• List.Vector.ne_cons_iff 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n.succ) (v' : List.Vector α n) : v ≠ a ::ᵥ v' ↔ v.head ≠ a ∨ v.tail ≠ v'
• List.Vector.inductionOn₂ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} {β : Type u_6} {C : {n : ℕ} → List.Vector α n → List.Vector β n → Sort u_8} (v : List.Vector α n) (w : List.Vector β n) (nil : C List.Vector.nil List.Vector.nil) (cons : {n : ℕ} → {a : α} → {b : β} → {x : List.Vector α n} → {y : List.Vector β n} → C x y → C (a ::ᵥ x) (b ::ᵥ y)) : C v w
• List.Vector.scanl_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} {β : Type u_6} (f : β → α → β) (b : β) (v : List.Vector α n) (x : α) : List.Vector.scanl f b (x ::ᵥ v) = b ::ᵥ List.Vector.scanl f (f b x) v
• List.Vector.inductionOn_nil 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {C : {n : ℕ} → List.Vector α n → Sort u_6} (nil : C List.Vector.nil) (cons : {n : ℕ} → {x : α} → {w : List.Vector α n} → C w → C (x ::ᵥ w)) : (List.Vector.nil.inductionOn nil fun {n} {x} {w} => cons) = nil
• List.Vector.pmap_cons' 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_2} {n : ℕ} {p : α → Prop} (f : (a : α) → p a → β) (a : α) (v : List.Vector α n) (ha : p a) (hp : ∀ x ∈ v.toList, p x) : f a ha ::ᵥ List.Vector.pmap f v hp = List.Vector.pmap f (a ::ᵥ v) ⋯
• List.Vector.casesOn₃ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {m : ℕ} {β : Type u_6} {γ : Type u_7} {motive : {n : ℕ} → List.Vector α n → List.Vector β n → List.Vector γ n → Sort u_8} (v₁ : List.Vector α m) (v₂ : List.Vector β m) (v₃ : List.Vector γ m) (nil : motive List.Vector.nil List.Vector.nil List.Vector.nil) (cons : {n : ℕ} → (x : α) → (y : β) → (z : γ) → (xs : List.Vector α n) → (ys : List.Vector β n) → (zs : List.Vector γ n) → motive (x ::ᵥ xs) (y ::ᵥ ys) (z ::ᵥ zs)) : motive v₁ v₂ v₃
• List.Vector.scanl_singleton 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_6} (f : β → α → β) (b : β) (v : List.Vector α 1) : List.Vector.scanl f b v = b ::ᵥ f b v.head ::ᵥ List.Vector.nil
• List.Vector.traverse_def 📋 Mathlib.Data.Vector.Basic
  {n : ℕ} {F : Type u → Type u} [Applicative F] {α β : Type u} (f : α → F β) (x : α) (xs : List.Vector α n) : List.Vector.traverse f (x ::ᵥ xs) = List.Vector.cons <$> f x <*> List.Vector.traverse f xs
• List.Vector.pmap_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_2} {n : ℕ} {p : α → Prop} (f : (a : α) → p a → β) (a : α) (v : List.Vector α n) (hp : ∀ x ∈ (a ::ᵥ v).toList, p x) : List.Vector.pmap f (a ::ᵥ v) hp = f a ⋯ ::ᵥ List.Vector.pmap f v ⋯
• List.Vector.inductionOn₃ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {n : ℕ} {β : Type u_6} {γ : Type u_7} {C : {n : ℕ} → List.Vector α n → List.Vector β n → List.Vector γ n → Sort u_8} (u : List.Vector α n) (v : List.Vector β n) (w : List.Vector γ n) (nil : C List.Vector.nil List.Vector.nil List.Vector.nil) (cons : {n : ℕ} → {a : α} → {b : β} → {c : γ} → {x : List.Vector α n} → {y : List.Vector β n} → {z : List.Vector γ n} → C x y z → C (a ::ᵥ x) (b ::ᵥ y) (c ::ᵥ z)) : C u v w
• List.Vector.mapAccumr_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_2} {σ : Type u_4} {n : ℕ} {x : α} {s : σ} (xs : List.Vector α n) {f : α → σ → σ × β} : List.Vector.mapAccumr f (x ::ᵥ xs) s = have r := List.Vector.mapAccumr f xs s; have q := f x r.1; (q.1, q.2 ::ᵥ r.2)
• List.Vector.mmap_cons 📋 Mathlib.Data.Vector.Basic
  {m : Type u_6 → Type u_7} [Monad m] {α : Type u_8} {β : Type u_6} (f : α → m β) (a : α) {n : ℕ} (v : List.Vector α n) : List.Vector.mmap f (a ::ᵥ v) = do let h' ← f a let t' ← List.Vector.mmap f v pure (h' ::ᵥ t')
• List.Vector.get_append_cons_zero 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {m n : ℕ} {x : α} (xs : List.Vector α n) (ys : List.Vector α m) : (x ::ᵥ xs ++ ys).get 0 = x
• List.Vector.inductionOn_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {C : {n : ℕ} → List.Vector α n → Sort u_6} {n : ℕ} (x : α) (v : List.Vector α n) (nil : C List.Vector.nil) (cons : {n : ℕ} → {x : α} → {w : List.Vector α n} → C w → C (x ::ᵥ w)) : ((x ::ᵥ v).inductionOn nil fun {n} {x} {w} => cons) = cons (v.inductionOn nil fun {n} {x} {w} => cons)
• List.Vector.mapAccumr₂_cons 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {β : Type u_2} {σ : Type u_4} {φ : Type u_5} {n : ℕ} {x : α} {y : β} {s : σ} (xs : List.Vector α n) (ys : List.Vector β n) {f : α → β → σ → σ × φ} : List.Vector.mapAccumr₂ f (x ::ᵥ xs) (y ::ᵥ ys) s = have r := List.Vector.mapAccumr₂ f xs ys s; have q := f x y r.1; (q.1, q.2 ::ᵥ r.2)
• List.Vector.get_append_cons_succ 📋 Mathlib.Data.Vector.Basic
  {α : Type u_1} {m n : ℕ} {x : α} (xs : List.Vector α n) (ys : List.Vector α m) {i : Fin (n + m)} {h : ↑i + 1 < n.succ + m} : (x ::ᵥ xs ++ ys).get ⟨↑i + 1, h⟩ = (xs ++ ys).get i
• Sym.cons_of_coe_eq 📋 Mathlib.Data.Sym.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : a ::ₛ Sym.ofVector v = Sym.ofVector (a ::ᵥ v)
• Sym.ofVector_cons 📋 Mathlib.Data.Sym.Basic
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : Sym.ofVector (a ::ᵥ v) = a ::ₛ Sym.ofVector v
• Equiv.Perm.VectorsProdEqOne.one_eq 📋 Mathlib.GroupTheory.Perm.Cycle.Type
  (G : Type u_2) [Group G] : Equiv.Perm.vectorsProdEqOne G 1 = {1 ::ᵥ List.Vector.nil}
• Equiv.Perm.VectorsProdEqOne.vectorEquiv_apply_coe 📋 Mathlib.GroupTheory.Perm.Cycle.Type
  (G : Type u_2) [Group G] (n : ℕ) (v : List.Vector G n) : ↑((Equiv.Perm.VectorsProdEqOne.vectorEquiv G n) v) = v.toList.prod⁻¹ ::ᵥ v
• Primrec.vector_cons 📋 Mathlib.Computability.Primrec.List
  {α : Type u_1} [Primcodable α] {n : ℕ} : Primrec₂ List.Vector.cons
• Nat.Primrec'.cons 📋 Mathlib.Computability.Primrec.List
  {n m : ℕ} {f : List.Vector ℕ n → ℕ} {g : List.Vector ℕ n → List.Vector ℕ m} (hf : Nat.Primrec' f) (hg : Nat.Primrec'.Vec g) : Nat.Primrec'.Vec fun v => f v ::ᵥ g v
• Nat.Primrec'.prec' 📋 Mathlib.Computability.Primrec.List
  {n : ℕ} {f g : List.Vector ℕ n → ℕ} {h : List.Vector ℕ (n + 2) → ℕ} (hf : Nat.Primrec' f) (hg : Nat.Primrec' g) (hh : Nat.Primrec' h) : Nat.Primrec' fun v => Nat.rec (g v) (fun y IH => h (y ::ᵥ IH ::ᵥ v)) (f v)
• Nat.Primrec'.prec 📋 Mathlib.Computability.Primrec.List
  {n : ℕ} {f : List.Vector ℕ n → ℕ} {g : List.Vector ℕ (n + 2) → ℕ} : Nat.Primrec' f → Nat.Primrec' g → Nat.Primrec' fun v => Nat.rec (f v.tail) (fun y IH => g (y ::ᵥ IH ::ᵥ v.tail)) v.head
• Computable.vector_cons 📋 Mathlib.Computability.Partrec
  {α : Type u_1} [Primcodable α] {n : ℕ} : Computable₂ List.Vector.cons
• Nat.Partrec'.cons 📋 Mathlib.Computability.PartrecBasis
  {n m : ℕ} {f : List.Vector ℕ n → ℕ} {g : List.Vector ℕ n → List.Vector ℕ m} (hf : Nat.Partrec' ↑f) (hg : Nat.Partrec'.Vec g) : Nat.Partrec'.Vec fun v => f v ::ᵥ g v
• Nat.Partrec'.bind 📋 Mathlib.Computability.PartrecBasis
  {n : ℕ} {f : List.Vector ℕ n →. ℕ} {g : List.Vector ℕ (n + 1) →. ℕ} (hf : Nat.Partrec' f) (hg : Nat.Partrec' g) : Nat.Partrec' fun v => (f v).bind fun a => g (a ::ᵥ v)
• Nat.Partrec'.rfindOpt 📋 Mathlib.Computability.PartrecBasis
  {n : ℕ} {f : List.Vector ℕ (n + 1) → ℕ} (hf : Nat.Partrec' ↑f) : Nat.Partrec' fun v => Nat.rfindOpt fun a => Denumerable.ofNat (Option ℕ) (f (a ::ᵥ v))
• Nat.Partrec'.map 📋 Mathlib.Computability.PartrecBasis
  {n : ℕ} {f : List.Vector ℕ n →. ℕ} {g : List.Vector ℕ (n + 1) → ℕ} (hf : Nat.Partrec' f) (hg : Nat.Partrec' ↑g) : Nat.Partrec' fun v => Part.map (fun a => g (a ::ᵥ v)) (f v)
• Nat.Partrec'.rfind 📋 Mathlib.Computability.PartrecBasis
  {n : ℕ} {f : List.Vector ℕ (n + 1) → ℕ} : Nat.Partrec' ↑f → Nat.Partrec' fun v => Nat.rfind fun n_1 => Part.some (decide (f (n_1 ::ᵥ v) = 0))
• List.Vector.reverse_cons 📋 Mathlib.Data.Vector.Snoc
  {α : Type u_1} {n : ℕ} {x : α} (xs : List.Vector α n) : (x ::ᵥ xs).reverse = xs.reverse.snoc x
• List.Vector.snoc_nil 📋 Mathlib.Data.Vector.Snoc
  {α : Type u_1} {x : α} : List.Vector.nil.snoc x = x ::ᵥ List.Vector.nil
• List.Vector.reverse_snoc 📋 Mathlib.Data.Vector.Snoc
  {α : Type u_1} {n : ℕ} {x : α} (xs : List.Vector α n) : (xs.snoc x).reverse = x ::ᵥ xs.reverse
• List.Vector.snoc_cons 📋 Mathlib.Data.Vector.Snoc
  {α : Type u_1} {n : ℕ} {x : α} (xs : List.Vector α n) {y : α} : (x ::ᵥ xs).snoc y = x ::ᵥ xs.snoc y
• List.Vector.mem_cons_self 📋 Mathlib.Data.Vector.Mem
  {α : Type u_1} {n : ℕ} (a : α) (v : List.Vector α n) : a ∈ (a ::ᵥ v).toList
• List.Vector.mem_cons_of_mem 📋 Mathlib.Data.Vector.Mem
  {α : Type u_1} {n : ℕ} (a a' : α) (v : List.Vector α n) (ha' : a' ∈ v.toList) : a' ∈ (a ::ᵥ v).toList
• List.Vector.mem_cons_iff 📋 Mathlib.Data.Vector.Mem
  {α : Type u_1} {n : ℕ} (a a' : α) (v : List.Vector α n) : a' ∈ (a ::ᵥ v).toList ↔ a' = a ∨ a' ∈ v.toList
• List.Vector.tendsto_cons 📋 Mathlib.Topology.List
  {α : Type u_1} [TopologicalSpace α] {n : ℕ} {a : α} {l : List.Vector α n} : Filter.Tendsto (fun p => p.1 ::ᵥ p.2) (nhds a ×ˢ nhds l) (nhds (a ::ᵥ l))

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using the Loogle command from the command palette. You can also try the #loogle command from LeanSearchClient, the CLI version, the Loogle VS Code extension, the lean.nvim integration or the Zulip bot.

Usage

Loogle finds definitions and lemmas in various ways:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. 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 ?a

   If 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 ?b

4. By 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 find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

5. You can filter for definitions vs theorems: Using ⊢ (_ : Type _) finds all definitions which provide data while ⊢ (_ : Prop) finds all theorems (and definitions of proofs).

If you pass more than one such search filter, separated by commas Loogle will return lemmas which match all of them. The search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin and tsum, have "two" as a substring of the lemma name, include a product and a power somewhere in the type, and have a hypothesis of the form _ < _ (if there were any such lemmas). Metavariables (?a) are assigned independently in each filter.

The #lucky button will directly send you to the documentation of the first hit.

Source code

You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.

This is Loogle revision 9f11169 serving mathlib revision ce5dd8c