awhecmu/canonical-drafter-extract-mathlib huggingface dataset:
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this_3 : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
this : Mono (u ≫ pushout.desc a b ⋯) := ⋯
h'_w :
  Eq (α := pullback m₁ l₁ ⟶ Z) ((snd m₁ l₁ ≫ snd f u) ≫ u ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₁ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (snd m₁ l₁ ≫ snd f u ≫ u ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₂ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (snd m₁ l₁ ≫ fst f u ≫ f ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₃ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (snd m₁ l₁ ≫ fst f u ≫ g ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₄ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (fst m₁ l₁ ≫ m₁ ≫ g ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
⊢ Eq (α := pullback m₁ l₁ ⟶ A) (snd m₁ l₁ ≫ snd f u) (fst m₁ l₁ ≫ snd g u)
have h'_w₅ : Eq (α := pullback m₁ l₁ ⟶ Z) (fst m₁ l₁ ≫ m₁ ≫ g ≫ pushout.desc a b sorry) (fst m₁ l₁ ≫ snd g u ≫ u ≫ pushout.desc a b sorry)
Tactic: rw [← cancel_mono (u ≫ pushout.desc a b pullback.condition), Category.assoc,
          ← sq_f_u.w_assoc, w, ← pullback.condition_assoc, Category.assoc, ← sq_g_u.w_assoc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this_3 : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
this : Mono (u ≫ pushout.desc a b ⋯) := ⋯
h'_w :
  Eq (α := pullback m₁ l₁ ⟶ Z) ((snd m₁ l₁ ≫ snd f u) ≫ u ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₁ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (snd m₁ l₁ ≫ snd f u ≫ u ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₂ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (snd m₁ l₁ ≫ fst f u ≫ f ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₃ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (snd m₁ l₁ ≫ fst f u ≫ g ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₄ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (fst m₁ l₁ ≫ m₁ ≫ g ≫ pushout.desc a b ⋯)
    ((fst m₁ l₁ ≫ snd g u) ≫ u ≫ pushout.desc a b ⋯)
h'_w₅ :
  Eq (α := pullback m₁ l₁ ⟶ Z) (fst m₁ l₁ ≫ m₁ ≫ g ≫ pushout.desc a b ⋯) (fst m₁ l₁ ≫ snd g u ≫ u ≫ pushout.desc a b ⋯)
⊢ Eq (α := pullback m₁ l₁ ⟶ A) (snd m₁ l₁ ≫ snd f u) (fst m₁ l₁ ≫ snd g u)
have h'_w₆ : Eq (α := pullback m₁ l₁ ⟶ Z) (fst m₁ l₁ ≫ m₁ ≫ g ≫ pushout.desc a b sorry) (fst m₁ l₁ ≫ fst g u ≫ g ≫ pushout.desc a b sorry)
Tactic: rw [← cancel_mono (u ≫ pushout.desc a b pullback.condition), Category.assoc,
          ← sq_f_u.w_assoc, w, ← pullback.condition_assoc, Category.assoc, ← sq_g_u.w_assoc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw : Eq (α := pullback m₁ l₂ ⟶ Z)
  ((fst m₁ l₂ ≫ g₁) ≫
    CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
      (pushout.desc a b sorry))
  ((snd m₁ l₂ ≫ f₂) ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
rw :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    ((fst m₁ l₂ ≫ g₁) ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw₁ : Eq (α := pullback m₁ l₂ ⟶ Z)
  (fst m₁ l₂ ≫
    g₁ ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b sorry))
  ((snd m₁ l₂ ≫ f₂) ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
rw :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    ((fst m₁ l₂ ≫ g₁) ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₁ :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    (fst m₁ l₂ ≫
      g₁ ≫
        CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
          (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw₂ : Eq (α := pullback m₁ l₂ ⟶ Z) (fst m₁ l₂ ≫ fst g u ≫ g ≫ pushout.desc a b sorry) ((snd m₁ l₂ ≫ f₂) ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
rw :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    ((fst m₁ l₂ ≫ g₁) ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₁ :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    (fst m₁ l₂ ≫
      g₁ ≫
        CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
          (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₂ : Eq (α := pullback m₁ l₂ ⟶ Z) (fst m₁ l₂ ≫ fst g u ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw₃ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ g ≫ pushout.desc a b sorry) ((snd m₁ l₂ ≫ f₂) ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
rw :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    ((fst m₁ l₂ ≫ g₁) ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₁ :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    (fst m₁ l₂ ≫
      g₁ ≫
        CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
          (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₂ : Eq (α := pullback m₁ l₂ ⟶ Z) (fst m₁ l₂ ≫ fst g u ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₃ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw₄ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ f ≫ pushout.desc a b sorry) ((snd m₁ l₂ ≫ f₂) ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
rw :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    ((fst m₁ l₂ ≫ g₁) ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₁ :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    (fst m₁ l₂ ≫
      g₁ ≫
        CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
          (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₂ : Eq (α := pullback m₁ l₂ ⟶ Z) (fst m₁ l₂ ≫ fst g u ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₃ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₄ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ f ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw₅ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ f ≫ pushout.desc a b sorry) (snd m₁ l₂ ≫ f₂ ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]
-- Lean 4 proof step from Mathlib.CategoryTheory.Adhesive.Basic (goal)
Goal:
J : Type v'
inst : Category.{u', v'} J
C : Type u
inst_1 : Category.{v, u} C
W X Y Z_1 : C
f_1 : W ⟶ X
g_1 : W ⟶ Y
h : X ⟶ Z_1
i : Y ⟶ Z_1
inst_2 : Adhesive.{v, u} C
Z A B : C
a : A ⟶ Z
b : B ⟶ Z
inst_3 : Mono a
inst_4 : Mono b
K : C
f g : K ⟶ pushout (X := pullback a b) (fst a b) (snd a b)
w : f ≫ pushout.desc a b ⋯ = g ≫ pushout.desc a b ⋯
u : A ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inl (fst a b) (snd a b)
v : B ⟶ pushout (X := pullback a b) (fst a b) (snd a b) := inr (fst a b) (snd a b)
this_1 : Mono u := ⋯
this_2 : Mono v := ⋯
sq_f_u : IsPullback (P := pullback f u) (fst f u) (snd f u) f u := ⋯
sq_f_v : IsPullback (P := pullback f v) (fst f v) (snd f v) f v := ⋯
sq_g_u : IsPullback (P := pullback g u) (fst g u) (snd g u) g u := ⋯
sq_g_v : IsPullback (P := pullback g v) (fst g v) (snd g v) g v := ⋯
l₁ : pullback f u ⟶ K := fst f u
f₁ : pullback f u ⟶ A := snd f u
l₂ : pullback f v ⟶ K := fst f v
f₂ : pullback f v ⟶ B := snd f v
m₁ : pullback g u ⟶ K := fst g u
g₁ : pullback g u ⟶ A := snd g u
m₂ : pullback g v ⟶ K := fst g v
g₂ : pullback g v ⟶ B := snd g v
w_1 : C
f' : w_1 ⟶ pullback f u
w_2 : w_1 ⟶ pullback f v
w_3 : w_1 ⟶ pullback a b
p₁ : IsPullback f' w_3 (snd f u) (fst a b)
left : IsPullback w_2 w_3 (snd f v) (snd a b)
h₁ : IsPushout f' w_2 (fst f u) (fst f v)
this : Mono f' := ⋯
sq₁₁ : IsPullback (P := pullback m₁ l₁) (fst m₁ l₁) (snd m₁ l₁) m₁ l₁ := ⋯
sq₁₂ : IsPullback (P := pullback m₁ l₂) (fst m₁ l₂) (snd m₁ l₂) m₁ l₂ := ⋯
rw :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    ((fst m₁ l₂ ≫ g₁) ≫
      CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
        (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₁ :
  Eq (α := pullback m₁ l₂ ⟶ Z)
    (fst m₁ l₂ ≫
      g₁ ≫
        CategoryStruct.comp (Y := pushout (X := pullback a b) (fst a b) (snd a b)) (inl (fst a b) (snd a b))
          (pushout.desc a b ⋯))
    ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₂ : Eq (α := pullback m₁ l₂ ⟶ Z) (fst m₁ l₂ ≫ fst g u ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₃ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ g ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₄ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ f ≫ pushout.desc a b ⋯) ((snd m₁ l₂ ≫ f₂) ≫ b)
rw₅ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ l₂ ≫ f ≫ pushout.desc a b ⋯) (snd m₁ l₂ ≫ f₂ ≫ b)
⊢ Eq (α := pullback m₁ l₂ ⟶ Z) ((fst m₁ l₂ ≫ g₁) ≫ a) ((snd m₁ l₂ ≫ f₂) ≫ b)
have rw₆ : Eq (α := pullback m₁ l₂ ⟶ Z) (snd m₁ l₂ ≫ snd f v ≫ v ≫ pushout.desc a b sorry) (snd m₁ l₂ ≫ f₂ ≫ b)
Tactic: rw [← _ ≫= pushout.inl_desc a b pullback.condition, Category.assoc, ← sq_g_u.w_assoc,
            sq₁₂.w_assoc, ← w, Category.assoc, pullback.condition_assoc, pushout.inr_desc]