Theorems · Definition · combinatorics
Multiset.Rel.casesOn
∀ {α : Type u_1} {β : Type v} {r : α → β → Prop}
{motive : (a : Multiset α) → (a_1 : Multiset β) → Multiset.Rel r a a_1 → Prop} {a : Multiset α} {a_1 : Multiset β}
(t : Multiset.Rel r a a_1),
motive 0 0 ⋯ →
(∀ {a : α} {b : β} {as : Multiset α} {bs : Multiset β} (a_2 : r a b) (a_3 : Multiset.Rel r as bs),
motive (a ::ₘ as) (b ::ₘ bs) ⋯) →
motive a a_1 t- Defined in
- Mathlib.Data.Multiset.ZeroCons
- Cited by
- 1 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.Relstatement and proof · cited by 47
Cited by1
Results whose statement or proof uses this declaration.
- Multiset.rel_iffproof · cited by 2