`BookProof.FriedrichsSquare.fst_mem_clDom_of_mem_factorRel` {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorRel A) : p.1 ∈ clDom A
ProvedBookProof.FriedrichsSquare.fst_mem_clDom_of_mem_factorReltheoremstimepiece
Prove the following Lean 4 theorem from ChapterFriedrichsSquareFactorization.
BookProof.FriedrichsSquare.fst_mem_clDom_of_mem_factorRel {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorRel A) : p.1 ∈ clDom A
Formalization note: Lean 4 identifier BookProof.FriedrichsSquare.fst_mem_clDom_of_mem_factorRel.
Preamble
-- Generated from ChapterFriedrichsSquareFactorization.lean — theorem BookProof.FriedrichsSquare.fst_mem_clDom_of_mem_factorRel
import Definitions.Def_ChapterFarisLavine
import Mathlib
import Definitions.Def_ChapterFriedrichsSquareFactorization
import Definitions.Def_ChapterClosureUniqueness
import Definitions.Def_ChapterEsaClosureCore
open BookProof.ClosureUniqueness
open BookProof.EsaClosure
open BookProof.FriedrichsSquare
open BookProof.FarisLavine BookProof.EsaClosure BookProof.ClosureUniqueness
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F]
variable {D : Submodule ℂ F}Formal statement
theorem BookProof.FriedrichsSquare.fst_mem_clDom_of_mem_factorRel {A : D →ₗ[ℂ] F} {p : F × F} (hp : p ∈ factorRel A) :
p.1 ∈ clDom A := by sorry