Theorems · Definition · general topology
Set.BijOn.toPartialEquiv
{α : Type u_1} →
{β : Type u_2} → [Nonempty α] → (f : α → β) → (s : Set α) → (t : Set β) → Set.BijOn f s t → PartialEquiv α βA bijection between two sets s : Set α and t : Set β provides a partial equivalence
between α and β.
- Defined in
- Mathlib.Logic.Equiv.PartialEquiv
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- PartialEquivstatement · cited by 335
- Set.BijOnstatement and proof · cited by 168
- Set.BijOn.mapsToproof · cited by 42
- Function.invFunOnproof · cited by 35
Cited by6
Results whose statement or proof uses this declaration.
- Set.InjOn.toPartialEquivproof · cited by 2
- Set.BijOn.toPartialEquiv_applystatement and proof · cited by 0
- Set.BijOn.toPartialEquiv_sourcestatement and proof · cited by 0
- Set.BijOn.toPartialEquiv_symm_applystatement and proof · cited by 0
- Set.BijOn.toPartialEquiv_targetstatement and proof · cited by 0
- Set.BijOn.toPartialEquiv.congr_simpstatement and proof · cited by 0