Require Export GeoCoq.Elements.OriginalProofs.proposition_44.
Require Export GeoCoq.Elements.OriginalProofs.lemma_RTcongruence.
Require Export GeoCoq.Elements.OriginalProofs.lemma_RTsymmetric.
Require Export GeoCoq.Elements.OriginalProofs.proposition_14.

Section Euclid.

Context `{Ax:area}.

Lemma proposition_45 : 
   forall A B C D E J K N O R S, 
   nCol J E N -> nCol A B D -> nCol C B D -> BetS A O C -> BetS B O D -> neq R K -> nCol K R S ->
   exists X Z U, PG X K Z U /\ CongA X K Z J E N /\ EF X K Z U A B C D /\ Out K R Z /\ OS X S K Z.
Proof.
(* Goal: forall (A B C D E J K N O R S : @Point Ax0) (_ : @nCol Ax0 J E N) (_ : @nCol Ax0 A B D) (_ : @nCol Ax0 C B D) (_ : @BetS Ax0 A O C) (_ : @BetS Ax0 B O D) (_ : @neq Ax0 R K) (_ : @nCol Ax0 K R S), @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
intros.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq B D) by (forward_using lemma_NCdistinct).
let Tf:=fresh in
assert (Tf:exists m, (BetS B m D /\ Cong m B m D)) by (conclude proposition_10);destruct Tf as [m];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Cong B m m D) by (forward_using lemma_congruenceflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Midpoint B m D) by (conclude_def Midpoint ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq B m) by (forward_using lemma_betweennotequal).
let Tf:=fresh in
assert (Tf:exists P, (BetS R K P /\ Cong K P B m)) by (conclude lemma_extension);destruct Tf as [P];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Triangle A B D) by (conclude_def Triangle ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq K P) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq P K) by (conclude lemma_inequalitysymmetric).
rename_H H;let Tf:=fresh in
assert (Tf:exists H, (BetS P K H /\ Cong K H P K)) by (conclude lemma_extension);destruct Tf as [H];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Cong P K K H) by (conclude lemma_congruencesymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Midpoint P K H) by (conclude_def Midpoint ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Cong P K B m) by (forward_using lemma_congruenceflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Cong K H B m) by (conclude lemma_congruencetransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Cong B m m D) by (forward_using lemma_congruenceflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Cong K H m D) by (conclude lemma_congruencetransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (BetS P K R) by (conclude axiom_betweennesssymmetry).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col P K H) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col P K R) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq P K) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col K H R) by (conclude lemma_collinear4).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col R K H) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol R K S) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq K K) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col R K K) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq K H) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq H K) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol H K S) by (conclude lemma_NChelper).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol S K H) by (forward_using lemma_NCorder).
let Tf:=fresh in
assert (Tf:exists F G, (PG F K H G /\ EF A B m D F K H G /\ CongA H K F J E N /\ OS S F K H)) by (conclude proposition_42B);destruct Tf as [F[G]];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol D B C) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Triangle D B C) by (conclude_def Triangle ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F K H G) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol K H G) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol H G K) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol G H K) by (forward_using lemma_NCorder).
let Tf:=fresh in
assert (Tf:exists M L e, (PG G H M L /\ CongA G H M J E N /\ EF D B e C G H M L /\ Midpoint B e C /\ TS M G H K)) by (conclude proposition_44);destruct Tf as [M[L[e]]];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (BetS B e C) by (conclude_def Midpoint ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA J E N G H M) by (conclude lemma_equalanglessymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA H K F G H M) by (conclude lemma_equalanglestransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F K H G) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par K F H G) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq H K) by (forward_using lemma_NCdistinct).
let Tf:=fresh in
assert (Tf:exists s, (BetS H K s /\ Cong K s H K)) by (conclude lemma_extension);destruct Tf as [s];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F G K H) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par K H F G) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TP K H F G) by (conclude lemma_paralleldef2B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (OS F G K H) by (conclude_def TP ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (RT F K H K H G) by (conclude proposition_29C).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA G H M H K F) by (conclude lemma_equalanglessymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol H K F) by (conclude lemma_equalanglesNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol F K H) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K H H K F) by (conclude lemma_ABCequalsCBA).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K H G H M) by (conclude lemma_equalanglestransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (RT G H M K H G) by (conclude lemma_RTcongruence).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (RT K H G G H M) by (conclude lemma_RTsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq G G) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq H G) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Out H G G) by (conclude lemma_ray4).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (BetS K H M) by (conclude proposition_14).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq F K) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol G H M) by (conclude lemma_equalanglesNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq G H) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par G H M L) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol H M L) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq L M) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq K K) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq H H) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq M M) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col F K K) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col G H H) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col L M M) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F K G H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par M L G H) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par L M G H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F K L M) by (conclude proposition_30).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F K M L) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F G K H) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par G L H M) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F G H K) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col K H M) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col H K M) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq K M) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq M K) by (conclude lemma_inequalitysymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F G M K) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col H M K) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par G L K M) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par G L M K) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par M K G L) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par M K F G) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par M K G F) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col G L F) by (conclude lemma_Playfair).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col G F L) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol F L M) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq L F) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par M K L F) by (conclude lemma_collinearparallel).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par L F M K) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F L K M) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (PG F K M L) by (conclude_def PG ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol F K H) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K H H K F) by (conclude lemma_ABCequalsCBA).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K H J E N) by (conclude lemma_equalanglestransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq K H) by (forward_using lemma_betweennotequal).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Out K H M) by (conclude lemma_ray4).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Out K M H) by (conclude lemma_ray5).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq F F) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq K F) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Out K F F) by (conclude lemma_ray4).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol F K M) by (forward_using lemma_parallelNC).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K M F K M) by (conclude lemma_equalanglesreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K M F K H) by (conclude lemma_equalangleshelper).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (CongA F K M J E N) by (conclude lemma_equalanglestransitive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col B O D) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col B D O) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (nCol B D A) by (forward_using lemma_NCorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TS A B D C) by (conclude_def TS ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par G H L M) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TP G H L M) by (conclude lemma_paralleldef2B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (OS L M G H) by (conclude_def TP ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par F K G H) by (forward_using lemma_parallelflip).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Par G H F K) by (conclude lemma_parallelsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TP G H F K) by (conclude lemma_paralleldef2B).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (OS F K G H) by (conclude_def TP ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (eq H H) by (conclude cn_equalityreflexive).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col G H H) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TS K G H M) by (conclude_def TS ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TS F G H M) by (conclude lemma_planeseparation).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TS M G H F) by (conclude lemma_oppositesidesymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (TS L G H F) by (conclude lemma_planeseparation).
let Tf:=fresh in
assert (Tf:exists t, (BetS L t F /\ Col G H t /\ nCol G H L)) by (conclude_def TS );destruct Tf as [t];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col F L G) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col L t F) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col F L t) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (neq F L) by (forward_using lemma_NCdistinct).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col L G t) by (conclude lemma_collinear4).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col t G L) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col t G H) by (forward_using lemma_collinearorder).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (~ neq t G).
(* Goal: not (@neq Ax0 t G) *)
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
 {
(* Goal: not (@neq Ax0 t G) *)
 intro.
(* Goal: False *)
 assert (Col G L H) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col G H L) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (BetS L G F) by (conclude cn_equalitysub).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (BetS F G L) by (conclude axiom_betweennesssymmetry).
let Tf:=fresh in
assert (Tf:exists j, (BetS F j M /\ BetS K j L)) by (conclude lemma_diagonalsmeet);destruct Tf as [j];spliter.
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (EF A B C D F K M L) by (conclude axiom_paste4).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (EF F K M L A B C D) by (conclude axiom_EFsymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (BetS P K M) by (conclude lemma_3_7b).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Out K R M) by (conclude_def Out ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (OS F S K H) by (forward_using lemma_samesidesymmetric).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (Col K H M) by (conclude_def Col ).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
assert (OS F S K M) by (conclude lemma_samesidecollinear).
(* Goal: @ex (@Point Ax0) (fun X : @Point Ax0 => @ex (@Point Ax0) (fun Z : @Point Ax0 => @ex (@Point Ax0) (fun U : @Point Ax0 => and (@PG Ax0 X K Z U) (and (@CongA Ax0 X K Z J E N) (and (@EF Ax0 Ax1 Ax2 Ax X K Z U A B C D) (and (@Out Ax0 K R Z) (@OS Ax0 X S K Z))))))) *)
close.
Qed.

End Euclid.


