Theorems · Definition
Equiv.ofUnique
(α : Sort u) → (β : Sort v) → [Unique α] → [Unique β] → α ≃ β
If both α and β have a unique element, then α ≃ β.
- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by19
Results whose statement or proof uses this declaration.
- Cardinal.mk_eq_oneproof · cited by 14
- Module.basisUniqueproof · cited by 5
- Equiv.equivPUnitproof · cited by 3
- OrderIso.ofUniqueproof · cited by 3
- MeasurableEquiv.ofUniqueOfUniqueproof · cited by 2
- Homeomorph.homeomorphOfUniqueproof · cited by 2
- Action.diagonalSuccIsoTensorTrivial_inv_hom_applyproof · cited by 1
- Equiv.Perm.VectorsProdEqOne.equivVectorproof · cited by 1
- RelIso.ofUniqueOfIrreflproof · cited by 1
- MulEquiv.ofUniqueproof · cited by 1
- FreeGroup.freeGroupEmptyEquivUnitproof · cited by 0
- RelIso.ofUniqueOfReflproof · cited by 0