Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.congr_of_eventuallyEq
∀ {f g : ℝ → ℝ},
f =ᶠ[Filter.atTop] g → AkraBazziRecurrence.GrowsPolynomially g → AkraBazziRecurrence.GrowsPolynomially f- Cited by
- 3 results in Mathlib
- Foundations
- Depth 106 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.
- Realstatement and proof · cited by 25,697
- Filter.Eventuallyproof · cited by 3,134
- Filter.atTopstatement and proof · cited by 2,405
- Filter.EventuallyEqstatement and proof · cited by 1,912
- Set.Iccproof · cited by 1,702
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- Set.Iooproof · cited by 1,214
- Filter.tendsto_idproof · cited by 180
- AkraBazziRecurrence.GrowsPolynomiallystatement and proof · cited by 41
- Filter.Tendsto.const_mul_atTopproof · cited by 30
- Filter.Tendsto.eventually_forall_ge_atTopproof · cited by 7
Cited by3
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.GrowsPolynomially.iff_eventuallyEqproof · cited by 3