Theorems · Theorem · order theory

Set.BijOn.iUnion_comp

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {s : Set β} {t : Set γ} {f : β → γ} (g : γ → Set α),
  Set.BijOn f s t → ⋃ x ∈ s, g (f x) = ⋃ y ∈ t, g y

Defined in: Mathlib.Data.Set.Lattice
Cited by: 0 results in Mathlib
Foundations: Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites4

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.iUnionstatement · cited by 2,483
Set.BijOnstatement and proof · cited by 168
Set.BijOn.iSup_compproof · cited by 2

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.