Development/AbelianVarietyTheory/Proofs/DecoratedLatticeProofs/ThetaChainUpwardInductionFixedMetric.lean
51| @step k s Θ _ s' hs' p hp ih =>52intro hk53obtain ⟨hsk, ih⟩ := ih (by omega)54refine ⟨hs', fun ipD' ip' h' => ?_⟩55obtain ⟨ipD, ip, hm⟩ := hMet c hc k (by omega) s hsk56obtain ⟨x, hx, hxp⟩ := ih ipD ip hm57obtain ⟨x', hx', hx'p⟩ := hSU hgap c hc k (by omega) s s' hsk hs' p hp ipD ip ipD' ip' hm h' x (chainPar c B k) hxp58(hL k (by omega))59refine ⟨x', fun y => ?_, ?_⟩60· rw [hx', hx]61rfl62· rw [chainPar_succ]63exact hx'p6465theorem reach_is {D : D7} {c : Com D} {s₀ : PiLocalization₂ D} (hs₀ : s₀.Is c 0) {k : ℕ} {s : PiLocalization₂ D} {Θ : s.CC c →ₗ[ℂ] s₀.CC c}66(hR : Reach c s₀ k s Θ) : s.Is c k := by67cases hR with68| zero => exact hs₀69| step _ hs' _ _ => exact hs'7071theorem chainUp_of : ∀ D : D7, MetEx D → ParBoundW D → ChainLW D → StepUp D → ChainUp D := by72intro D hMet hPB hCL hSU hgap c hc s₀ hs₀ k hk s Θ hR73refine ⟨reach_is hs₀ hR, fun ipD₀ ip₀ ipD ip h₀ h u B hu => ?_⟩74have hb := hPB c hc 0 (Nat.zero_le _) s₀ hs₀ u B hu75have hr : s₀.V.rank = D.R.r := by rw [hs₀.rank]; simp [Formalism.BasicNotions.Ranks.rankY]76rw [hr] at hb77exact (thetaChain_upward_induction_fixed_metric hMet hSU hgap hc hs₀ h₀ hu (fun k hk => hCL c hc B hb k hk) hR hk).2 ipD ip h7879end GlobalTheory.ChainOnto8081end