-- Lean 4 proof step from Mathlib.RingTheory.Unramified.Field (goal)
Goal:
K : Type u_1
A : Type u_2
inst : Field K
inst_1 : CommRing A
inst_2 : Algebra K A
inst_3 : FormallyUnramified K A
inst_4 : EssFiniteType K A
inst_5 : IsAlgClosed K
inst_6 : IsLocalRing A
this_1 : Module.Finite K A
this_2 : IsArtinianRing A
e : AlgEquiv.{u_1, u_1, u_2} K K (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A)) :=
  let __spread.0 : AlgHom.{u_1, u_1, u_2} K K (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A)) :=
    ofId K (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A));
  let __spread.1 : Equiv.{u_1 + 1, u_2 + 1} K (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A)) :=
    Equiv.ofBijective
      (⇑(algebraMap K (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A))) :
        (a : K) → A ⧸ IsLocalRing.maximalIdeal A)
      ⋯;
  {
    toFun :=
      (↑(↑__spread.0.toRingHom : K →* A ⧸ IsLocalRing.maximalIdeal A) :
          OneHom K (A ⧸ IsLocalRing.maximalIdeal A)).toFun,
    invFun := __spread.1.invFun, left_inv := ⋯, right_inv := ⋯, map_mul' := ⋯, map_add' := ⋯, commutes' := ⋯ }
e' : A ⊗[K] HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A) ≃ₐ[A] A :=
  AlgEquiv.trans (A₂ := A ⊗[K] K)
    (TensorProduct.congr AlgEquiv.refl e.symm :
      A ⊗[K] HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A) ≃ₐ[A] A ⊗[K] K)
    (TensorProduct.rid K A A : A ⊗[K] K ≃ₐ[A] A)
f : HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A) →ₗ[A] A :=
  e'.toLinearMap ∘ₗ sec K A (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A))
hf :
  AlgHom.toLinearMap (ofId A (HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A))) ∘ₗ f = LinearMap.id
hf₁ :
  HSMul.hSMul (α := A) (β := HasQuotient.Quotient A (B := Ideal A) (IsLocalRing.maximalIdeal A))
      ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) 1 =
    1
hf₂ :
  Membership.mem (γ := Ideal A) (IsLocalRing.maximalIdeal A)
    (HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A))
hf₃ : IsIdempotentElem (HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A))
n : ℕ
hn : HPow.hPow (α := Ideal A) (IsLocalRing.maximalIdeal A) n = 0
this : HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) ^ n = 0
rw : Eq (α := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A)
rw₁ : HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) = 0
rw₂ : HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) ^ (n + 1) = 0
rw₃ :
  HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) ^ n *
      HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) =
    0
rw₄ : 0 * HSub.hSub (α := A) (β := A) (1 : A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) = 0
⊢ Eq (α := A) ((f : (a : A ⧸ IsLocalRing.maximalIdeal A) → A) 1 : A) (1 : A)
have rw₅ : Eq.{u_2 + 1} (α := A) 0 0
Tactic: rw [eq_comm, ← sub_eq_zero, ← hf₃.pow_succ_eq n, pow_succ, this, zero_mul]