This is being done in the context of a Hilbert system in propositional logic.
But let's assume we've already proven all the axioms are tautologies / will always be true.
How then are we showing that modus ponens is also valid? (or is valid the wrong word to use here? Normally, "valid" for a statement means the logic holds IF the premises were true, but premises being true is what makes it actually sound... but when it comes to inference rules I don't know the terminology)
$P, (P \to Q) \vdash Q$
Is this strictly an informal "look at the truth tables and reason it out" kind of thing?
i.e. if we assume $P$ is true and $P \to Q$ is true because they are each reducible to either true axioms or true atomic propositions, then we know $P \to Q = \top$ becomes $\top \to Q = \top$. And in the truth tables for $\to$, this only has one solution, i.e. where $Q = \top$, therefore modus ponens holds? Or are we now showing that $P, (P \to Q) \vDash Q$?
I mean is that it? Or is it a more formal approach? I get totally lost when it comes to understanding and manipulating / proving things with these metalogical symbols.