Development/AutomorphicArithmetic/ShortNorms/supplyOfAdmOf.lean
101have hq' : (H0.QS : ℝ) ≤ 4 * ψ.N * R.toFrame.ord := by exact_mod_cast hQSle102have hord : (R.toFrame.ord : ℝ) = c * 2 ^ e := by rw [hφord]; push_cast; ring103have hn : (0 : ℝ) ≤ R.n := Nat.cast_nonneg _104have hN : (0 : ℝ) ≤ ψ.N := Nat.cast_nonneg _105rw [hord] at hq'106have h5 := hW.n_up107nlinarith [mul_le_mul_of_nonneg_left h5 (by positivity : (0 : ℝ) ≤ 4 * ψ.N),108mul_le_mul_of_nonneg_left hnlo (by positivity : (0 : ℝ) ≤ 8 * ψ.N),109mul_le_mul_of_nonneg_right hCN hn]110obtain ⟨H, q0, hH, hCT, hGood, hSh⟩ := hA s R H0 ψ.N Y hs (h1A.trans hx) hRV111(by rw [hsJ]; exact hCJ) (by rw [hφo]; exact hCo) hQS hN0112(by have : (0 : ℝ) ≤ ψ.N := Nat.cast_nonneg _; linarith)113(by rw [hφe]; exact hQSdvd) ⟨by rw [hsJ]; exact hW.lo, hW.up⟩114(by rw [hHq, hHd]; exact hW.good) hFR hAdmR115subst hH116refine ⟨R, H, q0, hRV, hCT, hGood, ?_, ?_⟩117· have hprime : ∀ l : ℕ, Nat.Prime l → l ∣ H.QS → l ∣ 2 * ψ.N := by118intro l hl hlQ119have h1 : l ∣ 2 ^ (e + 2) * ψ.N := hlQ.trans (hQSdvd.trans (Nat.lcm_dvd (dvd_mul_right _ _) (dvd_mul_left _ _)))120rcases (Nat.Prime.dvd_mul hl).1 h1 with h2 | h2121· have h3 := (Nat.prime_dvd_prime_iff_eq hl Nat.prime_two).1 (hl.dvd_of_dvd_pow h2)122subst h3123exact dvd_mul_right 2 _124· exact dvd_mul_of_dvd_right h2 2125have hbd := UpperTheory.Top.boundedTw ψ R.toFrame H.toHostRaw eps Y s.x heps hx1.le hW.up htw hker.1 hprime126(by rw [hHq, hHd]; exact hW.good)127rw [hs] at hSh ⊢128exact ⟨hφo, hkept, hps, hSh, hbd.1, hbd.2⟩129· have hCF := UpperTheory.Top.isChiField ψ R.toFrame H.toHostRaw hker130rw [hφe, hHq, hHd] at hCF131have hv := hW.bound H.E hCF132refine hv.mono ?_ (le_of_eq ?_)133· apply Nat.le_floor134exact hT s R hs (h1T.trans hx) hRV135· rw [Formalism.BasicNotions.Scale.b, Formalism.BasicNotions.Scale.L, hs]