Theorems · Theorem · combinatorics
Finset.preimage_map
∀ {α : Type u} {β : Type v} (f : α ↪ β) (s : Finset α), (Finset.map f s).preimage ⇑f ⋯ = s- Defined in
- Mathlib.Data.Finset.Preimage
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setproof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- Set.preimagestatement and proof · cited by 4,946
- Function.Embeddingstatement and proof · cited by 988
- Finset.mapstatement and proof · cited by 747
- Function.Injective.injOnstatement and proof · cited by 280
- Finset.coe_injectiveproof · cited by 127
- Finset.coe_mapproof · cited by 114
- Function.Embedding.injectivestatement and proof · cited by 111
- Finset.preimagestatement and proof · cited by 108
Cited by1
Results whose statement or proof uses this declaration.
- SummationFilter.comap_unconditionalproof · cited by 4