Mathlib Map

Theorems · Theorem · order theory

ENat.iSup_add_iSup_le

∀ {ι : Sort u_2} {κ : Sort u_3} {f : ι → ℕ∞} {a : ℕ∞} [Nonempty ι] [Nonempty κ] {g : κ → ℕ∞},
  (∀ (i : ι) (j : κ), f i + g j ≤ a) → iSup f + iSup g ≤ a
Defined in
Mathlib.Data.ENat.Lattice
Cited by
1 results in Mathlib
Foundations
Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
NonemptyNonempty

Around this declaration

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

Cites5

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

Cited by1

Results whose statement or proof uses this declaration.