Completness theorem states that:
If $\tau$ is a first-order-sentence such that $\tau$ is valid (true under Any intrpretation), then $\tau$ is provable from the axiomatic frame of the first order logic.
To understant this, It's helpful to remember that while studying logic, we make a distinction between the syntatic and the semantic perspectives. we deal with the synax and semantics seperately and then tie them together by soundess and completness theorems.
In the syntax, you have some set of formulas called "logical axioms" which is a fixed set. and a set of sentences called "non-logical axioms" which varies according to the topic you have in mind and some "rules of inference " which tells you which sentences you can deduce from which.
You have to know that, non-logical axioms varies as mentioned, for example, if you discuss group theory then you will pick some axioms diffrent from those of topological spaces. So, non-logical axioms determine the theory you wish to work on. logical axioms represtent the axioms that are Always valid i.e. no matter which subject you work on, they are always satisfied, logical axioms could be something like $(a=b) \& (b=c) \rightarrow a=c$ " transitivity of equality relation"
For rules of inferences, if you have the rule called modes ponens in your system, it tells you that you can deduce the sentence $\alpha$ from the sentences $\beta\rightarrow\alpha , \beta$.
Then you can construct deductions, those are lists of sentences. every sentence is either a logical axiom or non-logical axiom or a sentence that is deduced from some earlier sentences by means of a rule of inference. A sentence $\sigma$ is provable if there is a deduction whose last sentence is $\sigma$.
For the semantic part, this is how you interpret the symbols, for example, you can say that your symbols represnt natural numbers and that the symbol # represents addition of numbers and so on. Some sentences will be true undersome intrepretations and false under some others. Some will be true under ALL of the intrpretations "those are called, valid sentences" and some will be false under any interpretation.
Now, completness theorem says that, If you are given a sentence which is valid i.e. true under any interpretation, then you will find a deduction which ends up with the that sentence. What does that mean is the you will find a proof for every valid sentence.