See the examples below
(using elements)={relations possible which is reflexive , symmetric and anti symmetric}
{0,1} ={(0,0),(1,1)}
{0,1,2}={(0,0),(1,1),(2,2)}
{0,1,2,3}={(0,0),(1,1),(2,2),(3,3)}
{0,1,2,3,...,n}={(0,0),(1,1),(2,2),(3,3),...,(n,n)}
and so on.
It is clear that the given relations are reflexive and if we remove any one ordered pair from RHS then the relation would no longer be reflexive. Also ,if we add more ordered pair then the relations will remain reflexive.
for symmetric relation if (a,b) is present then (b,a) should also be present
for anti symmetric relation if (a,b) is present then (b,a) should not be present but if there is an exception that ordered pair like (a,a),(b,b)....(n,n) could be present.
So in the above example if we add any ordered pair like (a,b) (lets say, (1,3) in third example) then we have to add (b,a)(i.e. (3,1)) also to make it symmetric and this would violate the anti symmetric property.
on the other hand if we add any ordered pair like (a,b) (lets say, (1,3) in third example) then we do not add (b,a)(i.e. (3,1)) the relation would no longer be symmetric but would still satisfy the anti symmetric property.
