Currently reading Linear Algebra Done Right by Axler, the author states:
If $S$ is a set, then $F^S$ denotes the set of functions from $S$ to $F$. (...)
Our previous examples of vector spaces, $F^n$ and $F^\infty$,
are special cases of the vector space $F^S$ because a list of length $n$ of numbers in $F$
can be thought of as a function from $\{1,2,\dots,n\}$ to $F$,
and a sequence of numbers in $F$ can be thought of as a function from the set of
positive integers to $F$.
Thus, we can write:
$$
F^n = F^{\{1,2,\dots,n\}}.
$$
I have come across related discussions on Math SE:
My understanding
Given the definition of function spaces, an element of
$$
F^{\{1,2,\dots,n\}} = \{ f \mid f: \{1,2,\dots,n\} \to \mathbb{R} \}
$$
can be represented explicitly as a set of ordered pairs:
$$
\{(1, x_1), (2, x_2), \dots, (n, x_n)\}.
$$
Alternatively, the notation used in vector spaces is:
$$
\{(f(1), f(2), \dots, f(n)) \mid f: \{1,2,\dots,n\} \to \mathbb{R} \}.
$$
which does not explicitly list input-output pairs.
Question
Is my interpretation of
$$
F^S = \{ f \mid f: \{1,2,\dots,n\} \to \mathbb{R} \}
$$
correct, particularly in how I represent elements as sets of ordered pairs? If not, what is the precise way to bridge these notations?
Furthermore, how do I rigorously justify the equivalence:
$$
\{ f \mid f: \{1,2,\dots,n\} \to \mathbb{R} \} = \{(f(1), f(2), \dots, f(n)) \mid f: \{1,2,\dots,n\} \to \mathbb{R} \}.
$$
Lastly, are there any recommended materials where I can further explore and practice this concept?
Thanks in advance, sorry if this turns out to be trivial. :)