import Development.AbelianVarietyTheory.Definitions.Divisors.ToRingActOpOfRingAct
import Development.AbelianVarietyTheory.Definitions.Divisors.NonemptyHomFixRepTrivial
import Development.AbelianVarietyTheory.Definitions.ModuliSpaces.IsGaloisCover
open AlgebraicGeometry CategoryTheory Limits MonoidalCategory CartesianMonoidalCategory MonObj
open ReciprocityTheory.ChartRestriction.G ReciprocityTheory.ChartRestriction.G.Semi ReciprocityTheory.ChartRestriction.G.Geo.Tor
open GlobalTheory.EndLoc
open scoped CategoryTheory.Obj

namespace GlobalTheory.EndLoc

theorem eq_unit_of_pullback_eq : ∀ (S : Scheme.{0}) (A B : Over S) [GrpObj A] [IsCommMonObj A] [GrpObj B] [IsCommMonObj B]
    (u v : A ⟶ B), IsAbelianScheme A → IsAbelianScheme B → IsMonHom u → IsMonHom v → ∀ (T : Scheme.{0}) (t : T ⟶ S)
    (A' : Over T) [GrpObj A'] (φ' : A'.left ⟶ A.left), IsGrpPullback A' A t φ' → φ' ≫ u.left = φ' ≫ v.left →
    ∀ τ : T, ∀ x : A.left, A.hom x = t τ → (u * v⁻¹).left x = (η[B]).left (t τ) := by
  intro S A B _ _ _ _ u v _ _ _ _ T t A' _ φ' hp he τ x hx
  have hw : φ' ≫ A.hom = A'.hom ≫ t := hp.1.w
  let P : Over.mk (A'.hom ≫ t) ⟶ A := Over.homMk φ' (by simpa using hw)
  have hPu : P ≫ u = P ≫ v := by
    ext1; simpa [P] using he
  have h1 : P ≫ (u * v⁻¹) = 1 := by
    rw [comp_mul, GrpObj.comp_inv, hPu, mul_inv_cancel]
  have h2 : φ' ≫ (u * v⁻¹).left = A'.hom ≫ t ≫ (η[B]).left := by
    have := congrArg CommaMorphism.left h1
    simpa [P, Hom.one_def] using this
  obtain ⟨z, hz1, hz2⟩ := Scheme.Pullback.exists_preimage_pullback x τ hx
  have hf : (hp.1.isoPullback.inv ≫ φ') z = x := by rw [hp.1.isoPullback_inv_fst]; exact hz1
  have hs : (hp.1.isoPullback.inv ≫ A'.hom) z = τ := by rw [hp.1.isoPullback_inv_snd]; exact hz2
  rw [Scheme.Hom.comp_apply] at hf hs
  rw [← hf, ← Scheme.Hom.comp_apply, h2, Scheme.Hom.comp_apply, Scheme.Hom.comp_apply, hs]

end GlobalTheory.EndLoc
