x_{1} and x_{2} are path-linked by directed binary predicate x_{3} (ka) via intermediate steps x_{4} (ordered list; ce'o), such that both (A) no other node exists in the graph (x_{5}) to which x_{2} is connected in the same way/direction and (B) no other node exists in the graph (x_{5}) to which x_{1} is connected in the opposite/symmetric way/direction.

Equivalent to "x_{1 x} fo x_{4 x} .utkaro fi x_{3} gi'e se .utkaro fi x_{3 \prime}", where x_{3 \prime} is binary relation x_{3} with the order of its two arguments exchanged (basically: "se"-converted).