Question

The assertion, as given in the source: (Theorem 3.4.8 of Johnsonbaugh's text.) Let R be an equivalence relation on a set X. For each a in X, define [a] as (xeX | xRaj. Then the following set is a partition of X: S={[a] l a eX). Logical structure of the assertion: Proof framework, based on this logical structure: Previous resulis needed (give one to three previous resulis that are most important for this prooj): Interesting or unexpected tricks, or summary: (A specification for this one: Tell how each of the three "equivalence relation" properties--reflexivity symmetry, and transitivity-shows up in the argument.)

Answer 1

R is an equ C e ki if o Ra aEx кеса aex

DATE bu