Require Export GeoCoq.Elements.OriginalProofs.lemma_PGrotate.
Require Export GeoCoq.Elements.OriginalProofs.proposition_33B.
Require Export GeoCoq.Elements.OriginalProofs.proposition_30.
Require Export GeoCoq.Elements.OriginalProofs.lemma_diagonalsbisect.
Require Export GeoCoq.Elements.OriginalProofs.lemma_triangletoparallelogram.
Require Export GeoCoq.Elements.OriginalProofs.lemma_parallelbetween.
Require Export GeoCoq.Elements.OriginalProofs.proposition_43.
Require Export GeoCoq.Elements.OriginalProofs.proposition_43B.

Section Euclid.

Context `{Ax:area}.

Lemma proposition_44A : 
   forall A B D E F G J N, 
   PG B E F G -> CongA E B G J D N -> BetS A B E ->
   exists X Y, PG A B X Y /\ CongA A B X J D N /\ EF B E F G Y X B A /\ BetS G B X.
Proof.
(* Goal: forall (A B D E F G J N : @Point Ax0) (_ : @PG Ax0 B E F G) (_ : @CongA Ax0 E B G J D N) (_ : @BetS Ax0 A B E), @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
intros.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG E F G B) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG F G B E) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG G B E F) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G F B E) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol G B E) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq G B) by (forward_using lemma_NCdistinct).
let Tf:=fresh in
assert (Tf:exists q, (BetS G B q /\ Cong B q G B)) by (conclude lemma_extension);destruct Tf as [q];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol E B G) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A B E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E B A) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq B B) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E B B) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq A B) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol A B G) by (conclude lemma_NChelper).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G B q) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol G B A) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq G q) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq q G) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq G G) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G B G) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol q G A) by (conclude lemma_NChelper).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol G q A) by (forward_using lemma_NCorder).
rename_H H;let Tf:=fresh in
assert (Tf:exists H h T, (BetS H A h /\ CongA h A B A B G /\ CongA h A B G B A /\ CongA B A h G B A /\ CongA H A B A B q /\ CongA H A B q B A /\ CongA B A H q B A /\ Par H h G q /\ Cong H A B q /\ Cong A h G B /\ Cong A T T B /\ Cong H T T q /\ Cong G T T h /\ BetS H T q /\ BetS G T h /\ BetS A T B)) by (conclude proposition_31);destruct Tf as [H[h[T]]];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H h q G) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G B q) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col q G B) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq B G) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H h B G) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H h G B) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B H h) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B h H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col H A h) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col h H A) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq H A) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq A H) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B A H) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B H A) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A G B) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Cong H A G B) by (conclude lemma_congruencetransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq B B) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A B B) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A T B) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A B T) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol B H A) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol A B H) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol H A B) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol A B H) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS H G A B) by (conclude_def OS ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert ((Par H G A B /\ Cong H G A B)) by (conclude proposition_33B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A B H G) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A B G H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert ((Par G B E F /\ Par G F B E)) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G F E B) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A B E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E B A) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G F A B) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A B G F) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G H F) by (conclude lemma_Playfair).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A B G) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B F E) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par F E G B) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG H A B G) by (conclude_def PG ).
let Tf:=fresh in
assert (Tf:exists j, (BetS H j B /\ BetS A j G)) by (conclude lemma_diagonalsmeet);destruct Tf as [j];spliter.
let Tf:=fresh in
assert (Tf:exists k, (BetS G k E /\ BetS B k F)) by (conclude lemma_diagonalsmeet);destruct Tf as [k];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS E B A) by (conclude axiom_betweennesssymmetry).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq E E) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq B B) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq A A) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col F E E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G B B) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col H A A) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol F E B) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq F E) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq G B) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol H A G) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq H A) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A F E) by (eauto using (proposition_30 _ _ _ _ _ _ _ _ _ _ H79 H1 H93)).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Cong G B F E) by (forward_using proposition_34).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Cong H A F E) by (conclude lemma_congruencetransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G F B E) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H G A B) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par B E G F) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A B H G) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (TP B E G F) by (conclude lemma_paralleldef2B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (TP A B H G) by (conclude lemma_paralleldef2B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS G F B E) by (conclude_def TP ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS H G A B) by (conclude_def TP ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A B E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq A E) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS H G A E) by (conclude lemma_samesidecollinear).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS G F E B) by (conclude lemma_samesideflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E B A) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq E A) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS G F E A) by (conclude lemma_samesidecollinear).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS G F A E) by (conclude lemma_samesideflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (OS H F A E) by (conclude lemma_samesidetransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H F A E) by (conclude proposition_33B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A E F) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG H A E F) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol H F E) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol E F H) by (forward_using lemma_NCorder).
let Tf:=fresh in
assert (Tf:exists t, (Midpoint H t E /\ Midpoint A t F)) by (conclude lemma_diagonalsbisect);destruct Tf as [t];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert ((BetS H t E /\ Cong H t t E)) by (conclude_def Midpoint ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert ((BetS A t F /\ Cong A t t F)) by (conclude_def Midpoint ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Cong A t F t) by (forward_using lemma_congruenceflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Cong H t E t) by (forward_using lemma_congruenceflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Cong t A t F) by (forward_using lemma_congruenceflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol H E F) by (forward_using lemma_NCorder).
let Tf:=fresh in
assert (Tf:exists K, (BetS H B K /\ BetS F E K)) by (conclude postulate_Euclid5);destruct Tf as [K];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col F E K) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E F K) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq F K) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq K F) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A K F) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A F K) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par F K H A) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par F K A H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq H H) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A H H) by (conclude_def Col ).
let Tf:=fresh in
assert (Tf:exists L, (PG H L K F /\ Col A H L)) by (conclude lemma_triangletoparallelogram);destruct Tf as [L];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H L K F) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol L K F) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq L K) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq K L) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B E F) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B F E) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col F E E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col F E K) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq E K) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B E K) by (conclude lemma_collinearparallel2).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par E K G B) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G B B) by (conclude_def Col ).
let Tf:=fresh in
assert (Tf:exists M, (PG B M K E /\ Col G B M)) by (conclude lemma_triangletoparallelogram);destruct Tf as [M];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG L K F H) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG K L H F) by (conclude lemma_PGflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG L H F K) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG H F K L) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG A H G B) by (conclude lemma_PGflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A H G B) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq K K) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq E E) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (eq F F) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par B E M K) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M K B E) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par K M E B) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G F B E) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol E M K) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol B E K) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol G F B) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M K B E) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G F B E) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS K E F) by (conclude axiom_betweennesssymmetry).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col M K K) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col B E E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G F F) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq M K) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq B E) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq G F) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M K G F) by (conclude proposition_30).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par K M F G) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par F G K M) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H F L K) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par L K H F) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par K L H F) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col H F G) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par K L G F) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par K L F G) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par F G K L) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col K M L) by (conclude lemma_Playfair).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col M K L) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par B E M K) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq L K) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par B E L K) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par L K B E) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par L K E B) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A B E) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E B A) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par L K A B) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A B L K) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par A B K L) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS K B H) by (conclude axiom_betweennesssymmetry).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col L A H) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS L A H) by (conclude lemma_parallelbetween).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS H A L) by (conclude axiom_betweennesssymmetry).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A G B) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol B M K) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq M B) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H A M B) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M B H A) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M B A H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col A H L) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H L K F) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (nCol H L K) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq L H) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M B L H) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par M B H L) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col L M K) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS L M K) by (conclude lemma_parallelbetween).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B E F) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col F E K) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col E F K) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq F K) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq K F) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par G B K F) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col F G H) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS F G H) by (conclude lemma_parallelbetween).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS H G F) by (conclude axiom_betweennesssymmetry).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG A B G H) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG B G H A) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG G H A B) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG M K E B) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG K E B M) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG E B M K) by (conclude lemma_PGrotate).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (EF B E F G L M B A) by (conclude proposition_43).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG A H G B) by (conclude lemma_PGflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG M B E K) by (conclude lemma_PGflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (PG A B M L) by (conclude proposition_43B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col H G F) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq H F) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq L K) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq H G) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (neq M K) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Par H F L K) by (conclude_def PG ).
assert (~ Meet H F L K)
 by (unfold Par in H251;decompose [ex and] H251;auto).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (Col G M B) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (BetS G B M) by (conclude lemma_collinearbetween).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (CongA A B M G B E) by (conclude proposition_15).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (CongA G B E E B G) by (conclude lemma_ABCequalsCBA).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (CongA A B M E B G) by (conclude lemma_equalanglestransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
assert (CongA A B M J D N) by (conclude lemma_equalanglestransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Y : @Point Ax0 => and (@PG Ax0 A B X Y) (and (@CongA Ax0 A B X J D N) (and (@EF Ax0 Ax1 Ax2 Ax B E F G Y X B A) (@BetS Ax0 G B X))))) *)
close.
Qed.

End Euclid.


