Mathlib Map

Theorems · Theorem · order theory

Set.iUnion_congr_Prop

∀ {α : Type u_1} {p q : Prop} {f₁ : p → Set α} {f₂ : q → Set α} (pq : p ↔ q),
  (∀ (x : q), f₁ ⋯ = f₂ x) → Set.iUnion f₁ = Set.iUnion f₂
Defined in
Mathlib.Data.Set.Lattice
Cited by
374 results in Mathlib
Foundations
Depth 6 from the axioms, rests on 21 definitions · uses propext, Quot.sound

Around this declaration

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

Cites3

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

Cited by374

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 374.