Bookkeeping facts for maps between classes: values and pairs of a map, equality by values, restrictions, constant maps, pairs in a product, and membership in preimages and in preimages of intersections.
In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let , and be classes. For a map , is its value at and its domain. is the ordered pair, restrictions are as in The Restriction of a Function or Relation to a Class (i), is the Cartesian product, the singleton, the preimage of a class , and the intersection.
Values. Let be a map. For every : , is a set, and (for sets and , the last two assertions are Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (ii)).
Pairs as values. Let be a map. For every and every set : if and only if . For all sets and : if and only if and .
Extensionality. If and are maps with for every , then (this restates Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (i) for maps, and Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (iv) for classes and two codomains).
Restriction of a restriction. For all classes , and with : .
Restriction to the domain. Let be a map. Then (for sets and , this is Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (iii)).
Restriction to a subclass. Let be a map. For every class , is a map. For every class and every with : (this restates Domains and Restrictions of Maps (ii) and, for an arbitrary class , Domains and Restrictions of Maps (iii)).
Constant maps. For every set , is a map , with for every ; hence, if , then is a map.
Pairs in a product. For all sets and : if and only if and (this is Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i)).
Preimages. Let be a map. For all classes and : if and only if and (this is Membership in Inverse Relations, Preimages and Images of Classes, and Enlarging the Codomain of a Map (iii), stated for every class ).
Preimages of intersections. Let be a map. For all classes and : .
Loading…
No relations recorded yet.