hole_issue2.lean:22:74: error: don't know how to synthesize placeholder
state:
A : Type,
b₁ b₂ : bag A,
l₁ l₂ : list A,
_match : Π (b : bool), subcount l₁ l₂ = b → decidable (⟦l₁⟧ ⊆ ⟦l₂⟧),
H : subcount l₁ l₂ = ff,
h : ⟦l₁⟧ ⊆ ⟦l₂⟧,
w : A,
hw : ¬list.count w l₁ ≤ list.count w l₂
⊢ false
Additional information:
hole_issue2.lean:19:0: context: the inferred motive for the eliminator-like application is
  λ (_x _x_1 : bag A), decidable (_x ⊆ _x_1)
hole_issue2.lean:29:65: error: don't know how to synthesize placeholder
state:
A : Type,
b₁ b₂ : bag A,
l₁ l₂ : list A,
_match : Π (b : bool), subcount l₁ l₂ = b → decidable (⟦l₁⟧ ⊆ ⟦l₂⟧),
H : subcount l₁ l₂ = ff,
h : ⟦l₁⟧ ⊆ ⟦l₂⟧
⊢ ∀ (a : A), ¬list.count a l₁ ≤ list.count a l₂ → false
Additional information:
hole_issue2.lean:26:0: context: the inferred motive for the eliminator-like application is
  λ (_x _x_1 : bag A), decidable (_x ⊆ _x_1)
hole_issue2.lean:36:28: error: don't know how to synthesize placeholder
state:
A : Type,
b₁ b₂ : bag A,
l₁ l₂ : list A,
_match : Π (b : bool), subcount l₁ l₂ = b → decidable (⟦l₁⟧ ⊆ ⟦l₂⟧),
H : subcount l₁ l₂ = ff,
h : ⟦l₁⟧ ⊆ ⟦l₂⟧
⊢ false
Additional information:
hole_issue2.lean:33:0: context: the inferred motive for the eliminator-like application is
  λ (_x _x_1 : bag A), decidable (_x ⊆ _x_1)