utkaje fu'ivla

x1 and x2 are path-linked by directed binary predicate x3 (ka) via intermediate steps x4 (ordered list; ce'o), such that both (A) no other node exists in the graph (x5) to which x2 is connected in the same way/direction and (B) no other node exists in the graph (x5) to which x1 is connected in the opposite/symmetric way/direction.

Equivalent to "x1 x fo x4 x .utkaro fi x3 gi'e se .utkaro fi x3 \prime", where x3 \prime is binary relation x3 with the order of its two arguments exchanged (basically: "se"-converted).