Theorems · Theorem · computer science
AkraBazziRecurrence.GrowsPolynomially.neg
∀ {f : ℝ → ℝ}, AkraBazziRecurrence.GrowsPolynomially f → AkraBazziRecurrence.GrowsPolynomially (-f)- Cited by
- 4 results in Mathlib
- Foundations
- Depth 103 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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.atTopproof · cited by 2,405
- 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
- neg_negproof · cited by 960
- AkraBazziRecurrence.GrowsPolynomiallystatement and proof · cited by 41
- neg_mul_eq_mul_negproof · cited by 15
Cited by4
Results whose statement or proof uses this declaration.
- AkraBazziRecurrence.GrowsPolynomially.absproof · cited by 3
- AkraBazziRecurrence.GrowsPolynomially.invproof · cited by 3
- AkraBazziRecurrence.GrowsPolynomially.mulproof · cited by 2
- AkraBazziRecurrence.GrowsPolynomially.neg_iffproof · cited by 0