Theorems · Theorem · number theory
GenContFract.exists_gcf_pair_rat_eq_nth_conts
∀ {K : Type u_1} [inst : Field K] [inst_1 : LinearOrder K] [inst_2 : FloorRing K] (v : K) (n : ℕ),
∃ conts, (GenContFract.of v).conts n = GenContFract.Pair.map Rat.cast conts- Cited by
- 2 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FieldLinearOrderFloorRing
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Fieldstatement and proof · cited by 7,404
- FloorRingstatement and proof · cited by 405
- GenContFract.Pairstatement and proof · cited by 85
- GenContFract.ofstatement · cited by 53
- GenContFract.contsstatement · cited by 18
- GenContFract.Pair.mapstatement and proof · cited by 7
- GenContFract.nth_cont_eq_succ_nth_contAuxproof · cited by 5
- GenContFract.exists_gcf_pair_rat_eq_of_nth_contsAuxproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- GenContFract.exists_rat_eq_nth_denproof · cited by 1
- GenContFract.exists_rat_eq_nth_numproof · cited by 1