Just as we can curry functions, so we can "curry" homomorphisms and actions.
Given an action ρ:G×X→X of group G on set X, we can consider what happens if we fix the first argument to ρ. Writing ρ(g) for the induced map X→X given by x↦ρ(g,x), we can see that ρ(g) is a bijection.
Indeed, we claim that ρ(g−1) is an inverse map to ρ(g). Consider ρ(g−1)(ρ(g)(x)). This is precisely ρ(g−1)(ρ(g,x)), which is precisely ρ(g−1,ρ(g,x)). By the definition of an action, this is just ρ(g−1g,x)=ρ(e,x)=x, where e is the group's identity.
We omit the proof that ρ(g)(ρ(g−1)(x))=x, because it is nearly identical.
That is, we have proved that ρ(g) is in Sym(X), where Sym is the Symmetric group; equivalently, we can view ρ as mapping elements of G into Sym(X), as well as our original definition of mapping elements of G×X into X.
ρ is a homomorphism in this new sense
It turns out that ρ:G→Sym(X) is a homomorphism. It suffices to show that ρ(gh)=ρ(g)ρ(h), where recall that the operation in Sym(X) is composition of permutations.
But this is true: ρ(gh)(x)=ρ(gh,x) by definition of ρ(gh); that is ρ(g,ρ(h,x)) because ρ is a group action; that is ρ(g)(ρ(h,x)) by definition of ρ(g); and that is ρ(g)(ρ(h)(x)) by definition of ρ(h) as required.