unfold disjoint.
intro.
destruct H0 as [P []].
assert(HP:= betH_trans0 A P B C H0 H).
spliter.
apply between_only_one' in H1.
spliter.
contradiction.
Qed.

Lemma strong_pasch : forall A B C l p, ~ ColH A B C ->
IncidP A p -> IncidP B p -> IncidP C p -> IncidLP l p -> ~ IncidL C l -> cut l A B ->
cut l A C /\ ~ cut l B C \/ cut l B C /\ ~ cut l A C.