I remember slaving over the notation in this book when I was a bad undergraduate. It brings up some interesting memories, some which may help you.
- $F(x)$ is the cumulative distribution of a single bidder's valuation.
- $G(x)$ is the cumulative distribution of the highest bidder's valuation, given $N$ bidders.
For the example you are referring to, values being uniformly distributed along $[0,1]$ implies $F(x) = x.$ That's pretty straightforward. The chance of you having a valuation of $\frac{1}{2}$ or less for the object is, well, $\frac{1}{2}$. The chance of you having at least a value of $1$ should be a probability of $1$.
But why is $G(x) = x^{N-1}$ ?
For $n =1$, the chance of your valuation being the largest valuation or less is...well, $1 \ (= x^0)$.
For $n = 2$, the chance of your valuation being the largest valuation or less is just the chance that the other bidder has a valuation lower than you, or exactly $x$.
For $n = 3$, the chance of your valuation being the biggest or less is just the chance that both other bidders value the object less. Since you're working with independent private values, you can think of their valuations as independent (duh) events, so you can just multiply the events together. (More on conditional probability here). So for example the chance of someone having a smaller value than you is $x$, but there is another person who also has to have a smaller value than you, with the same chance $x$. The chance of both of them having smaller values than you is $x \cdot x = x^2$.
So it goes, the more bidders (independent valuations) you have.
So we have your general formula for an optimal bid under a first-price auction:
$$\beta^1(x) = x - \int^x_0 \frac{G(y)}{G(x)} dy$$
So substitute in $G(x)$:
$$\beta^1(x) = x - \int^x_0 \frac{y^{N-1}}{x^{N-1}} dy$$
Evaluate:
$$= x \ - \ \biggr\lvert \frac{y^N}{Nx^{N-1}} + c\biggr\rvert^x_0$$
$$= x - \frac{x}{N} = \frac{Nx}{N} - \frac{x}{N}$$
$$\boxed{\beta^1(x) = x\frac{N - 1}{N}}$$
The next example in Krishna's book has an exponential distribution, but only with two bidders. If you try using the same line of reasoning as I used above to find $G(x)$, you'll notice things appear a bit difficult, but the author doesn't explicitly state $G(x)$ in this case in fact. Try seeing for yourself if you understand why Krishna gives the helpful statement:
$$\frac{G(y)}{G(x)} = \left[\frac{F(y)}{F(x)}\right]^{N-1}$$
for the generic case where there is no functional form for the distributions.