Skip to content
This repository has been archived by the owner on Sep 21, 2023. It is now read-only.

Commit

Permalink
minor
Browse files Browse the repository at this point in the history
  • Loading branch information
Scott Morrison committed Oct 31, 2018
1 parent 7c6e798 commit 8a5a26d
Show file tree
Hide file tree
Showing 2 changed files with 11 additions and 6 deletions.
2 changes: 1 addition & 1 deletion leanpkg.toml
Original file line number Diff line number Diff line change
Expand Up @@ -5,5 +5,5 @@ lean_version = "khoek/klean:3.4.4"
path = "src"

[dependencies]
lean-tidy = {git = "https://github.com/semorrison/lean-tidy", rev = "8ec2b7c481ec43bb2675f4d04ecc9e333b0fa1d1"}
lean-tidy = {git = "https://github.com/semorrison/lean-tidy", rev = "55bf2833e64dc74049fd8fbf975d5582ed988e5e"}
mathlib = {git = "https://github.com/leanprover-community/mathlib", rev = "792c673188f8da5be51848db3f82f96871ed86b9"}
15 changes: 10 additions & 5 deletions src/category_theory/equivalence/default.lean
Original file line number Diff line number Diff line change
Expand Up @@ -38,8 +38,10 @@ def symm (e : C ≌ D) : D ≌ C :=
fun_inv_id' := e.inv_fun_id,
inv_fun_id' := e.fun_inv_id }

@[simp,search] lemma fun_inv_map (e : C ≌ D) (X Y : D) (f : X ⟶ Y) : e.functor.map (e.inverse.map f) = (e.inv_fun_id.hom X) ≫ f ≫ (e.inv_fun_id.inv Y) := by obviously
@[simp,search] lemma inv_fun_map (e : C ≌ D) (X Y : C) (f : X ⟶ Y) : e.inverse.map (e.functor.map f) = (e.fun_inv_id.hom X) ≫ f ≫ (e.fun_inv_id.inv Y) := by obviously
@[simp,search] lemma fun_inv_map (e : C ≌ D) (X Y : D) (f : X ⟶ Y) :
e.functor.map (e.inverse.map f) = (e.inv_fun_id.hom X) ≫ f ≫ (e.inv_fun_id.inv Y) := by obviously
@[simp,search] lemma inv_fun_map (e : C ≌ D) (X Y : C) (f : X ⟶ Y) :
e.inverse.map (e.functor.map f) = (e.fun_inv_id.hom X) ≫ f ≫ (e.fun_inv_id.inv Y) := by obviously

variables {E : Type u₃} [ℰ : category.{u₃ v₃} E]
include
Expand Down Expand Up @@ -71,6 +73,7 @@ calc
... ⟶ _ : f.functor.map (e.inv_fun_id.inv.app _)

set_option trace.tidy true
open tidy.rewrite_search.tracer

-- -- With rewrite_search and good caching, we could just write:
-- def trans (e : C ≌ D) (f : D ≌ E) : C ≌ E :=
Expand Down Expand Up @@ -102,10 +105,12 @@ def trans (e : C ≌ D) (f : D ≌ E) : C ≌ E :=
end },
inv := { app := λ X, id_effe e f X, naturality' :=
begin
-- sorry
dsimp [id_effe],
intros X Y f_1,
simp at *, dsimp at *,
sorry
-- dsimp [id_effe],
-- intros X Y f_1,
-- simp at *, dsimp at *,
-- rewrite_search { trace_summary := tt, trace_result := tt, view := visualiser, optimal := ff }
-- nth_rewrite_lhs 0 ←category.assoc,
-- nth_rewrite_rhs 2 ←category.assoc,
-- nth_rewrite_rhs 3 ←category.assoc,
Expand Down

0 comments on commit 8a5a26d

Please sign in to comment.