relations

antisymmetry in words, if every element in A also is in B and all elements in B are in A, then A and B must be equal, i.e. containing all the same elements.
partial ordering definition

A relation R is a partial ordering if it is a pre-order (i.e. it is reflexive (x R x) and transitive (x R y R z => x R z)) and it is also antisymmetric (x R y R x => x = y). The ordering is partial, rather than total, because there may exist elements x and y for which neither x R y nor y R x.

If X is totally ordered under ≤, then the following statements hold for all a, b and c in X:
If a ≤ b and b ≤ a then a = b (antisymmetry);
If a ≤ b and b ≤ c then a ≤ c (transitivity);
a ≤ b or b ≤ a (totality).
Contrast with a partial order, which has a weaker form of the third condition (it only requires reflexivity, not totality). A relation having the property of "totality" means that any pair of elements in the set of the relation are mutually comparable under the relation.

hope u got it:)

An ordering is any relation R that satisfies:

(a) Reflexive property: (a,a) ε R

(b) Transitive property : (a,b) ε R and (b,c) ε R implies (a,c) ε R

(c) Anti-symmetric: (a,b) ε R and (b,a) ε R iff a = b

A set S on which such an ordering exists, is in general a partially ordered set (as against a bare set, on which no order is defined)

If (a,b) ε R or (b,a) ε R we say that a and b are comparable

A set S is said to be totally ordered if given a,b ε S either (a,b)ε R or (b,a) ε R. In other words any two elements of S are comparable.

Familiar examples of ordering are:

(1) 'greater than or equal to' : this induces a total ordering if S consists of real numbers

(2) ' is divisible by ': S = {1,3,4,6,8,9}

The ordered pairs will be {(1,1) (3,1), (4,1), (6,1), (8,1), (9,1), (3,3), (6,3), (9,3), (8,4)}

You can easily see that 'is divisible by' is an ordering and the set S is partially ordered by this relation

(3)' is a subset of ' is also an ordering

Anti-Symmetric:

You must first understand symmetry:

If you consider the set of lines L, then consider the relation R defined by R ={(l₁,l₂): l, l₂ ε L and l_1 \left| \right| l_2

Obviously if (l_1, l_2) \in R then we must have (l_2, l_1) \in R

It is not necessary that if (l_1, l_2) \in R and (l_2, l_1) \in R then l₁ and l₂ are identical.

But in anti-symmetric, (a, b) \in R and (b,a) \in R \Rightarrow a=b

e.g. "is a subset of" . As you know A \subseteq B \ \text{and} \ B\subseteq A \Rightarrow A = B. This is hence an anti-symmetric relation ( and its an example of an ordering as mentioned before)