**Proof:** First we say that R is an equivalence relation. We have (a,b)∊R and (a,c) ∊R

⟹(b,a) ∊R and (a,c) ∊R [∵ R is symmetric]

⟹(b,c) ∊R

Conversely, we suppose that

(b,c) ∊R

Given that R is reflexive. Let (a,b) ∊R, then there exist x∊A such that (x,a) ∊R and (x,b) ∊R

⟹(x,b) ∊R and (x,a) ∊R

⟹(b,a) ∊R

### ∴ R is symmetric.

Since (a,b) ∊R and (a,c) ∊R

⟹ (b.c) ∊R

∴ R is an equivalence relation**.(proved)**