@@ -195,7 +195,7 @@ theorem profiniteSolid_fintype_isSolid (T : FintypeCat.{u}) :
195195 -- congr_arg gives (g ≫ hom) ≫ inv = (g' ≫ hom) ≫ inv (left-assoc, both sides)
196196 -- then Category.assoc + hom_inv_id + comp_id reduce to g = g'
197197 have key := congr_arg (· ≫ (finFree_iso_solid R T).inv) h_step
198- simp only [Category.assoc, (finFree_iso_solid R T) .hom_inv_id, Category.comp_id] at key
198+ simp only [Category.assoc, Iso .hom_inv_id, Category.comp_id] at key
199199 exact key
200200 · -- SURJECTIVITY (proved 2026-06-13)
201201 intro h
@@ -246,7 +246,6 @@ lemma isSolid_of_isLimit_gen
246246 constructor
247247 · intro f g hfg
248248 apply hc.hom_ext; intro j; apply (bijFun j).1
249- show sol ≫ f ≫ c.π.app j = sol ≫ g ≫ c.π.app j
250249 -- hfg has Yoneda type; coerce, then congr_arg avoids ← assoc one-occurrence problem
251250 have hfg' : sol ≫ f = sol ≫ g := hfg
252251 have key := congr_arg (· ≫ c.π.app j) hfg'
@@ -267,7 +266,7 @@ lemma isSolid_of_isLimit_gen
267266 change 𝟙 _ ≫ g_j k = g_j j ≫ F.map φ
268267 simp only [Category.id_comp]; exact (compat φ).symm } }
269268 refine ⟨hc.lift g_cone, ?_⟩
270- show sol ≫ hc.lift g_cone = h_map
269+ change sol ≫ hc.lift g_cone = h_map
271270 apply hc.hom_ext; intro j
272271 have hfac : hc.lift g_cone ≫ c.π.app j = g_j j := hc.fac g_cone j
273272 rw [Category.assoc, hfac]; exact hg_j' j
@@ -298,7 +297,8 @@ theorem profiniteSolid_obj_isSolid (S : Profinite.{u}) :
298297 change (E.coneAt S).pt.IsSolid
299298 apply isSolid_of_isLimit_gen R (E.coneAt S) h_pwise
300299 intro f
301- simp only [Functor.comp_obj, StructuredArrow.proj_obj]
300+ -- Use exact with definitional equality rather than simp;
301+ -- (F ⩙ G).obj j and StructuredArrow.proj .obj j unfold definitionally
302302 exact finFree_isSolid R f.right
303303
304304end CondensedMod
0 commit comments