proposition: Lemma euclid : euclidP (@Point R) (@bet' R).
proof: Proof. move=> a b c d p q par col ncol cop; apply parP in par; apply colP in col; apply ncolP in ncol; apply coplanarP in cop. by destruct (proclus par col ncol cop) as [y []]; exists y; split; apply colP. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrbool ssrfun ssrnat eqtype choice seq) mathcomp(fintype finset finfun bigop order) mathcomp(ssralg ssrnum path generic_quotient matrix mxalgebra) mathcomp(zmodp) GeoCoq.Axioms.gupta_inspired_variant_axioms GeoCoq.Tactics.Coinc.tactics_axioms GeoCoq.Tactics.Coinc.ColR GeoCoq.Meta_theory.Models.POF_to_Tarski GeoCoq.Meta_theory.Counter_models.Planar.independence