Theorems · Theorem · order theory
Set.injOn_union
∀ {α : Type u_1} {β : Type u_2} {s₁ s₂ : Set α} {f : α → β},
Disjoint s₁ s₂ → (Set.InjOn f (s₁ ∪ s₂) ↔ Set.InjOn f s₁ ∧ Set.InjOn f s₂ ∧ ∀ x ∈ s₁, ∀ y ∈ s₂, f x ≠ f y)- Defined in
- Mathlib.Data.Set.Function
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Disjointstatement and proof · cited by 2,201
- Set.InjOnstatement and proof · cited by 543
- Set.subset_union_leftproof · cited by 142
- Set.subset_union_rightproof · cited by 123
- Set.InjOn.monoproof · cited by 61
- Disjoint.le_botproof · cited by 52
Cited by3
Results whose statement or proof uses this declaration.
- Set.injOn_insertproof · cited by 4
- Set.BijOn.exists_extend_of_subsetproof · cited by 2
- Set.injective_piecewise_iffproof · cited by 1