Peano axioms or ZFC apply only to sufficiently complex and meaningful Axiomatic system, and both can be avoided if there is only a single element or only two truth values.
If you have a finite axioms in Axiomatic system, no matter how much you build and establish theories within that system, it can be like the continuum hypothesis where it is not inconsistent whether this is true or false.
In a consistent mathematical system, there must exist at least one proposition that cannot be proven. No matter how meticulously an Axiomatic system is designed to avoid this, it cannot be avoided. This is proven by the incompleteness theorem. The set of propositions provable in first-order logic precisely has a model. In other words, there necessarily exists a case where the truth defined by proof theory and the truth defined by model theory coincide.
2nd Gödel’s incompleteness theorem
A sufficiently complex axiomatic mathematical system cannot prove its own consistency. In other words, when a mathematical system tries to prove that it is not contradictory, it becomes incomplete.