Theorems · Definition · combinatorics
HasSups.recOn
{α : Type u_4} →
{motive : HasSups α → Sort u} → (t : HasSups α) → ((sups : α → α → α) → motive { sups := sups }) → motive t- Defined in
- Mathlib.Data.Set.Sups
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- HasSupsstatement and proof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.