Mathlib Map

Theorems · Theorem · order theory

iSup_congr

∀ {α : Type u_1} {ι : Sort u_4} [inst : SupSet α] {f g : ι → α}, (∀ (i : ι), f i = g i) → ⨆ i, f i = ⨆ i, g i
Defined in
Mathlib.Order.CompleteLattice.Basic
Cited by
15 results in Mathlib
Foundations
Depth 5 from the axioms · uses Quot.sound
Assumes
SupSet

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.

  • iSupstatement and proof · cited by 2,415
  • SupSetstatement and proof · cited by 154

Cited by15

Results whose statement or proof uses this declaration.