A basis is by definition a maximal linearly independent subset. This means that B is a basis of V if and only if B is linearly independent, and for all ##x\in V-B##, ##B\cup\{x\}## is linearly dependent. Because of this, the existence of a basis in the finite dimensional case is actually trivial (if you understand the definitions perfectly).
A vector space V is said to be infinite dimensional if for all positive integers n, there's a linearly independent subset of V with cardinality n.
A vector space V that isn't infinite dimensional is said to be finite dimensional.
The dimension of a non-trivial (i.e. ##\neq\{0\}##) finite-dimensional vector space V is defined as the largest integer n such that V has a linearly independent subset with cardinality n. This integer is denoted by dim V.
Theorem: Every non-trivial finite-dimensional vector space has a basis.
Proof: Let n be an arbitrary positive integer. Let V be an arbitrary vector space such that dim V=n. Let B be an arbitrary linearly independent subset of V with cardinality n. Clearly, for all ##x\in V-B##, ##B\cup\{x\}## must be linearly dependent, because otherwise we would have dim V≥n+1>n.
The standard proof for the arbitrary case uses Zorn's lemma (which is equivalent to the axiom of choice). You will have to study some definitions to understand it. (In particular, the definition of "partially ordered set").
Theorem: Every non-trivial vector space has a basis.
Proof: Let V be an arbitrary non-trivial vector space. Let S be the set of all linearly independent subsets of V, partially ordered by inclusion. Let T be an arbitrary totally ordered subset of S. Clearly, ##\bigcup T## is an upper bound of T. Since every totally ordered subset has an upper bound, Zorn's lemma tells us that S has a maximal element.