No, $\mathfrak{p}$ and $\mathfrak{t}$ are two specific infinities that are in some sense (possibly) bigger than the infinity denoted as $\infty$ in that question.
Your question makes as much sense as: "I had two different bags of stones, and I checked, and it turns out that the two bags actually contain the same number of stones. Does that mean anything about this third bag of stones I just found?". I believe this analogy is deceptively good, since $\mathfrak{p}$ and $\mathfrak{t}$ are cardinals, which are just a generalisation of what we normally mean by "number of things in a thing"; two sets have the same cardinality if there is some way to match up the elements one-for-one without missing any elements on either side.
I strongly suspect that your mental model is missing a very large piece, namely the fact that there are (infinitely!) many different cardinals: $\mathbb{N}$ is strictly smaller than $\mathbb{R}$ (look up Cantor's diagonal argument, for example).
I'll actually digress and give my favourite argument that $\mathbb{R}$ is uncountable, rendered from http://people.math.gatech.edu/~mbaker/pdf/realgame.pdf:
Alice and Bob play a game. Alice starts at 0, Bob starts at 1, and they alternate taking turns (starting with Alice), each picking a number between Alice and Bob’s current numbers. (So start with $A:0$, $B:1$, then $A:0.5$, $B:0.75$, $A:0.6$, $\dots$ is an example of the start of a valid sequence of plays.) We fix a subset $S$ of $[0,1]$ in advance, and Alice will win if at the end of all time the sequence of numbers she has picked converges to a number in $S$; Bob wins otherwise. (Alice’s sequence does converge: it’s increasing and bounded above by $1$.)
It’s obvious that if $S = [0,1]$ then Alice wins no matter what strategy either of them uses: a convergent sequence drawn from $[0,1]$ must converge to something in $[0,1]$.
Also, if $S = \{s_1, s_2, \dots\}$ can be matched up one-to-one with $\mathbb{N}$ (that is, $S$ is countable, where I just wrote down a matching of $S$ with $\mathbb{N}$) then Bob has a winning strategy: at move $n$, pick $s_n$ if possible, and otherwise make any legal move. (Think for a couple of minutes to see why this is true: if Bob couldn’t pick $s_n$ at time $n$, then either Alice has already picked a number bigger, in which case she can’t ever get back down near $s_n$ again, or Bob has already picked a number $b$ which is smaller, in which case she is blocked off from reaching $s_n$ because she can’t get past $b$.)
So if $[0,1]$ is countable then Alice must win no matter what either of them does, but Bob has a winning strategy; contradiction.