Theorems · Theorem · logic and foundations
Set.injective_piecewise_iff
∀ {α : Type u_1} {β : Type u_2} (s : Set α) [inst : (j : α) → Decidable (j ∈ s)] {f g : α → β},
Function.Injective (s.piecewise f g) ↔ Set.InjOn f s ∧ Set.InjOn g sᶜ ∧ ∀ x ∈ s, ∀ y ∉ s, f x ≠ g y- Defined in
- Mathlib.Data.Set.Piecewise
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Decidable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Compl.complstatement and proof · cited by 2,925
- Set.InjOnstatement and proof · cited by 543
- Set.piecewisestatement and proof · cited by 136
- Set.union_compl_selfproof · cited by 57
- Set.piecewise_eq_of_memproof · cited by 49
- Set.piecewise_eq_of_notMemproof · cited by 49
- disjoint_compl_rightproof · cited by 47
- Set.piecewise_eqOnproof · cited by 6
- Set.injOn_univproof · cited by 4
- Set.piecewise_eqOn_complproof · cited by 3
- Set.injOn_unionproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Function.Embedding.schroeder_bernstein_of_relproof · cited by 2