TheoremBase

Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages

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.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let AA, BB and CC be classes. For a map FF, F(u)F(u) is its value at uu and dom⁡F\operatorname{dom}F its domain. (u,v)(u,v) is the ordered pair, restrictions H∣SH|_{S} are as in The Restriction of a Function or Relation to a Class (i), A×BA\times B is the Cartesian product, {c}\{c\} the singleton, F−1[D]F^{-1}[D] the preimage of a class DD, and ∩\cap the intersection.

Values. Let F:A→BF:A\to B be a map. For every u∈Au\in A: u∈dom⁡Fu\in\operatorname{dom}F, F(u)F(u) is a set, F(u)∈BF(u)\in B and (u,F(u))∈F(u,F(u))\in F (for sets AA and BB, the last two assertions are Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (ii)).

Pairs as values. Let F:A→BF:A\to B be a map. For every u∈Au\in A and every set vv: (u,v)∈F(u,v)\in F if and only if v=F(u)v=F(u). For all sets uu and vv: (u,v)∈F(u,v)\in F if and only if u∈Au\in A and v=F(u)v=F(u).

Extensionality. If F:A→BF:A\to B and G:A→CG:A\to C are maps with G(u)=F(u)G(u)=F(u) for every u∈Au\in A, then G=FG=F (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 u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv) for classes and two codomains).

Restriction of a restriction. For all classes HH, SS and TT with T⊆ST\subseteq S: (H∣S)∣T=H∣T(H|_{S})|_{T}=H|_{T}.

Restriction to the domain. Let F:A→BF:A\to B be a map. Then F∣A=FF|_{A}=F (for sets AA and BB, this is Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iii)).

Restriction to a subclass. Let F:A→BF:A\to B be a map. For every class S⊆AS\subseteq A, F∣S:S→BF|_{S}:S\to B is a map. For every class SS and every u∈Su\in S with u∈Au\in A: (F∣S)(u)=F(u)(F|_{S})(u)=F(u) (this restates Domains and Restrictions of Maps (ii) and, for an arbitrary class SS, Domains and Restrictions of Maps (iii)).

Constant maps. For every set cc, A×{c}A\times\{c\} is a map A→{c}A\to\{c\}, with (A×{c})(u)=c(A\times\{c\})(u)=c for every u∈Au\in A; hence, if c∈Bc\in B, then A×{c}:A→BA\times\{c\}:A\to B is a map.

Pairs in a product. For all sets uu and vv: (u,v)∈A×B(u,v)\in A\times B if and only if u∈Au\in A and v∈Bv\in B (this is Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i)).

Preimages. Let F:A→BF:A\to B be a map. For all classes DD and uu: u∈F−1[D]u\in F^{-1}[D] if and only if u∈Au\in A and F(u)∈DF(u)\in D (this is Membership in Inverse Relations, Preimages and Images of Classes, and Enlarging the Codomain of a Map (iii), stated for every class uu).

Preimages of intersections. Let F:A→BF:A\to B be a map. For all classes DD and EE: F−1[D]∩F−1[E]=F−1[D∩E]F^{-1}[D]\cap F^{-1}[E]=F^{-1}[D\cap E].

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…