Feige's inequality gives an upper tail bound for sums of independent nonnegative random variables and has many combinatorial applications. In this expository note, we present a simplified, self-contained proof and explain the motivation behind each step. We also discuss its application to perfect matchings in hypergraphs with large minimum degree.