Is the adjective 'regular' necessary in the definition of Platonic solids? The definition I mean can be found in the tag Wiki of Platonic solid tag and also in Wikipedia:

Definition 1:
A Platonic solid is a regular, convex polyhedron with congruent faces
  of regular polygons and the same number of faces meeting at each
  vertex.

Here the role of the first 'regular' adjective is a bit obscure for me. Take the following definition:

Definition 2:
A Platonic solid is a convex polyhedron with congruent faces
  of regular polygons and the same number of faces meeting at each
  vertex.

Is there any polyhedron that Platonic by definition 2 and isn't Platonic by definition 1?
 A: You're absolutely right, the two definitions are equivalent. Here's my perspective on the differences in definitions of regularity, and why flag-transitivity is superior, in general.
In two dimensions: 

Regular polygons are those that have equal edges and equal angles.

Then, we use this definition to define "regular" in three dimensions:

Regular polyhedra are those with congruent regular faces, with a constant number meeting at each vertex.

How should we define "regular" $4$-dimensional polytopes?
We could try and mimic the definitions above; its $3$-dimensional faces (facets) should be congruent regular polytopes of one smaller dimension, but what should we make of the vertices? Is it enough to say that "an equal number of facets meet at each vertex", or could the configuration of facets start to play a role, in dimension $4$ or higher? Worse still, do we need to mention anything besides the vertices, in order to ensure the symmetry we wish to describe?
So, rather than search for a theorem that says, "The configuration of facets meeting at a vertex doesn't affect regularity, only the number. Further, only vertices matter, to build a regular polytope from smaller-dimensional regular polytopes", assuming such a theorem even exists, we adopt a more succinct (albeit more abstract) definition of regularity.
We define a flag of a $d$-dimensional polytope $\mathcal{P}$ to be a sequence of faces
$$F_0 \subseteq F_1 \subseteq \ldots f_{d - 1} \subseteq F_d$$
of $\mathcal{P}$, the face $F_k$ having dimension $k$. Then we say that

A polytope is regular if its symmetry group acts transitively on its set of flags.

If we take the time to really understand this definition, it's describing exactly the property the more verbose definitions captures. Not only does every $k$-dimensional face of our polytope "look the same", but every "chain" of faces does: Each $k$-dimensional face has exactly the same relationship with its constituent $(k-1)$-dimensional faces, and our polytope is as symmetric as possible.
So, while it may take a little more time to parse the definition initially, it can describe regular polytopes of any dimension with ease, without resorting to a recursive definition of regularity of facets and some kind of "gluing" instructions on how the facets must be assembled.
