A relation R on a set A is transitive if when an element a is related to an element b, and b is related to an element c, then a is related to c.
∀ a ∀ b ∀ c ( ( ( a ∈ A ) ∧ ( b ∈ A ) ∧ ( c ∈ A ) ∧ ( ( a , b ) ∈ R ) ∧ ( ( b , c ) ∈ R ) ) → ( a , c ) ∈ R ) {\displaystyle \forall a\forall b\forall c(((a\in A)\land (b\in A)\land (c\in A)\land ((a,b)\in R)\land ((b,c)\in R))\to (a,c)\in R)}
