Based loops multiply by traversing one path and then the other with a reparameterization. I will separate the object being defined from the consequence being claimed.
Notation
The fundamental group \(\pi_1(X,x_0)\) records based loops modulo based homotopy. A covering map \(p:\widetilde X\to X\) turns loop classes into endpoint data upstairs.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
Stress the formula
Here is a concrete symbolic test. Reading it from left to right reveals which transformation is reversible and which is only an implication.
Interpretation
A good test for understanding is to change the presentation while keeping the invariant fixed. The aligned form makes that comparison unusually easy.
Limit of the argument
Basepoints matter for literal homomorphisms. Changing basepoint produces an isomorphism only after choosing a path, and the choice is visible up to conjugation.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.