Theorems · Theorem · order theory
Set.BijOn.union
∀ {α : Type u_1} {β : Type u_2} {s₁ s₂ : Set α} {t₁ t₂ : Set β} {f : α → β},
Set.BijOn f s₁ t₁ → Set.BijOn f s₂ t₂ → Set.InjOn f (s₁ ∪ s₂) → Set.BijOn f (s₁ ∪ s₂) (t₁ ∪ t₂)- Defined in
- Mathlib.Data.Set.Function
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 19 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
- Set.InjOnstatement and proof · cited by 543
- Set.BijOnstatement and proof · cited by 168
- Set.BijOn.mapsToproof · cited by 42
- Set.BijOn.surjOnproof · cited by 31
- Set.MapsTo.union_unionproof · cited by 4
- Set.SurjOn.union_unionproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Set.BijOn.insert_iffproof · cited by 1