This is a followup question to Sentence equivalent to $\bigwedge_{i=1}^ \infty \sigma_i$ without using infinite conjunctions. We have a language $\mathcal{L}=\{R\}$ (with equality) where $R$ is a binary relation symbol. Let $\tau$ be the sentence saying $R$ is reflexive, symmetric, and transitive. For each $k \geq 1$, let $\sigma_k$ be the sentence saying there is exactly one equivalence class of size $k$.
I have some questions about this setup:
#1: If $\mathcal{A}, \mathcal{B}$ are $\mathcal{L}$-structures such that $\{\tau, \sigma_1, \sigma_2, \dots\}$ is satisfied by both, and if $\mathcal{A}, \mathcal{B}$ both have no infinite equivalence classes, then does this mean $Th(\mathcal{A})=Th(\mathcal{B})$? [Intuitively, I'm guessing this is true, but I don't understand how to see why formally.]
Assuming the answer to #1 is yes, (say $Th(\mathcal{A})=Th(\mathcal{B})=T$) then I have a further dilemma, or "paradox" if you will, that I'm having trouble resolving.
#2: How many complete 1-types of $T$ are there?
One wants to say there are $\aleph_0$ many, because it seems for each $n$ there should exist some complete 1-type $\Sigma_n(v)$ such that the formula $\theta_i(v)$ saying "$v$ is in the equivalence class of size $i$" belongs to $\Sigma_n(v)$ if and only if $n=i$. Moreover, it seems that an arbitrary complete 1-type $\Sigma(v)$ must be of the form $\Sigma_n(v)$ for some $n$, since there are no infinite equivalence classes.
On the other hand, it seems that each $\Sigma_n(v)$ is a principal complete 1-type, isolated by $\theta_i(u)$. [Correct me if I'm wrong. Once we know which equivalence class $u$ is in we know everything there is to know about $u$, so in particular we should have $T \models \forall v(\theta_n(v) \to \phi(v))$ for any $\phi \in \Sigma_n$, right?]
Now there's a theorem which says that a complete theory $T$ has infinitely many complete 1-types iff there exists at least some non-prinicpal complete 1-type. So the above two paragraphs seem to contradict each other. If there are $\aleph_0$ many complete 1-types, then there should be at least some non-prinicipal one. But if they're all principal, then there can't be $\aleph_0$ many. What have I done wrong?