Theorems · Definition · order theory
IsQuantale.recOn
{α : Type u_1} →
[inst : Semigroup α] →
[inst_1 : CompleteLattice α] →
{motive : IsQuantale α → Sort u} →
(t : IsQuantale α) →
((mul_sSup_distrib : ∀ (x : α) (s : Set α), x * sSup s = ⨆ y ∈ s, x * y) →
(sSup_mul_distrib : ∀ (s : Set α) (y : α), sSup s * y = ⨆ x ∈ s, x * y) → motive ⋯) →
motive t- Defined in
- Mathlib.Algebra.Order.Quantale
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
- Assumes
- SemigroupCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- iSupstatement and proof · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupstatement and proof · cited by 954
- Semigroupstatement and proof · cited by 202
- IsQuantalestatement and proof · cited by 13
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.