filter split golf branch high to drop statement-deleting files#5
filter split golf branch high to drop statement-deleting files#5Thmoas-Guan wants to merge 3 commits into
Conversation
| congr 1 | ||
| simp [Under.map, Comma.mapLeft] | ||
| rfl | ||
| simp [precompEnrichedHom'] |
There was a problem hiding this comment.
This should be simp only, so actually no golf is done
| cases Z | ||
| rcases f with ⟨⟨⟨⟩⟩⟩ | ||
| exact g | ||
| comp g f := ULift.up (PLift.up (g.down.down.trans f.down.down)) |
There was a problem hiding this comment.
Should be more careful when editing definitions.
| map₂_comp := by intro _ _ _ _ _ η θ; exact Quot.induction_on₂ η θ fun _ _ => rfl | ||
| map₂_whisker_left := by intro _ _ _ _ _ _ η; exact Quot.induction_on η fun _ => by cat_disch |
There was a problem hiding this comment.
This is a restate of the original proof, still need examination
| calc | ||
| _ = h ◁ (i.inv ≫ i.hom).right := by simp [-Iso.inv_hom_id] | ||
| _ = 𝟙 _ := by simp [Iso.inv_hom_id]) | ||
| (whiskering h).mapIso i |
There was a problem hiding this comment.
Is this properly tested?
| ext; simp [mapComp', F.mapComp_id_left_hom f, Strict.leftUnitor_eqToIso, | ||
| PrelaxFunctor.map₂_eqToHom] |
There was a problem hiding this comment.
Modulo use of ; it looks like an improvement, similar above
| simp only [O, H, Finset.mem_biUnion, Finset.mem_univ, Finset.mem_image, | ||
| PSigma.mk.injEq, true_and, exists_and_left] | ||
| exact ⟨j, rfl, j', g, by simp⟩ | ||
| aesop (add simp [H]) |
There was a problem hiding this comment.
Whether aesop is correctly used here needs discussion
| Final F := | ||
| (isConnected_iff_final_of_unique F).mp (IsFiltered.isConnected C) |
There was a problem hiding this comment.
looks good, similar below
| refine FilteredClosureSmall.InductiveStep.max ?_ ?_ x y | ||
| all_goals apply Nat.lt_succ_of_le | ||
| exacts [Nat.le_max_left _ _, Nat.le_max_right _ _] | ||
| exact FilteredClosureSmall.InductiveStep.max (by omega) (by omega) x y |
There was a problem hiding this comment.
This is somehow really violating readability? This needs some further examination
| slice_lhs 2 3 => rw [NatTrans.naturality] | ||
| slice_lhs 1 2 => rw [← NatTrans.comp_app, NatTrans.naturality, NatTrans.comp_app] | ||
| rw [Category.assoc] } | ||
| naturality := fun X Y f => by cat_disch } |
There was a problem hiding this comment.
I remember in this case cat_disch is prefered, so OK here
| symm | ||
| apply hc.uniq (c.extend _) | ||
| simp | ||
| have : g₁.right = g₂.right := hc.hom_ext this |
There was a problem hiding this comment.
This is definitely improvement
base: 0915ed3
kept_files: 131
removed_files: 22
rule: drop files whose patch deletes top-level def/lemma/theorem/instance/abbrev/class/structure declarations