TheoremBase

Injectivity, Composition, and Restriction of Bijections

Statement

Let XX, YY, and ZZ be sets.

  1. Every bijection u:X→Yu:X\to Y is injective; that is, u(x)=u(x′)u(x)=u(x') implies x=x′x=x' for all x,x′∈Xx,x'\in X.
  2. If u:X→Yu:X\to Y and v:Y→Zv:Y\to Z are bijections, then the map w:X→Zw:X\to Z defined by w(x)=v(u(x))w(x)=v(u(x)) is a bijection.
  3. If u:X→Yu:X\to Y is a bijection and A⊆XA\subseteq X, then, writing u(A)={u(a):a∈A}u(A)=\{u(a): a\in A\}, the restriction of uu to AA is a bijection from AA onto u(A)u(A).

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…