Tchebyshev and prime counting

Using properties of factorials and the prime factorization of to get lower and upper bounds on the number of primes less than a number

Sylvester improved the idea to get better bounds. But can we reach prime number theorem along these lines?