Theorems · Theorem · order theory
ciInf_subtype_fun
∀ {α : Type u_1} [inst : ConditionallyCompleteLattice α] {ι : Type u_5} {s : Set ι} {f : ι → α},
BddBelow (Set.range fun i => f ↑i) → ⨅ i, f ↑i ≤ sInf ∅ → ⨅ i, f ↑i = ⨅ t ∈ s, f t- Cited by
- 1 results in Mathlib
- Foundations
- Depth 32 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ConditionallyCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- Set.rangestatement and proof · cited by 4,705
- iInfstatement and proof · cited by 1,690
- InfSet.sInfstatement and proof · cited by 935
- BddBelowstatement and proof · cited by 401
- ConditionallyCompleteLatticestatement and proof · cited by 364
- ciInf_subtypeproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- ciInf_subtype''proof · cited by 0