Mathlib Map

Theorems · Theorem · order theory

iInf_congr_Prop

∀ {α : Type u_1} [inst : InfSet α] {p q : Prop} {f₁ : p → α} {f₂ : q → α} (pq : p ↔ q),
  (∀ (x : q), f₁ ⋯ = f₂ x) → iInf f₁ = iInf f₂
Defined in
Mathlib.Order.CompleteLattice.Basic
Cited by
218 results in Mathlib
Foundations
Depth 5 from the axioms, rests on 13 definitions · uses propext, Quot.sound
Assumes
InfSet

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.

  • iInfstatement and proof · cited by 1,690
  • InfSetstatement and proof · cited by 145

Cited by218

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 218.