Theorems · Theorem · order theory
biInf_mono
∀ {α : Type u_1} {ι : Sort u_4} [inst : CompleteLattice α] {f : ι → α} {p q : ι → Prop},
(∀ (i : ι), p i → q i) → ⨅ i, ⨅ (_ : q i), f i ≤ ⨅ i, ⨅ (_ : p i), f i- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses no axioms
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- iInfstatement · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- iInf_monoproof · cited by 29
- iInf_const_monoproof · cited by 3
Cited by8
Results whose statement or proof uses this declaration.
- TopologicalSpace.nhds_generateFromproof · cited by 15
- iInf_le_iInf_of_subsetproof · cited by 5
- Dynamics.coverMincard_monotone_timeproof · cited by 3
- Filter.iInf_sets_eq_finiteproof · cited by 2
- Dynamics.coverMincard_antitoneproof · cited by 2
- iSup_iInf_ge_nat_addproof · cited by 2
- Dynamics.coverMincard_monotone_subsetproof · cited by 2
- StieltjesFunction.length_monoproof · cited by 1