TheoremBase

Both directions follow from the description of the pairs of a map through its values.

Proof

We prove both directions of (i).

Suppose first that vv is a set with (u,v)∈F(u,v)\in F and (u,v)∈G(u,v)\in G. Since u∈Au\in A and vv is a set, Ordered Pairs in a Map between Classes: Membership as a Value, and the Components Lie in the Domain and the Codomain (i) applied to the map F:Aβ†’CF:A\to C gives F(u)=vF(u)=v. Likewise, since u∈Bu\in B, the same result applied to G:Bβ†’DG:B\to D gives G(u)=vG(u)=v. Hence F(u)=G(u)F(u)=G(u).

Conversely, suppose F(u)=G(u)F(u)=G(u), and put v=F(u)v=F(u). By Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (i), applied to FF and u∈Au\in A, vv is a set and (u,v)∈F(u,v)\in F. Since v=G(u)v=G(u), u∈Bu\in B and vv is a set, Ordered Pairs in a Map between Classes: Membership as a Value, and the Components Lie in the Domain and the Codomain (i) applied to G:Bβ†’DG:B\to D gives (u,v)∈G(u,v)\in G. So vv is a set with (u,v)∈F(u,v)\in F and (u,v)∈G(u,v)\in G.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…