Theorems · Definition · combinatorics
Multiset.recOn
{α : Type u_1} →
{C : Multiset α → Sort u_3} →
(m : Multiset α) →
C 0 →
(C_cons : (a : α) → (m : Multiset α) → C m → C (a ::ₘ m)) →
(∀ (a a' : α) (m : Multiset α) (b : C m),
C_cons a (a' ::ₘ m) (C_cons a' m b) ≍ C_cons a' (a ::ₘ m) (C_cons a m b)) →
C mCompanion to Multiset.rec with more convenient argument order.
- Defined in
- Mathlib.Data.Multiset.ZeroCons
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Multiset.consstatement and proof · cited by 313
- Multiset.recproof · cited by 0
Cited by7
Results whose statement or proof uses this declaration.
- Multiset.piproof · cited by 9
- Multiset.Sectionsproof · cited by 7
- Equiv.Perm.toCycleproof · cited by 7
- Equiv.Perm.toCycle_eq_toListproof · cited by 4
- Multiset.recOn_consstatement · cited by 3
- Multiset.recOn.congr_simpstatement and proof · cited by 0
- Multiset.recOn_0statement · cited by 0