Mathlib Map

Theorems · Theorem · order theory

iSup_congr_Prop

∀ {α : Type u_1} [inst : SupSet α] {p q : Prop} {f₁ : p → α} {f₂ : q → α} (pq : p ↔ q),
  (∀ (x : q), f₁ ⋯ = f₂ x) → iSup f₁ = iSup f₂
Defined in
Mathlib.Order.CompleteLattice.Basic
Cited by
247 results in Mathlib
Foundations
Depth 5 from the axioms, rests on 13 definitions · uses propext, 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 by247

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 247.