Finite PAdaptive Tail Exponent certificate

import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.BigOperators.NatAntidiagonal
import Mathlib.Analysis.Analytic.Binomial
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Normed.Ring.Basic
import Mathlib.Analysis.SpecificLimits.Normed
import Mathlib.Data.Sym.Basic
import Mathlib.Data.Sym.Card
import Mathlib.LinearAlgebra.Matrix.Determinant.Basic
import Mathlib.LinearAlgebra.Matrix.NonsingularInverse
import Mathlib.RingTheory.Binomial
import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.GCongr
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_D1Bound5_FinitePAdaptiveTailData_Definitions
import Definitions.Def_D1Bound5_FinitePHeight_Definitions

section
namespace D1Bound5








theorem _root_.D1Bound5.finitePAdaptiveTailExponent_certificate (i : Fin 4) (l j t : Fin 3) :
    let u := finitePRootTerms i l j t
    u.2.1+u.2.2.1+u.2.2.2+3 ≤ (4+(l : ℕ))+2 ∧
    (j=0 → finitePAdaptiveTailExponent i l j t+u.2.2.1+u.2.2.2=2) ∧
    (j=1 → finitePAdaptiveTailExponent i l j t+u.2.2.1+u.2.2.2=(4+(l : ℕ))+2 ∧
      u.2.2.2 ≤ 2) ∧
    (j=2 → finitePAdaptiveTailExponent i l j t+u.2.2.1+u.2.2.2=(4+(l : ℕ))+2) := by sorry



end D1Bound5
end