Definition 9
Tag 03HN, permanent. Cite it as [Bourbaki, Tag 03HN].
Theory of Sets, chapter II, § 3. Correspondences
A graph F is said to be a functional graph if for each x there is at most one object which corresponds to x under F (Chapter I, § 5, no. 3). A correspondence is said to be a function if its graph F is a functional graph and if its source A is equal to its domain . In other words, a correspondence is a function if for every x belonging to the source A of f the relation is functional in y (Chapter I, § 5, no. 3); the unique object which corresponds to x under f is called the value of f at the element x of A, and is denoted by (or , or , or ).
If is a function, F its graph, and an element of the domain of , the relation is then equivalent to (Chapter I, § 5, no. 3, criterion C46).
Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.