Replaced some cases instances with grind

InductiveVerification/Message.lean

@@ -604,6 +604,12 @@ by
   | snd h ih => exact analz.snd ih
   | decrypt h₁ h₂ ih₁ ih₂ => exact analz.decrypt ih₁ ih₂
 
+@[grind .]
+lemma analz_insert_mono [InvKey] :
+  X ∈ analz H → X ∈ analz (insert Y H)
+:= by
+  apply_rules [ analz_mono, Set.subset_insert]
+
 lemma analz_mono_neg [InvKey] { h : A ⊆ B } :
   X ∉ analz B → X ∉ analz A
 := by
@@ -624,7 +630,7 @@ by
   · apply analz.fst h
   · apply analz.snd h
 
-@[simp]
+@[simp, grind! .]
 lemma analz_increasing [InvKey] {H : Set Msg} : H ⊆ analz H :=
   λ _ hx => analz.inj hx
 
@@ -637,6 +643,7 @@ by
   | snd _ ih => aapply parts.snd
   | decrypt _ _ ih₁ => aapply parts.body
 
+@[grind! .]
 lemma analz_subset_parts {H : Set Msg} [InvKey] : analz H ⊆ parts H :=
   λ _ hx => analz_into_parts hx
 
@@ -1628,5 +1635,3 @@ X ∈ A ∨ h₁ → X ∈ B ∨ h₁
   intro h; cases h <;> try simp_all
   left; aapply h
 
-attribute [-simp] Key.injEq
-