I am wondering whether anyone knows an elementary (no number fields, no Brauer characters; ideally, not even passing to algebraic extensions) proof of the following fact:
Let $G$ be a finite group. Let $F$ be a field, and let $p = \operatorname{char} F$. We say that an element $g \in G$ is $p$-regular if the order of $g$ in $G$ is coprime to $\begin{cases} p, & \text{ if } p > 0 ; \\ 1, & \text{ if } p = 0 \end{cases}$. (Thus, for $p = 0$, each element of $G$ is $p$-regular.) We say that a conjugacy class $C$ of $G$ is $p$-regular if and only if each element of $C$ is $p$-regular (or, equivalently, at least one element of $C$ is $p$-regular).
A simple $FG$-module $U$ is said to be absolutely simple if $\operatorname{End}_{FG} U \cong F$ as $F$-algebras.
Theorem 1. The number of pairwise non-isomorphic absolutely simple $F$-modules is at most the number of $p$-regular conjugacy classes of $G$.
Theorem 1 is attributed to Brauer in Mark Wildon's Representation theory of the symmetric group, where it is used to verify that the simple $F S_n$-modules constructed as quotients of Specht modules (for $p$-regular partitions) comprise the whole list of absolutely simple $F S_n$-modules. Of course, when $p = 0$, Theorem 1 reduces to the well-known fact that the number of pairwise non-isomorphic absolutely simple $F$-modules is at most the number of conjugacy classes of $G$; this is not hard to prove elementarily (by arguing that their characters are orthonormal and therefore linearly independent). But how would one prove Theorem 1 in the general case?
(This is, of course, inspired by math.stackexchange question #2212663; but it is meant to be independent from it.)
Question 2. What if we replace "absolutely simple" by "simple"?