Loogle!

Result

Found 1044 declarations mentioning Function.Embedding. Of these, only the first 200 are shown.

• Function.Embedding 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) (β : Sort u_2) : Sort (max (max 1 u_1) u_2)
• Function.Embedding.refl 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) : α ↪ α
• Function.Embedding.punit 📋 Mathlib.Logic.Embedding.Basic
  {β : Sort u_1} (b : β) : PUnit.{u_2} ↪ β
• Function.Embedding.some 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} : α ↪ Option α
• Function.Embedding.inl 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} : α ↪ α ⊕ β
• Function.Embedding.inr 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} : β ↪ α ⊕ β
• Function.Embedding.instTrans 📋 Mathlib.Logic.Embedding.Basic
  : Trans Function.Embedding Function.Embedding Function.Embedding
• Function.Embedding.ofIsEmpty 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} [IsEmpty α] : α ↪ β
• Function.Embedding.toFun 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (self : α ↪ β) : α → β
• Equiv.toEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} (f : α ≃ β) : α ↪ β
• Function.instFunLikeEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} : FunLike (α ↪ β) α β
• Function.Embedding.instUniqueOfIsEmpty 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} [IsEmpty α] : Unique (α ↪ β)
• Function.Embedding.quotientOut 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) [s : Setoid α] : Quotient s ↪ α
• Function.Embedding.sectL 📋 Mathlib.Logic.Embedding.Basic
  (α : Type u_1) {β : Type u_2} (b : β) : α ↪ α × β
• Function.Embedding.sectR 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} (a : α) (β : Type u_2) : β ↪ α × β
• Function.Embedding.subtype 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} (p : α → Prop) : Subtype p ↪ α
• Equiv.coeEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} : Coe (α ≃ β) (α ↪ β)
• Function.Embedding.oneEmbeddingEquiv 📋 Mathlib.Logic.Embedding.Basic
  {one : Type u_1} {α : Type u_2} [Unique one] : (one ↪ α) ≃ α
• Function.Embedding.optionMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : Option α ↪ Option β
• Function.instEmbeddingLikeEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} : EmbeddingLike (α ↪ β) α β
• Function.Embedding.arrowCongrRight 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} {γ : Sort w} (e : α ↪ β) : (γ → α) ↪ γ → β
• Function.Embedding.mk 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (toFun : α → β) (inj' : Function.Injective toFun) : α ↪ β
• Function.Embedding.ofSurjective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : β → α) (hf : Function.Surjective f) : α ↪ β
• Equiv.asEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {β : Sort u_1} {α : Sort u_2} {p : β → Prop} (e : α ≃ Subtype p) : α ↪ β
• Equiv.refl_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} : (Equiv.refl α).toEmbedding = Function.Embedding.refl α
• Equiv.toEmbedding_injective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} : Function.Injective Equiv.toEmbedding
• Function.Embedding.inj' 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (self : α ↪ β) : Function.Injective self.toFun
• Function.Embedding.sigmaMk 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : α → Type u_3} (a : α) : β a ↪ (x : α) × β x
• Function.Embedding.trans 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} (f : α ↪ β) (g : β ↪ γ) : α ↪ γ
• Function.Embedding.arrowCongrLeft 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} {γ : Sort w} [Inhabited γ] (e : α ↪ β) : (α → γ) ↪ β → γ
• Function.Embedding.mk_id 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} : { toFun := id, inj' := ⋯ } = Function.Embedding.refl α
• Equiv.subtypeInjectiveEquivEmbedding 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) (β : Sort u_2) : { f // Function.Injective f } ≃ (α ↪ β)
• Function.Embedding.congr 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} {γ : Sort w} {δ : Sort x} (e₁ : α ≃ β) (e₂ : γ ≃ δ) (f : α ↪ γ) : β ↪ δ
• Equiv.embeddingCongr 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {δ : Sort u_4} (h : α ≃ β) (h' : γ ≃ δ) : (α ↪ γ) ≃ (β ↪ δ)
• Function.Embedding.pprodMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {δ : Sort u_4} (e₁ : α ↪ β) (e₂ : γ ↪ δ) : α ×' γ ↪ β ×' δ
• Function.Embedding.prodMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e₁ : α ↪ β) (e₂ : γ ↪ δ) : α × γ ↪ β × δ
• Function.Embedding.refl_trans 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : (Function.Embedding.refl α).trans f = f
• Function.Embedding.sumMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e₁ : α ↪ β) (e₂ : γ ↪ δ) : α ⊕ γ ↪ β ⊕ δ
• Function.Embedding.trans_refl 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : f.trans (Function.Embedding.refl β) = f
• Function.Embedding.coe_refl 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) : ⇑(Function.Embedding.refl α) = id
• Function.Embedding.piCongrRight 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : α → Sort u_2} {γ : α → Sort u_3} (e : (a : α) → β a ↪ γ a) : ((a : α) → β a) ↪ (a : α) → γ a
• Function.Embedding.refl_apply 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) (a : α) : (Function.Embedding.refl α) a = a
• Function.Embedding.injective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) : Function.Injective ⇑f
• Function.exists_surjective_iff 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} : (∃ f, Function.Surjective f) ↔ Nonempty (α → β) ∧ Nonempty (β ↪ α)
• Function.Embedding.arrowCongrLeft_refl 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {γ : Sort w} [Inhabited γ] : (Function.Embedding.refl α).arrowCongrLeft = Function.Embedding.refl (α → γ)
• Function.instCanLiftForallEmbeddingCoeInjective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} : CanLift (α → β) (α ↪ β) DFunLike.coe Function.Injective
• Subtype.impEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} (p q : α → Prop) (h : ∀ (x : α), p x → q x) : { x // p x } ↪ { x // q x }
• Function.Embedding.coe_injective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} : Function.Injective fun f => ⇑f
• Function.Embedding.equivOfSurjective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) (hf : Function.Surjective ⇑f) : α ≃ β
• Function.Embedding.some_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} : ⇑Function.Embedding.some = some
• Equiv.embeddingCongr_refl 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} : (Equiv.refl α).embeddingCongr (Equiv.refl β) = Equiv.refl (α ↪ β)
• Function.Embedding.toFun_eq_coe 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) : f.toFun = ⇑f
• Function.Embedding.equiv_symm_toEmbedding_trans_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (e : α ≃ β) : e.symm.toEmbedding.trans e.toEmbedding = Function.Embedding.refl β
• Function.Embedding.equiv_toEmbedding_trans_symm_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (e : α ≃ β) : e.toEmbedding.trans e.symm.toEmbedding = Function.Embedding.refl α
• Equiv.embeddingSurjectiveEquiv 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Type u_2} : { f // Function.Surjective ⇑f } ≃ (α ≃ β)
• Function.Embedding.coeFn_mk 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α → β) (i : Function.Injective f) : ⇑{ toFun := f, inj' := i } = f
• subtypeOrLeftEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} (p q : α → Prop) [DecidablePred p] : { x // p x ∨ q x } ↪ { x // p x } ⊕ { x // q x }
• Function.Embedding.subtype_injective 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} (p : α → Prop) : Function.Injective ⇑(Function.Embedding.subtype p)
• Function.Embedding.inl_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (val : α) : Function.Embedding.inl val = Sum.inl val
• Function.Embedding.inr_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (val : β) : Function.Embedding.inr val = Sum.inr val
• Function.Embedding.coe_quotientOut 📋 Mathlib.Logic.Embedding.Basic
  (α : Sort u_1) [Setoid α] : ⇑(Function.Embedding.quotientOut α) = Quotient.out
• Function.Embedding.coe_subtype 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} (p : α → Prop) : ⇑(Function.Embedding.subtype p) = Subtype.val
• Function.Embedding.setValue 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) (a : α) (b : β) [(a' : α) → Decidable (a' = a)] [(a' : α) → Decidable (f a' = b)] : α ↪ β
• Equiv.trans_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : α ≃ β) (f : β ≃ γ) : (e.trans f).toEmbedding = e.toEmbedding.trans f.toEmbedding
• Function.Embedding.sectL_apply 📋 Mathlib.Logic.Embedding.Basic
  (α : Type u_1) {β : Type u_2} (b : β) (a : α) : (Function.Embedding.sectL α b) a = (a, b)
• Function.Embedding.sectR_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} (a : α) (β : Type u_2) (b : β) : (Function.Embedding.sectR a β) b = (a, b)
• Function.Embedding.subtype_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {p : α → Prop} (x : Subtype p) : (Function.Embedding.subtype p) x = ↑x
• Function.Embedding.subtypeMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {p : α → Prop} {q : β → Prop} (f : α ↪ β) (h : ∀ ⦃x : α⦄, p x → q (f x)) : { x // p x } ↪ { y // q y }
• Function.Embedding.sigmaMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {α' : Type u_2} {β : α → Type u_3} {β' : α' → Type u_4} (f : α ↪ α') (g : (a : α) → β a ↪ β' (f a)) : (a : α) × β a ↪ (a' : α') × β' a'
• Function.Embedding.apply_eq_iff_eq 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) (x y : α) : f x = f y ↔ x = y
• Equiv.coe_toEmbedding 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} (f : α ≃ β) : ⇑f.toEmbedding = ⇑f
• Function.Embedding.mk_coe 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (inj : Function.Injective ⇑f) : { toFun := ⇑f, inj' := inj } = f
• Function.Embedding.trans_assoc 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (f : α ↪ β) (g : β ↪ γ) (h : γ ↪ δ) : (f.trans g).trans h = f.trans (g.trans h)
• Equiv.toEmbedding_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} (f : α ≃ β) (a : α) : f.toEmbedding a = f a
• Function.Embedding.ext 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {f g : α ↪ β} (h : ∀ (x : α), f x = g x) : f = g
• Function.Embedding.ext_iff 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {f g : α ↪ β} : f = g ↔ ∀ (x : α), f x = g x
• Equiv.embeddingCongr_symm 📋 Mathlib.Logic.Embedding.Basic
  {α₁ : Sort u_1} {β₁ : Sort u_2} {α₂ : Sort u_3} {β₂ : Sort u_4} (e₁ : α₁ ≃ α₂) (e₂ : β₁ ≃ β₂) : (e₁.embeddingCongr e₂).symm = e₁.symm.embeddingCongr e₂.symm
• Function.Embedding.optionMap_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : ⇑f.optionMap = Option.map ⇑f
• Function.Embedding.sigmaMk_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : α → Type u_3} (a : α) (snd : β a) : (Function.Embedding.sigmaMk a) snd = ⟨a, snd⟩
• Function.Embedding.trans_arrowCongrLeft 📋 Mathlib.Logic.Embedding.Basic
  {α₁ : Sort u} {α₂ : Sort v} {α₃ : Sort x} {γ : Sort w} [Inhabited γ] (e₁₂ : α₁ ↪ α₂) (e₂₃ : α₂ ↪ α₃) : e₁₂.arrowCongrLeft.trans e₂₃.arrowCongrLeft = (e₁₂.trans e₂₃).arrowCongrLeft
• Function.Embedding.arrowCongrRight_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} {γ : Sort w} (e : α ↪ β) (f : γ → α) : e.arrowCongrRight f = ⇑e ∘ f
• Function.Embedding.mk_trans_mk 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} (f : α → β) (g : β → γ) (hf : Function.Injective f) (hg : Function.Injective g) : { toFun := f, inj' := hf }.trans { toFun := g, inj' := hg } = { toFun := g ∘ f, inj' := ⋯ }
• Function.Embedding.setValue_eq 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) (a : α) (b : β) [(a' : α) → Decidable (a' = a)] [(a' : α) → Decidable (f a' = b)] : (f.setValue a b) a = b
• Function.Embedding.trans_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} (f : α ↪ β) (g : β ↪ γ) (a✝ : α) : (f.trans g) a✝ = g (f a✝)
• Function.Embedding.coe_trans 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} (f : α ↪ β) (g : β ↪ γ) : ⇑(f.trans g) = ⇑g ∘ ⇑f
• Function.Embedding.setValue_eq_iff 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) {a a' : α} {b : β} [(a' : α) → Decidable (a' = a)] [(a' : α) → Decidable (f a' = b)] : (f.setValue a b) a' = b ↔ a' = a
• Equiv.asEmbedding_apply 📋 Mathlib.Logic.Embedding.Basic
  {β : Sort u_1} {α : Sort u_2} {p : β → Prop} (e : α ≃ Subtype p) (a✝ : α) : e.asEmbedding a✝ = ↑(e a✝)
• Function.Embedding.arrowCongrLeft_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} {γ : Sort w} [Inhabited γ] (e : α ↪ β) (f : α → γ) : e.arrowCongrLeft f = Function.extend (⇑e) f default
• Equiv.embeddingCongr_trans 📋 Mathlib.Logic.Embedding.Basic
  {α₁ : Sort u_1} {β₁ : Sort u_2} {α₂ : Sort u_3} {β₂ : Sort u_4} {α₃ : Sort u_5} {β₃ : Sort u_6} (e₁ : α₁ ≃ α₂) (e₁' : β₁ ≃ β₂) (e₂ : α₂ ≃ α₃) (e₂' : β₂ ≃ β₃) : (e₁.trans e₂).embeddingCongr (e₁'.trans e₂') = (e₁.embeddingCongr e₁').trans (e₂.embeddingCongr e₂')
• Function.Embedding.piCongrRight_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : α → Sort u_2} {γ : α → Sort u_3} (e : (a : α) → β a ↪ γ a) (f : (a : α) → β a) (a : α) : (Function.Embedding.piCongrRight e) f a = (e a) (f a)
• Equiv.embeddingCongr_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {γ : Sort u_3} {δ : Sort u_4} (h : α ≃ β) (h' : γ ≃ δ) (f : α ↪ γ) : (h.embeddingCongr h') f = Function.Embedding.congr h h' f
• Subtype.impEmbedding_apply_coe 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} (p q : α → Prop) (h : ∀ (x : α), p x → q x) (x : { x // p x }) : ↑((Subtype.impEmbedding p q h) x) = ↑x
• Function.Embedding.coe_prodMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e₁ : α ↪ β) (e₂ : γ ↪ δ) : ⇑(e₁.prodMap e₂) = Prod.map ⇑e₁ ⇑e₂
• Function.Embedding.coe_sumMap 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e₁ : α ↪ β) (e₂ : γ ↪ δ) : ⇑(e₁.sumMap e₂) = Sum.map ⇑e₁ ⇑e₂
• Function.Embedding.congr_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u} {β : Sort v} {γ : Sort w} {δ : Sort x} (e₁ : α ≃ β) (e₂ : γ ≃ δ) (f : α ↪ γ) : ⇑(Function.Embedding.congr e₁ e₂ f) = ⇑(f.trans e₂.toEmbedding) ∘ ⇑e₁.symm
• Function.Embedding.setValue_eq_of_ne 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} {f : α ↪ β} {a : α} {b : β} {c : α} [(a' : α) → Decidable (a' = a)] [(a' : α) → Decidable (f a' = b)] (hc : c ≠ a) (hb : f c ≠ b) : (f.setValue a b) c = f c
• Function.Embedding.setValue_right_apply_eq 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Sort u_2} (f : α ↪ β) (a c : α) [(a' : α) → Decidable (a' = a)] [(a' : α) → Decidable (f a' = f c)] : (f.setValue a (f c)) c = f a
• Function.Embedding.swap_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] (f : α ↪ β) (x y z : α) : (Equiv.swap (f x) (f y)) (f z) = f ((Equiv.swap x y) z)
• Function.Embedding.swap_comp 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] (f : α ↪ β) (x y : α) : ⇑(Equiv.swap (f x) (f y)) ∘ ⇑f = ⇑f ∘ ⇑(Equiv.swap x y)
• subtypeOrLeftEmbedding_apply_left 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {p q : α → Prop} [DecidablePred p] (x : { x // p x ∨ q x }) (hx : p ↑x) : (subtypeOrLeftEmbedding p q) x = Sum.inl ⟨↑x, hx⟩
• Function.Embedding.sigmaMap_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {α' : Type u_2} {β : α → Type u_3} {β' : α' → Type u_4} (f : α ↪ α') (g : (a : α) → β a ↪ β' (f a)) (x : (a : α) × β a) : (f.sigmaMap g) x = Sigma.map (⇑f) (fun a => ⇑(g a)) x
• subtypeOrLeftEmbedding_apply_right 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {p q : α → Prop} [DecidablePred p] (x : { x // p x ∨ q x }) (hx : ¬p ↑x) : (subtypeOrLeftEmbedding p q) x = Sum.inr ⟨↑x, ⋯⟩
• Equiv.embeddingCongr_apply_trans 📋 Mathlib.Logic.Embedding.Basic
  {α₁ : Sort u_1} {β₁ : Sort u_2} {γ₁ : Sort u_3} {α₂ : Sort u_4} {β₂ : Sort u_5} {γ₂ : Sort u_6} (ea : α₁ ≃ α₂) (eb : β₁ ≃ β₂) (ec : γ₁ ≃ γ₂) (f : α₁ ↪ β₁) (g : β₁ ↪ γ₁) : (ea.embeddingCongr ec) (f.trans g) = ((ea.embeddingCongr eb) f).trans ((eb.embeddingCongr ec) g)
• Equiv.embeddingSurjectiveEquiv_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Type u_2} (f : { f // Function.Surjective ⇑f }) : Equiv.embeddingSurjectiveEquiv f = (↑f).equivOfSurjective ⋯
• Equiv.embeddingSurjectiveEquiv_symm_apply_coe_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Sort u_1} {β : Type u_2} (f : α ≃ β) (a : α) : ↑(Equiv.embeddingSurjectiveEquiv.symm f) a = f a
• subtypeOrLeftEmbedding_apply 📋 Mathlib.Logic.Embedding.Basic
  {α : Type u_1} {p q : α → Prop} [DecidablePred p] (x : { x // p x ∨ q x }) : (subtypeOrLeftEmbedding p q) x = if h : p ↑x then Sum.inl ⟨↑x, h⟩ else Sum.inr ⟨↑x, ⋯⟩
• RelEmbedding.toEmbedding 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_5} {β : Type u_6} {r : α → α → Prop} {s : β → β → Prop} (self : r ↪r s) : α ↪ β
• RelEmbedding.toEmbedding_injective 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} : Function.Injective RelEmbedding.toEmbedding
• RelEmbedding.preimage 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : β → β → Prop) : ⇑f ⁻¹'o s ↪r s
• RelEmbedding.ofOnFun 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} (r : β → β → Prop) (f : α ↪ β) : Function.onFun r ⇑f ↪r r
• RelEmbedding.toMap 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} (r : α → α → Prop) (f : α ↪ β) : r ↪r Relation.Map r ⇑f ⇑f
• RelEmbedding.toEmbedding_inj 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} {f g : r ↪r s} : f.toEmbedding = g.toEmbedding ↔ f = g
• RelEmbedding.coe_toEmbedding 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} {f : r ↪r s} : ⇑f.toEmbedding = ⇑f
• RelEmbedding.mk 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_5} {β : Type u_6} {r : α → α → Prop} {s : β → β → Prop} (toEmbedding : α ↪ β) (map_rel_iff' : ∀ {a b : α}, s (toEmbedding a) (toEmbedding b) ↔ r a b) : r ↪r s
• RelIso.coe_toEmbedding 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} (f : r ≃r s) : ⇑f.toEmbedding = ⇑f
• RelEmbedding.map_rel_iff' 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_5} {β : Type u_6} {r : α → α → Prop} {s : β → β → Prop} (self : r ↪r s) {a b : α} : s (self.toEmbedding a) (self.toEmbedding b) ↔ r a b
• RelEmbedding.coe_ofOnFun 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} (r : β → β → Prop) (f : α ↪ β) : ⇑(RelEmbedding.ofOnFun r f) = ⇑f
• RelEmbedding.preimage_apply 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : β → β → Prop) (a : α) : (RelEmbedding.preimage f s) a = f a
• RelEmbedding.coe_mk 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} {f : α ↪ β} {h : ∀ {a b : α}, s (f a) (f b) ↔ r a b} : ⇑{ toEmbedding := f, map_rel_iff' := h } = ⇑f
• RelEmbedding.coe_toMap 📋 Mathlib.Order.RelIso.Basic
  {α : Type u_1} {β : Type u_2} (r : α → α → Prop) (f : α ↪ β) : ⇑(RelEmbedding.toMap r f) = ⇑f
• OrderEmbedding.id_toEmbedding 📋 Mathlib.Order.Hom.Basic
  {α : Type u_2} [LE α] : (OrderEmbedding.id α).toEmbedding = Function.Embedding.refl α
• OrderIso.ofSurjective_symm_apply 📋 Mathlib.Order.Hom.Basic
  {α : Type u_2} {β : Type u_3} [LE α] [LE β] (f : α ↪o β) (hf : Function.Surjective ⇑f) (b : β) : (RelIso.symm (OrderIso.ofSurjective f hf)) b = Function.surjInv ⋯ b
• AddAction.toFun 📋 Mathlib.Algebra.Group.Action.Basic
  (M : Type u_2) (α : Type u_5) [AddMonoid M] [AddAction M α] : α ↪ M → α
• MulAction.toFun 📋 Mathlib.Algebra.Group.Action.Basic
  (M : Type u_2) (α : Type u_5) [Monoid M] [MulAction M α] : α ↪ M → α
• AddAction.toFun_apply 📋 Mathlib.Algebra.Group.Action.Basic
  {M : Type u_2} {α : Type u_5} [AddMonoid M] [AddAction M α] (x : M) (y : α) : (AddAction.toFun M α) y x = x +ᵥ y
• MulAction.toFun_apply 📋 Mathlib.Algebra.Group.Action.Basic
  {M : Type u_2} {α : Type u_5} [Monoid M] [MulAction M α] (x : M) (y : α) : (MulAction.toFun M α) y x = x • y
• Multiset.mapEmbedding 📋 Mathlib.Data.Multiset.Filter
  {α : Type u_1} {β : Type v} (f : α ↪ β) : Multiset α ↪o Multiset β
• Multiset.mapEmbedding_apply 📋 Mathlib.Data.Multiset.Filter
  {α : Type u_1} {β : Type v} (f : α ↪ β) (s : Multiset α) : (Multiset.mapEmbedding f) s = Multiset.map (⇑f) s
• Fintype.decidableEqEmbeddingFintype 📋 Mathlib.Data.Fintype.Defs
  {α : Type u_1} {β : Type u_2} [DecidableEq β] [Fintype α] : DecidableEq (α ↪ β)
• Finset.map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) : Finset β
• Finset.map_injective 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : Function.Injective (Finset.map f)
• Finset.Nonempty.map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} : s.Nonempty → (Finset.map f s).Nonempty
• Finset.map_nonempty 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} : (Finset.map f s).Nonempty ↔ s.Nonempty
• Finset.map_nontrivial 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} : (Finset.map f s).Nontrivial ↔ s.Nontrivial
• Finset.map_empty 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : Finset.map f ∅ = ∅
• Finset.mapEmbedding 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) : Finset α ↪o Finset β
• Finset.map_inj 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s₁ s₂ : Finset α} : Finset.map f s₁ = Finset.map f s₂ ↔ s₁ = s₂
• Finset.empty_eq_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} : ∅ = Finset.map f s ↔ s = ∅
• Finset.map_eq_empty 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} : Finset.map f s = ∅ ↔ s = ∅
• Finset.map_eq_image 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} [DecidableEq β] (f : α ↪ β) (s : Finset α) : Finset.map f s = Finset.image (⇑f) s
• Finset.map_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α ↪ β) (g : β ↪ γ) (s : Finset α) : Finset.map g (Finset.map f s) = Finset.map (f.trans g) s
• Finset.map_val 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) : (Finset.map f s).val = Multiset.map (⇑f) s.val
• Finset.disjoint_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {s t : Finset α} (f : α ↪ β) : Disjoint (Finset.map f s) (Finset.map f t) ↔ Disjoint s t
• Finset.coe_map_subset_range 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) : ↑(Finset.map f s) ⊆ Set.range ⇑f
• Finset.map_singleton 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (a : α) : Finset.map f {a} = {f a}
• Finset.map_toFinset 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} [DecidableEq α] [DecidableEq β] {s : Multiset α} : Finset.map f s.toFinset = (Multiset.map (⇑f) s).toFinset
• Finset.coe_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) : ↑(Finset.map f s) = ⇑f '' ↑s
• Finset.equivMap 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) : ↥s ≃ ↥(Finset.map f s)
• Function.Commute.finset_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {f g : α ↪ α} (h : Function.Commute ⇑f ⇑g) : Function.Commute (Finset.map f) (Finset.map g)
• Finset.map_erase 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} [DecidableEq β] [DecidableEq α] (f : α ↪ β) (s : Finset α) (a : α) : Finset.map f (s.erase a) = (Finset.map f s).erase (f a)
• Finset.map_inter 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] {f : α ↪ β} (s₁ s₂ : Finset α) : Finset.map f (s₁ ∩ s₂) = Finset.map f s₁ ∩ Finset.map f s₂
• Finset.map_sdiff 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] {f : α ↪ β} (s₁ s₂ : Finset α) : Finset.map f (s₁ \ s₂) = Finset.map f s₁ \ Finset.map f s₂
• Finset.map_ssubset_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s t : Finset α} : Finset.map f s ⊂ Finset.map f t ↔ s ⊂ t
• Finset.map_subset_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s₁ s₂ : Finset α} : Finset.map f s₁ ⊆ Finset.map f s₂ ↔ s₁ ⊆ s₂
• Finset.map_union 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] {f : α ↪ β} (s₁ s₂ : Finset α) : Finset.map f (s₁ ∪ s₂) = Finset.map f s₁ ∪ Finset.map f s₂
• Finset.mem_map_of_mem 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) {a : α} {s : Finset α} : a ∈ s → f a ∈ Finset.map f s
• Finset.mem_map' 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) {a : α} {s : Finset α} : f a ∈ Finset.map f s ↔ a ∈ s
• Finset.map_insert 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] (f : α ↪ β) (a : α) (s : Finset α) : Finset.map f (insert a s) = insert (f a) (Finset.map f s)
• Finset.mem_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} {b : β} : b ∈ Finset.map f s ↔ ∃ a ∈ s, f a = b
• Finset.map_cons 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (a : α) (s : Finset α) (ha : a ∉ s) : Finset.map f (Finset.cons a s ha) = Finset.cons (f a) (Finset.map f s) ⋯
• Finset.apply_coe_mem_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) (x : ↥s) : f ↑x ∈ Finset.map f s
• Function.Semiconj.finset_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {ga : α ↪ α} {gb : β ↪ β} (h : Function.Semiconj ⇑f ⇑ga ⇑gb) : Function.Semiconj (Finset.map f) (Finset.map ga) (Finset.map gb)
• Finset.filter_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} {p : β → Prop} [DecidablePred p] : Finset.filter p (Finset.map f s) = Finset.map f (Finset.filter (p ∘ ⇑f) s)
• Equiv.finsetCongr_toEmbedding 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (e : α ≃ β) : e.finsetCongr.toEmbedding = (Finset.mapEmbedding e.toEmbedding).toEmbedding
• Equiv.Finset.congr_toEmbedding 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (e : α ≃ β) : e.finsetCongr.toEmbedding = (Finset.mapEmbedding e.toEmbedding).toEmbedding
• Finset.mapEmbedding_apply 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} : (Finset.mapEmbedding f) s = Finset.map f s
• Finset.map_filter' 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (p : α → Prop) [DecidablePred p] (f : α ↪ β) (s : Finset α) [DecidablePred fun x => ∃ a, p a ∧ f a = x] : Finset.map f (Finset.filter p s) = {b ∈ Finset.map f s | ∃ a, p a ∧ f a = b}
• Finset.forall_mem_map 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} {s : Finset α} {p : (a : β) → a ∈ Finset.map f s → Prop} : (∀ (y : β) (H : y ∈ Finset.map f s), p y H) ↔ ∀ (x : α) (H : x ∈ s), p (f x) ⋯
• Finset.map_comm 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {γ : Type u_3} {s : Finset α} {β' : Type u_4} {f : β ↪ γ} {g : α ↪ β} {f' : α ↪ β'} {g' : β' ↪ γ} (h_comm : ∀ (a : α), f (g a) = g' (f' a)) : Finset.map f (Finset.map g s) = Finset.map g' (Finset.map f' s)
• Finset.map_disjUnion 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} (s₁ s₂ : Finset α) (h : Disjoint s₁ s₂) (h' : Disjoint (Finset.map f s₁) (Finset.map f s₂) := ⋯) : Finset.map f (s₁.disjUnion s₂ h) = (Finset.map f s₁).disjUnion (Finset.map f s₂) h'
• Finset.map_disjUnion' 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} {f : α ↪ β} (s₁ s₂ : Finset α) (h' : Disjoint (Finset.map f s₁) (Finset.map f s₂)) (h : Disjoint s₁ s₂ := ⋯) : Finset.map f (s₁.disjUnion s₂ h) = (Finset.map f s₁).disjUnion (Finset.map f s₂) h'
• Finset.equivMap_apply_coe 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) (x : ↥s) : ↑((Finset.equivMap f s) x) = f ↑x
• Finset.equivMap_symm_apply 📋 Mathlib.Data.Finset.Image
  {α : Type u_1} {β : Type u_2} (f : α ↪ β) (s : Finset α) (b : ↥(Finset.map f s)) : (Finset.equivMap f s).symm b = Function.surjInv ⋯ b
• Finset.card_map 📋 Mathlib.Data.Finset.Card
  {α : Type u_1} {β : Type u_2} {s : Finset α} (f : α ↪ β) : (Finset.map f s).card = s.card
• Finset.map_eq_of_subset 📋 Mathlib.Data.Finset.Card
  {α : Type u_1} {s : Finset α} {f : α ↪ α} (hs : Finset.map f s ⊆ s) : Finset.map f s = s
• Finset.map_univ_of_surjective 📋 Mathlib.Data.Finset.BooleanAlgebra
  {α : Type u_1} {β : Type u_2} [Fintype α] [Fintype β] {f : β ↪ α} (hf : Function.Surjective ⇑f) : Finset.map f Finset.univ = Finset.univ
• Fin.valEmbedding 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} : Fin n ↪ ℕ
• Fin.castLEEmb 📋 Mathlib.Data.Fin.Embedding
  {n m : ℕ} (h : n ≤ m) : Fin n ↪ Fin m
• Fin.natAdd_castLEEmb 📋 Mathlib.Data.Fin.Embedding
  {n m : ℕ} (hmn : n ≤ m) : Fin n ↪ Fin m
• Fin.nonempty_embedding_iff 📋 Mathlib.Data.Fin.Embedding
  {n m : ℕ} : Nonempty (Fin n ↪ Fin m) ↔ n ≤ m
• Fin.addNatEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (m : ℕ) : Fin n ↪ Fin (n + m)
• Fin.castAddEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (m : ℕ) : Fin n ↪ Fin (n + m)
• Fin.natAddEmb 📋 Mathlib.Data.Fin.Embedding
  (n : ℕ) {m : ℕ} : Fin m ↪ Fin (n + m)
• Fin.castSuccEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} : Fin n ↪ Fin (n + 1)
• Fin.succEmb 📋 Mathlib.Data.Fin.Embedding
  (n : ℕ) : Fin n ↪ Fin (n + 1)
• Fin.valEmbedding_apply 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} : ⇑Fin.valEmbedding = Fin.val
• Fin.succAboveEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (p : Fin (n + 1)) : Fin n ↪ Fin (n + 1)
• Fin.coe_castLEEmb 📋 Mathlib.Data.Fin.Embedding
  {m n : ℕ} (hmn : m ≤ n) : ⇑(Fin.castLEEmb hmn) = Fin.castLE hmn
• Fin.castLEEmb_apply 📋 Mathlib.Data.Fin.Embedding
  {n m : ℕ} (h : n ≤ m) (i : Fin n) : (Fin.castLEEmb h) i = Fin.castLE h i
• Fin.natAdd_castLEEmb_apply_val 📋 Mathlib.Data.Fin.Embedding
  {n m : ℕ} (hmn : n ≤ m) (a✝ : Fin n) : ↑((Fin.natAdd_castLEEmb hmn) a✝) = ↑a✝ + (m - n)
• Fin.range_natAdd_castLEEmb 📋 Mathlib.Data.Fin.Embedding
  {n m : ℕ} (hmn : n ≤ m) : Set.range ⇑(Fin.natAdd_castLEEmb hmn) = {i | m - n ≤ ↑i}
• Fin.equivSubtype_symm_trans_valEmbedding 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} : Fin.equivSubtype.symm.toEmbedding.trans Fin.valEmbedding = Function.Embedding.subtype fun x => x < n
• Fin.coe_castAddEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (m : ℕ) : ⇑(Fin.castAddEmb m) = Fin.castAdd m
• Fin.addNatEmb_apply 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (m : ℕ) (x✝ : Fin n) : (Fin.addNatEmb m) x✝ = x✝.addNat m
• Fin.castAddEmb_apply 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (m : ℕ) (i : Fin n) : (Fin.castAddEmb m) i = Fin.castAdd m i
• Fin.natAddEmb_apply 📋 Mathlib.Data.Fin.Embedding
  (n : ℕ) {m : ℕ} (i : Fin m) : (Fin.natAddEmb n) i = Fin.natAdd n i
• Fin.coe_castSuccEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} : ⇑Fin.castSuccEmb = Fin.castSucc
• Fin.coe_succEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} : ⇑(Fin.succEmb n) = Fin.succ
• Fin.castSuccEmb_apply 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (i : Fin n) : Fin.castSuccEmb i = i.castSucc
• Fin.coe_succAboveEmb 📋 Mathlib.Data.Fin.Embedding
  {n : ℕ} (p : Fin (n + 1)) : ⇑p.succAboveEmb = p.succAbove

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