Mathlib Map

Theorems · Theorem · order theory

Set.BijOn.finite_iff_finite

∀ {α : Type u} {β : Type v} {f : α → β} {s : Set α} {t : Set β}, Set.BijOn f s t → (s.Finite ↔ t.Finite)
Defined in
Mathlib.Data.Set.Finite.Basic
Cited by
3 results in Mathlib
Foundations
Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

AddSubgroup.properlyDiscontinuousVAdd_iff · cited by 2AddSubgroup.properlyDisco…Subgroup.properlyDiscontinuousSMul_iff · cited by 2Subgroup.properlyDisconti…NumberField.finite_setOfPred_prod_infinitePlace_iSup_le · cited by 2NumberField.finite_setOfP…Set · cited by 53352SetSet.Finite · cited by 1814Set.FiniteSet.BijOn · cited by 168Set.BijOnSet.Finite.of_injOn · cited by 7Finite.of_injOnSet.Finite.of_surjOn · cited by 3Finite.of_surjOnBijOn.finite_iff_finiteCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.