Theorems · Theorem · combinatorics
Function.Injective.invFun_restrict
∀ {α : Type u_1} {β : Type u_2} [inst : Fintype α] [inst_1 : DecidableEq β] {f : α → β} (hf : Function.Injective f)
[inst_2 : Nonempty α], (Set.range f).domRestrict (Function.invFun f) = hf.invOfMemRange- Defined in
- Mathlib.Data.Fintype.Inv
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEqNonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- Set.rangestatement and proof · cited by 4,705
- Set.domRestrictstatement and proof · cited by 383
- Set.mem_rangeproof · cited by 102
- Function.invFunstatement and proof · cited by 60
- Function.invFun_eqproof · cited by 10
- Function.Injective.invOfMemRangestatement and proof · cited by 6
- Function.Injective.left_inv_of_invOfMemRangeproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.