Theorems · Theorem · number theory
Pell.eq_pellZd
∀ {a : ℕ} (a1 : 1 < a) (b : ℤ√↑(Pell.d✝ a1)), 1 ≤ b → Pell.IsPell b → ∃ n, b = Pell.pellZd a1 n- Defined in
- Mathlib.NumberTheory.PellMatiyasevic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LE.le.transproof · cited by 3,151
- le_of_ltproof · cited by 1,175
- Zsqrtdstatement and proof · cited by 105
- Pell.ynproof · cited by 37
- Pell.pellZdstatement and proof · cited by 13
- Pell.IsPellstatement and proof · cited by 9
- Int.ofNat_le_ofNat_of_leproof · cited by 6
- Pell.n_lt_xnproof · cited by 3
- Zsqrtd.le_of_le_leproof · cited by 2
- Zsqrtd.le_archproof · cited by 1
- Pell.eq_pell_lemproof · cited by 1
- Zsqrtd.natCast_valproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Pell.eq_pellproof · cited by 2