Is Lagrange's theorem the most basic result in finite group theory? Motivated by this question, can one prove that the order of an element in a finite group divides the order of the group without using Lagrange's theorem? (Or, equivalently, that the order of the group is an exponent for every element in the group?)
The simplest proof I can think of uses the coset proof of Lagrange's theorem in disguise and goes like this: take $a \in G$ and consider the map $f\colon G \to G$ given by $f(x)=ax$. Consider now the orbits of $f$, that is, the sets $\mathcal{O}(x)=\{ x, f(x), f(f(x)), \dots \}$. Now all orbits have the same number of elements and $|\mathcal{O}(e)| = o(a)$. Hence $o(a)$ divides $|G|$.
This proof has perhaps some pedagogical value in introductory courses because it can be generalized in a natural way to non-cyclic subgroups by introducing cosets, leading to the canonical proof of Lagrange's theorem. 
Has anyone seen a different approach to this result that avoids using Lagrange's theorem? Or is Lagrange's theorem really the most basic result in finite group theory?

I am late...
Here is a proposal, probably not far from Ihf's answer.
For $a \in G$ of order $p$, 
define the binary relation 
 $x\cal Ry$ : $\exists k\in \mathbb{N} ; k<p$ such that $y=a^kx$
$\cal R$ is an equivalence relation on $G$ and sets up a partition of $G$.
A class is defined by $C_x=\left\{a^kx|k=0,1,\ldots,p-1 \right\}$
All the classes have $p$ elements, then $n=|G|$ is a multiple of $p$ ; $(n=pm)$ and $a^n=a^{pm}=e$
