Theorem: DividedPowerAlgebra.T_free_and_D_to_QSplit
Proof state before:
case h.refine_1.mk.codisjoint.intro.intro.intro.intro.intro
R✝ : Type u
inst✝⁶ : CommRing R✝
A : Type u
inst✝⁵ : CommRing A
inst✝⁴ : DecidableEq A
S✝ : Type u
inst✝³ : CommRing S✝
inst✝² : Algebra A S✝
I✝ : Ideal S✝
hI✝ : DividedPowers I✝
S₀✝ : Subalgebra A S✝
hIS₀✝ : IsCompl (Subalgebra.toSubmodule S₀✝) (Submodule.restrictScalars A I✝)
condTFree : CondTFree A
condD : CondD A
hM✝ : DividedPowers (augIdeal A (↥I✝ →₀ A))
hM_eq✝ : ∀ (n : ℕ) (x : ↥I✝ →₀ A), hM✝.dpow n ((ι A (↥I✝ →₀ A)) x) = dp A n x
S : Type u
inst✝¹ : CommRing S
inst✝ : Algebra A S
I : Ideal S
hI : DividedPowers I
S₀ : Subalgebra A S
hIS₀ : IsAugmentation (↥S₀) I
M : Type u := ↥I →₀ A
R : Type u := MvPolynomial (↥S₀) A
D : Type u := DividedPowerAlgebra A M
hM : DividedPowers (augIdeal A M)
hM_eq : ∀ (n : ℕ) (x : M), hM.dpow n ((ι A M) x) = dp A n x
hdpM_free : Module.Free A D
hR_free : Module.Free A R
T : Type u := R ⊗[A] D
idK : Ideal T := K A ⊥ (augIdeal A M)
hidK : idK = Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M)
hK : DividedPowers idK := Exists.choose ⋯
this : MvPolynomial (↥S₀) A →ₐ[A] MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M
hd :
  Disjoint (Subalgebra.toSubmodule ⊥)
    (Submodule.restrictScalars (MvPolynomial (↥S₀) A) (Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M)))
hc :
  Codisjoint (Subalgebra.toSubmodule ⊥)
    (Submodule.restrictScalars (MvPolynomial (↥S₀) A) (Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M)))
z : MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M
hz : z ∈ Submodule.restrictScalars (MvPolynomial (↥S₀) A) (Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M))
y : MvPolynomial (↥S₀) A
a✝ : (algebraMap (MvPolynomial (↥S₀) A) (MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M)) y + z ∈ ⊤
⊢ (algebraMap (MvPolynomial (↥S₀) A) (MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M)) y ∈
    Set.range ⇑(algebraMap (↥(Subalgebra.restrictScalars A ⊥)) T)
Tactic:
simp only [Algebra.TensorProduct.algebraMap_apply, Algebra.id.map_eq_id,
  RingHom.id_apply, Set.mem_range, Subtype.exists,
  Subalgebra.mem_restrictScalars]
Proof state after:
case h.refine_1.mk.codisjoint.intro.intro.intro.intro.intro
R✝ : Type u
inst✝⁶ : CommRing R✝
A : Type u
inst✝⁵ : CommRing A
inst✝⁴ : DecidableEq A
S✝ : Type u
inst✝³ : CommRing S✝
inst✝² : Algebra A S✝
I✝ : Ideal S✝
hI✝ : DividedPowers I✝
S₀✝ : Subalgebra A S✝
hIS₀✝ : IsCompl (Subalgebra.toSubmodule S₀✝) (Submodule.restrictScalars A I✝)
condTFree : CondTFree A
condD : CondD A
hM✝ : DividedPowers (augIdeal A (↥I✝ →₀ A))
hM_eq✝ : ∀ (n : ℕ) (x : ↥I✝ →₀ A), hM✝.dpow n ((ι A (↥I✝ →₀ A)) x) = dp A n x
S : Type u
inst✝¹ : CommRing S
inst✝ : Algebra A S
I : Ideal S
hI : DividedPowers I
S₀ : Subalgebra A S
hIS₀ : IsAugmentation (↥S₀) I
M : Type u := ↥I →₀ A
R : Type u := MvPolynomial (↥S₀) A
D : Type u := DividedPowerAlgebra A M
hM : DividedPowers (augIdeal A M)
hM_eq : ∀ (n : ℕ) (x : M), hM.dpow n ((ι A M) x) = dp A n x
hdpM_free : Module.Free A D
hR_free : Module.Free A R
T : Type u := R ⊗[A] D
idK : Ideal T := K A ⊥ (augIdeal A M)
hidK : idK = Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M)
hK : DividedPowers idK := Exists.choose ⋯
this : MvPolynomial (↥S₀) A →ₐ[A] MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M
hd :
  Disjoint (Subalgebra.toSubmodule ⊥)
    (Submodule.restrictScalars (MvPolynomial (↥S₀) A) (Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M)))
hc :
  Codisjoint (Subalgebra.toSubmodule ⊥)
    (Submodule.restrictScalars (MvPolynomial (↥S₀) A) (Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M)))
z : MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M
hz : z ∈ Submodule.restrictScalars (MvPolynomial (↥S₀) A) (Ideal.map Algebra.TensorProduct.includeRight (augIdeal A M))
y : MvPolynomial (↥S₀) A
a✝ : (algebraMap (MvPolynomial (↥S₀) A) (MvPolynomial (↥S₀) A ⊗[A] DividedPowerAlgebra A M)) y + z ∈ ⊤
⊢ ∃ a, ∃ (h : a ∈ ⊥), (algebraMap (↥(Subalgebra.restrictScalars A ⊥)) T) ⟨a, ⋯⟩ = y ⊗ₜ[A] 1