The language of Propositional Calculus comprises of the logical connectives and sentential symbols $A,B,C$ etc. The sentential letters can have arbitrary semantics and truth values.
Two wff $\phi$ and $\psi$ can be 'independent' if there are truth assignments to the sentential symbols which make all four combinations TT,TF,FT,FF possible (and there is no wff $\theta$, such that $\theta(A,B) \iff (A \land B)$ are independent).
So sentential symbols $A,B$ etc are independent of each other.
If $\phi \rightarrow A$ is a tautology, then $\phi$ must be equivalent to $(A \land \psi)$ for some wff $\psi$. So no wff $\phi$ other than a contradiction can tautologically imply an infinite number of independent wffs, for than it would be an infinite conjunction.
However in first order logic, with an infinite number of constant symbols $a, b, c, ...$ in the language, we take as axioms, and hence as always true, the infinite number of wffs $\forall xP(x) \rightarrow P(a)$.
We could interpret $\forall xP(x)$, $P(a)$, etc as sentence symbols of propositional logic. So, how do we reconcile the above dichotomy?