2023-10-08

382: Preimage Under Surjection Is Saturated w.r.t. Surjection

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that preimage under surjection is saturated w.r.t. surjection

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any surjection, the preimage of any codomain subset is saturated with respect to the surjection.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any sets, S1,S2, any surjection, f:S1S2, and any subset, S3S2, the preimage, f1(S3), is saturated with respect to f, which means f1f(f1(S3))=f1(S3).


2: Proof


f(f1(S3))=S3, because f is a surjection, by the proposition that for any map, the composition of the map after any preimage is identical if and only if the argument set is a subset of the map image. So, f1f(f1(S3))=f1(S3).


References


<The previous article in this series | The table of contents of this series | The next article in this series>