TheoremBase

Binary Operations on a Set

Defines a binary operation on a set as a function from its Cartesian square to the set, with the infix notation for its values.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let aa be a set.

A binary operation on aa is a function from the Cartesian product a×aa\times a to aa.

Let ∗\ast be a binary operation on aa and u,v∈au,v\in a. Then u∗vu\ast v denotes the value ∗((u,v))\ast((u,v)) of ∗\ast at the ordered pair (u,v)(u,v). This value exists because (u,v)∈a×a(u,v)\in a\times a by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set §membership and a×a=dom⁡∗a\times a=\operatorname{dom}\ast by Functions, Values of a Function, and Functions from One Class to Another §map; and it lies in aa, since it lies in the range ran⁡∗\operatorname{ran}\ast by Relations, Domain, Range, Inverse and Composition §range and ran⁡∗⊆a\operatorname{ran}\ast\subseteq a by Functions, Values of a Function, and Functions from One Class to Another §map. By Functions, Values of a Function, and Functions from One Class to Another §value, u∗vu\ast v is the unique set zz with ((u,v),z)∈∗((u,v),z)\in\ast, so it is a defined set symbol.

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…