# Ceva Theorem
Let(A = [u1,0], B = [u2,0], C = [0,u3], P = [u4,u5], X = [x1,x2],
    Y = [x3,x4], Z = [x5,0]):
Ceva := Theorem(
    [arbitrary(A,B,C,P), intersection(A,P,B,C,X), intersection(B,P,A,C,Y),
     intersection(C,P,A,B,Z)], sdistance(B,X)*sdistance(C,Y)*sdistance(A,Z)
     -sdistance(X,C)*sdistance(Y,A)*sdistance(Z,B), [x1,x2,x3,x4,x5]);
