Axiomatic definition of the real numbers and uncountability There are several approaches in defining the real numbers axiomatically and suppose that we have some set of axioms $A$ which completely characterize rational numbers and which does not mention anything about some representation of rational numbers in any way (representation is here something like decimal representation or representation by continued fractions). Now let us add completeness axiom ($ca$) which states that "every nonempty set $S$ of real numbers which is bounded above has a least upper bound". If we join $ca$ to the set of axioms $A$ then $A$ along with the $ca$ should completely characterize the real numbers.
My question is:

Can we prove that $\mathbb R$ is uncountable by only using axioms from the set $A$ together with the axiom $ca$?

 A: Since the phrasing of the question itself is a bit muddled, let me instead address the version of the question you stated in a comment:

all I wanted to know is if there is a way that only from the axioms for the real numbers we prove uncountability of the real numbers.

The answer is absolutely yes (assuming that by "axioms" you mean an axiomatic description of a structure in an ambient set theory, rather than some kind of self-contained first-order axiomatization).  In particular, the real numbers can be completely axiomatized as a complete ordered field: that is, a field $\mathbb{R}$ together with a total ordering compatible with the field structure, such that any nonempty set $S\subset\mathbb{R}$ with an upper bound has a least upper bound.
Let me sketch a proof from these axioms that $\mathbb{R}$ is uncountable.  Suppose $\mathbb{R}$ were countable, and $i:\mathbb{R}\to\mathbb{N}$ were an injection.  We have elements $0,1\in\mathbb{R}$ with $0<1$.  Moreover, the ordered field axioms imply that if $x,y\in\mathbb{R}$ satisfy $x<y$, then there exists an element $z\in\mathbb{R}$ such that $x<z<y$ (namely, $z=(x+y)/2)$.  Now define an increasing sequence $(x_n)$ and a decreasing sequence $(y_n)$ such that $x_n<y_n$ for all $n$ by induction.  Start with $x_0=0$ and $y_0=1$.  Given $x_n$ and $y_n$ with $x_n<y_n$, consider the set of all $z\in\mathbb{R}$ such that $x_n<z<y_n$.  This set is nonempty, and so it has a unique element $z$ which minimizes the value $i(z)$.  Let $x_{n+1}$ be that value $z$.  Similarly, there is a unique $w$ such that $x_{n+1}<w<y_n$ which minimizes the value $i(w)$ among all such $w$.  Let $y_{n+1}=w$.
Having constructed these sequences, let $S=\{x_n\}_{n\in\mathbb{N}}$.  This is a nonempty subset of $\mathbb{R}$, and it is bounded above (namely, by $y_n$ for any $n$).  So there is some $r\in \mathbb{R}$ that is the least upper bound of the set $S$.  Note that the numbers $y_n$ are all distinct, so the numbers $i(y_n)$ form an infinite subset of the natural numbers.  In particular, there must be some $n$ such that $i(y_{n+1})>i(r)$.  But I claim this is impossible.  Indeed, $y_{n+1}$ was defined to be the element $w\in\mathbb{R}$ such that $x_{n+1}<w<y_n$ which minimized $i(w)$.  But $r$ also satisfies $x_{n+1}<r<y_n$ ($r\geq x_{n+2}>x_{n+1}$ since $r$ is an upper bound of $S$, and $r\leq y_{n+1}<y_n$ since $r$ is the least upper bound of $S$ and $y_{n+1}$ is also an upper bound of $S$).  Since $i(r)<i(y_{n+1})$, this contradicts our definition of $y_{n+1}$.  This contradiction means that our injection $i$ cannot exist, i.e. $\mathbb{R}$ is uncountable.
For an alternate proof, you can define decimal expansions of real numbers from these axioms (though it takes a bit of work), and then do the usual diagonal argument.
A: This answer will be written assuming that you are coming from an amateur or undergraduate understanding of axioms, as is used in much of mathematics outside the study of mathematical logic. I will try not to say anything false, but I can't tell "the whole story" at this level. Please let me know in comments about areas of the answer that remain confusing.
I will call this common, informal reasoning "ordinary mathematics". It includes many informal principles for reasoning about mathematical objects and sets of mathematical objects. (In fact, many published mathematics papers outside mathematical logic work entirely in this informal system, so it is not just for amateurs and undergraduates.)
Characterizing the reals
In ordinary mathematics, there is a set of axioms that characterizes the rationals: they are the so-called field of fractions of the natural numbers. Of course, this doesn't "completely" characterize the rationals, because we still have to characterize the natural numbers. But I think this is good enough for the question at hand.
Now, given the rational numbers, there are ways to construct the real line axiomatically. One way is via Dedekind cuts, and in this context we can easily verify that the collection of Dedekind cuts of rationals satisfies the axiom of completeness and has the other properties we expect for the real line.
If we continue working in the same framework of ordinary mathematics, no additional axioms are needed to show that the reals are uncountable.  We can prove many things about the reals using ordinary mathematical methods and the fact that the reals satisfy the axiom of completeness. For example, we can prove that there is no real number that is greater than every natural number (see below). We abbreviate that last fact by saying that the reals are an Archimedean field.  
Many real analysis textbooks use only ordinary mathematical reasoning, along with the fact that the real numbers are a complete Archimedean ordered field, to prove all their results. One of these results is that the real numbers are uncountable. This can be proved in many ways, and I recommend picking up a good introductory textbook on real analysis to learn the details. I have used Understanding Analysis by Stephen Abbott, which I think is understandable and has a nice introduction to many properties of the reals. 
Formalization
In mathematical logic, one thing that we do it to try to formalize the principles of "ordinary mathematics", to see what formal axioms are actually needed. The seeds of this project were planted as early as Euclid, but it fully blossomed from the late 1800s through the early 1900s. Indeed, most of the major issues were understood by 1940.
What we learned is that no "formal system of axioms", in the sense that you would naively expect, can fully characterize the natural numbers, the rationals, the reals, or any other particular infinite structure. It turns out, because of the "finite" nature of a formal proof, that formal proofs are simply incapable of fully capturing the nuances of infinite structures. 
We can certainly write formal axioms that are true about the natural numbers, but these axioms will also be true of other stuctures, which we call "nonstandard" because they aren't the structure we really wanted to study. So the axioms won't characterize the naturals. For purpose of ordinary mathematics, though, we can ignore the nonstandard models, and know that whatever we prove in our formal systems really is true about the "standard" models we care about. 
Now, you may ask, how can we characterize the rationals in ordinary mathematics, but not in any formal system? The answer is essentially that, in ordinary mathematics, we begin with the set of natural numbers as a given object.  Similarly, we take other strucutres for granted, such as the powerset of the naturals. Relative to these starting objects, we can characterize the rationals, the reals, etc. In formal reasoning, we do not have these given structures to use as a reference, and there is no way to fully capture them with formal axioms. 
P.S.
Here is the promised argument that the set of natural numbers is unbounded in the reals, using only the axiom of completeness and ordinary mathematical reasoning. If the naturals were a bounded set in the reals, they would have a least upper bound, which we can call $s$. Then there must be some natural number in the interval $(s-1, s)$, or else $s-1$ would be a smaller upper bound than $s$, which is impossible because $s$ is the smallest upper bound. But, if there is a natural number $n$ in the interval $(s-1,s)$, then $n+1$ is a natural number greater than $s$, which is impossible if $s$ is an upper bound for the naturals. Overall, we see that the natural numbers cannot be a bounded set. 
