`BookProof.QgOuterFockCoreFL.CoreData.ext_graph_approx` (x : d.C.dom) (ε : ℝ) (hε : 0 < ε) : ∃ y : d.C.dom, (y : F) ∈ d.C₀ ∧ ‖(y : F) - (x : F)‖ < ε ∧ ‖d.ext y - d.ext x‖ < ε
ProvedBookProof.QgOuterFockCoreFL.CoreData.ext_graph_approxtheoremstimepiece
Prove the following Lean 4 theorem from ChapterFarisLavineOnly.
BookProof.QgOuterFockCoreFL.CoreData.ext_graph_approx (x : d.C.dom) (ε : ℝ) (hε : 0 < ε) : ∃ y : d.C.dom, (y : F) ∈ d.C₀ ∧ ‖(y : F) - (x : F)‖ < ε ∧ ‖d.ext y - d.ext x‖ < ε
Formalization note: Lean 4 identifier BookProof.QgOuterFockCoreFL.CoreData.ext_graph_approx.
Preamble
-- Generated from ChapterFarisLavineOnly.lean — theorem BookProof.QgOuterFockCoreFL.CoreData.ext_graph_approx
import Definitions.Def_ChapterFarisLavine
import Mathlib
import Definitions.Def_ChapterFarisLavineOnly
import Definitions.Def_ChapterQgOuterFockCoreFL
import Definitions.Def_ChapterLeafGaps
open BookProof.QgOuterFockCoreFL
open BookProof.QgOuterFockCoreFL
open scoped ENNReal
noncomputable section
open BookProof.FarisLavine
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] [CompleteSpace F]
variable (d : CoreData F)Formal statement
theorem BookProof.QgOuterFockCoreFL.CoreData.ext_graph_approx (x : d.C.dom) (ε : ℝ) (hε : 0 < ε) :
∃ y : d.C.dom, (y : F) ∈ d.C₀ ∧ ‖(y : F) - (x : F)‖ < ε ∧ ‖d.ext y - d.ext x‖ < ε := by sorry