Mathlib Map

Theorems · Theorem · order theory

Set.bijOn_iUnion

∀ {α : Type u_1} {β : Type u_2} {ι : Sort u_5} {s : ι → Set α} {t : ι → Set β} {f : α → β},
  (∀ (i : ι), Set.BijOn f (s i) (t i)) → Set.InjOn f (⋃ i, s i) → Set.BijOn f (⋃ i, s i) (⋃ i, t i)
Defined in
Mathlib.Data.Set.Lattice.Image
Cited by
2 results in Mathlib
Foundations
Depth 64 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.

Set.bijOn_iUnion_of_directed · cited by 1Set.bijOn_iUnion_of_direc…IndexedPartition.piecewise_bij · cited by 0IndexedPartition.piecewis…Set · cited by 53352SetSet.iUnion · cited by 2483Set.iUnionSet.InjOn · cited by 543Set.InjOnSet.BijOn · cited by 168Set.BijOnSet.BijOn.mapsTo · cited by 42BijOn.mapsToSet.BijOn.surjOn · cited by 31BijOn.surjOnSet.surjOn_iUnion_iUnion · cited by 2Set.surjOn_iUnion_iUnionSet.mapsTo_iUnion_iUnion · cited by 2Set.mapsTo_iUnion_iUnionSet.bijOn_iUnionCITED BYCITES

Cites8

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

Cited by2

Results whose statement or proof uses this declaration.