TheoremBase

Maps Defined by Cases

A map may be defined by two cases: given a property of the elements of a set and an expression for each case with values in a target set, there is exactly one map taking the first value where the property holds and the second elsewhere.

Statement

In the setting of Sets and Maps: Ordinary Notation: this lemma is a scheme, asserting one lemma for each property and pair of expressions as below, possibly with parameters. Let AA and BB be sets, let PP be a property of elements of AA expressed by a predicative formula, and let t1(x)t_{1}(x) and t2(x)t_{2}(x) be expressions built from defined set symbols such that, for every x∈Ax\in A with P(x)P(x), the symbols in t1(x)t_{1}(x) are used properly and t1(x)∈Bt_{1}(x)\in B, and, for every x∈Ax\in A without P(x)P(x), the symbols in t2(x)t_{2}(x) are used properly and t2(x)∈Bt_{2}(x)\in B.

There is exactly one map f:A→Bf:A\to B with f(x)=t1(x)f(x)=t_{1}(x) for every x∈Ax\in A with P(x)P(x), and f(x)=t2(x)f(x)=t_{2}(x) for every x∈Ax\in A without P(x)P(x).

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…