case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
obtain ⟨ev, bi, bu, hF⟩ :=
  denomsClearable_natDegree (b := b) (algebraMap ℤ K) f a
    (by
      rw [eq_intCast, one_div_mul_cancel]
      rw [Int.cast_ne_zero]
      exact b0.ne.symm)
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa :
  abs (↑(algebraMap ℤ K) ev) =
    abs (↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
obtain Fa := _root_.congr_arg abs hF
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = abs (↑b ^ natDegree f) * abs (eval (↑(algebraMap ℤ K) a * (1 / ↑b)) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa :
  abs (↑(algebraMap ℤ K) ev) =
    abs (↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
rw [eq_one_div_of_mul_eq_one_left bu, eq_intCast, eq_intCast, abs_mul] at Fa
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = abs (↑b ^ natDegree f) * abs (eval (↑(algebraMap ℤ K) a * (1 / ↑b)) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
rw [abs_of_pos (pow_pos (Int.cast_pos.mpr b0) _ : 0 < (b : K) ^ _), one_div, eq_intCast] at Fa
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ abs ev
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ ↑b ^ natDegree f * abs (eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f))
rw [div_eq_mul_inv, ←Fa, ← Int.cast_abs, ← Int.cast_one, Int.cast_le]
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
⊢ 1 ≤ abs ev
refine' Int.le_of_lt_add_one ((lt_add_iff_pos_left 1).mpr (abs_pos.mpr fun F0 => fab _))
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) b ^ natDegree f = 0 ∨
    eval (↑(algebraMap ℤ K) a * (↑(algebraMap ℤ K) b)⁻¹) (Polynomial.map (algebraMap ℤ K) f) = 0
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) ev =
    ↑(algebraMap ℤ K) b ^ natDegree f * eval (↑(algebraMap ℤ K) a * bi) (Polynomial.map (algebraMap ℤ K) f)
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
rw [eq_one_div_of_mul_eq_one_left bu, F0, one_div, eq_intCast, Int.cast_zero, zero_eq_mul] at hF
case intro.intro.intro.inl
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
hF : ↑(algebraMap ℤ K) b ^ natDegree f = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0

case intro.intro.intro.inr
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
hF : eval (↑(algebraMap ℤ K) a * (↑(algebraMap ℤ K) b)⁻¹) (Polynomial.map (algebraMap ℤ K) f) = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
case intro.intro.intro
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
hF :
  ↑(algebraMap ℤ K) b ^ natDegree f = 0 ∨
    eval (↑(algebraMap ℤ K) a * (↑(algebraMap ℤ K) b)⁻¹) (Polynomial.map (algebraMap ℤ K) f) = 0
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
cases' hF with hF hF
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
⊢ ↑b ≠ 0
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
⊢ ?m.157179 * ↑(algebraMap ℤ K) b = 1
rw [eq_intCast, one_div_mul_cancel]
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
⊢ b ≠ 0
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
⊢ ↑b ≠ 0
rw [Int.cast_ne_zero]
no goals
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
⊢ b ≠ 0
exact b0.ne.symm
no goals
case intro.intro.intro.inl
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
hF : ↑(algebraMap ℤ K) b ^ natDegree f = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
exact (not_le.mpr b0 (le_of_eq (Int.cast_eq_zero.mp (pow_eq_zero hF)))).elim
no goals
case intro.intro.intro.inr
K : Type u_1
inst✝ : LinearOrderedField K
f : ℤ[X]
a b : ℤ
b0 : 0 < b
fab : eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) ≠ 0
ev : ℤ
bi : K
bu : bi * ↑(algebraMap ℤ K) b = 1
Fa : abs ↑ev = ↑b ^ natDegree f * abs (eval (↑a * (↑b)⁻¹) (Polynomial.map (algebraMap ℤ K) f))
F0 : ev = 0
hF : eval (↑(algebraMap ℤ K) a * (↑(algebraMap ℤ K) b)⁻¹) (Polynomial.map (algebraMap ℤ K) f) = 0
⊢ eval (↑a / ↑b) (Polynomial.map (algebraMap ℤ K) f) = 0
rwa [div_eq_mul_inv]