Theorems · Theorem · order theory
csInf_mul
∀ {M : Type u_1} [inst : ConditionallyCompleteLattice M] [inst_1 : Group M] [MulLeftMono M] [MulRightMono M]
{s t : Set M}, s.Nonempty → BddBelow s → t.Nonempty → BddBelow t → sInf (s * t) = sInf s * sInf t- Cited by
- 1 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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
- Groupstatement and proof · cited by 6,238
- Set.Nonemptystatement and proof · cited by 2,627
- InfSet.sInfstatement · cited by 935
- OrderIso.symmproof · cited by 475
- MulLeftMonostatement and proof · cited by 410
- BddBelowstatement and proof · cited by 401
- ConditionallyCompleteLatticestatement and proof · cited by 364
- Set.mulstatement · cited by 297
- MulRightMonostatement and proof · cited by 263
- OrderIso.to_galoisConnectionproof · cited by 32
- OrderIso.mulLeftproof · cited by 18
Cited by1
Results whose statement or proof uses this declaration.
- csInf_divproof · cited by 0