Documentation

Mathlib.Data.Finset.Preimage

Preimage of a Finset under an injective map. #

source
noncomputable def Finset.preimage {α : Type u} {β : Type v} (s : Finset β) (f : α → β) (hf : Set.InjOn f (f ⁻¹' ↑s)) :
Finset α

Preimage of s : Finset β under a map f injective on f ⁻¹' s as a Finset.

Equations
  • s.preimage f hf = ⋯.toFinset
Instances For
    source
    @[simp]
    theorem Finset.mem_preimage {α : Type u} {β : Type v} {f : α → β} {s : Finset β} {hf : Set.InjOn f (f ⁻¹' ↑s)} {x : α} :
    x ∈ s.preimage f hf ↔ f x ∈ s
    source
    @[simp]
    theorem Finset.coe_preimage {α : Type u} {β : Type v} {f : α → β} (s : Finset β) (hf : Set.InjOn f (f ⁻¹' ↑s)) :
    ↑(s.preimage f hf) = f ⁻¹' ↑s
    source
    @[simp]
    theorem Finset.preimage_empty {α : Type u} {β : Type v} {f : α → β} :
    ∅.preimage f ⋯ = ∅
    source
    @[simp]
    theorem Finset.preimage_univ {α : Type u} {β : Type v} {f : α → β} [Fintype α] [Fintype β] (hf : Set.InjOn f (f ⁻¹' ↑Finset.univ)) :
    Finset.univ.preimage f hf = Finset.univ
    source
    @[simp]
    theorem Finset.preimage_inter {α : Type u} {β : Type v} [DecidableEq α] [DecidableEq β] {f : α → β} {s : Finset β} {t : Finset β} (hs : Set.InjOn f (f ⁻¹' ↑s)) (ht : Set.InjOn f (f ⁻¹' ↑t)) :
    (s ∩ t).preimage f ⋯ = s.preimage f hs ∩ t.preimage f ht
    source
    @[simp]
    theorem Finset.preimage_union {α : Type u} {β : Type v} [DecidableEq α] [DecidableEq β] {f : α → β} {s : Finset β} {t : Finset β} (hst : Set.InjOn f (f ⁻¹' ↑(s ∪ t))) :
    (s ∪ t).preimage f hst = s.preimage f ⋯ ∪ t.preimage f ⋯
    source
    @[simp]
    theorem Finset.preimage_compl {α : Type u} {β : Type v} [DecidableEq α] [DecidableEq β] [Fintype α] [Fintype β] {f : α → β} (s : Finset β) (hf : Function.Injective f) :
    sᶜ.preimage f ⋯ = (s.preimage f ⋯)ᶜ
    source
    @[simp]
    theorem Finset.preimage_map {α : Type u} {β : Type v} (f : α ↪ β) (s : Finset α) :
    (Finset.map f s).preimage ⇑f ⋯ = s
    source
    theorem Finset.monotone_preimage {α : Type u} {β : Type v} {f : α → β} (h : Function.Injective f) :
    Monotone fun (s : Finset β) => s.preimage f ⋯
    source
    theorem Finset.image_subset_iff_subset_preimage {α : Type u} {β : Type v} [DecidableEq β] {f : α → β} {s : Finset α} {t : Finset β} (hf : Set.InjOn f (f ⁻¹' ↑t)) :
    Finset.image f s ⊆ t ↔ s ⊆ t.preimage f hf
    source
    theorem Finset.map_subset_iff_subset_preimage {α : Type u} {β : Type v} {f : α ↪ β} {s : Finset α} {t : Finset β} :
    Finset.map f s ⊆ t ↔ s ⊆ t.preimage ⇑f ⋯
    source
    theorem Finset.image_preimage {α : Type u} {β : Type v} [DecidableEq β] (f : α → β) (s : Finset β) [(x : β) → Decidable (x ∈ Set.range f)] (hf : Set.InjOn f (f ⁻¹' ↑s)) :
    Finset.image f (s.preimage f hf) = Finset.filter (fun (x : β) => x ∈ Set.range f) s
    source
    theorem Finset.image_preimage_of_bij {α : Type u} {β : Type v} [DecidableEq β] (f : α → β) (s : Finset β) (hf : Set.BijOn f (f ⁻¹' ↑s) ↑s) :
    Finset.image f (s.preimage f ⋯) = s
    source
    theorem Finset.preimage_subset {α : Type u} {β : Type v} {f : α ↪ β} {s : Finset β} {t : Finset α} (hs : s ⊆ Finset.map f t) :
    s.preimage ⇑f ⋯ ⊆ t
    source
    theorem Finset.subset_map_iff {α : Type u} {β : Type v} {f : α ↪ β} {s : Finset β} {t : Finset α} :
    s ⊆ Finset.map f t ↔ ∃ u ⊆ t, s = Finset.map f u
    source
    theorem Finset.sigma_preimage_mk {α : Type u} {β : α → Type u_1} [DecidableEq α] (s : Finset ((a : α) × β a)) (t : Finset α) :
    (t.sigma fun (a : α) => s.preimage (Sigma.mk a) ⋯) = Finset.filter (fun (a : (a : α) × β a) => a.fst ∈ t) s
    source
    theorem Finset.sigma_preimage_mk_of_subset {α : Type u} {β : α → Type u_1} [DecidableEq α] (s : Finset ((a : α) × β a)) {t : Finset α} (ht : Finset.image Sigma.fst s ⊆ t) :
    (t.sigma fun (a : α) => s.preimage (Sigma.mk a) ⋯) = s
    source
    theorem Finset.sigma_image_fst_preimage_mk {α : Type u} {β : α → Type u_1} [DecidableEq α] (s : Finset ((a : α) × β a)) :
    ((Finset.image Sigma.fst s).sigma fun (a : α) => s.preimage (Sigma.mk a) ⋯) = s