Theorems · Definition · combinatorics
Finset.pimage
{α : Type u_1} → {β : Type u_2} → [DecidableEq β] → (f : α →. β) → [(x : α) → Decidable (f x).Dom] → Finset α → Finset βImage of s : Finset α under a partially defined function f : α →. β.
- Defined in
- Mathlib.Data.Finset.PImage
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqDecidable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.biUnionproof · cited by 217
- PFunstatement and proof · cited by 207
- Part.Domstatement and proof · cited by 145
- Part.toFinsetproof · cited by 5
Cited by11
Results whose statement or proof uses this declaration.
- Finset.mem_pimagestatement · cited by 2
- Finset.coe_pimagestatement · cited by 2
- Finset.pimage_subsetstatement · cited by 1
- Finset.pimage.congr_simpstatement and proof · cited by 0
- Finset.pimage_congrstatement · cited by 0
- Finset.pimage_emptystatement · cited by 0
- Finset.pimage_eq_image_filterstatement · cited by 0
- Finset.pimage_interstatement and proof · cited by 0
- Finset.pimage_monostatement · cited by 0
- Finset.pimage_somestatement · cited by 0
- Finset.pimage_unionstatement and proof · cited by 0