Require Export GeoCoq.Elements.OriginalProofs.proposition_10.
Require Export GeoCoq.Elements.OriginalProofs.proposition_15.
Require Export GeoCoq.Elements.OriginalProofs.lemma_equalanglesreflexive.
Require Export GeoCoq.Elements.OriginalProofs.lemma_angleorderrespectscongruence.
Require Export GeoCoq.Elements.OriginalProofs.lemma_angleorderrespectscongruence2.

Section Euclid.

Context `{Ax:euclidean_neutral_ruler_compass}.

Lemma proposition_16 : 
   forall A B C D, 
   Triangle A B C -> BetS B C D ->
   LtA B A C A C D /\ LtA C B A A C D.
Proof.
(* Goal: forall (A B C D : @Point Ax0) (_ : @Triangle Ax0 A B C) (_ : @BetS Ax0 B C D), and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
intros.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (nCol A B C) by (conclude_def Triangle ).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq A C).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A B C) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq B C).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A B C) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C B) by (conclude lemma_inequalitysymmetric).
let Tf:=fresh in
assert (Tf:exists E, (BetS A E C /\ Cong E A E C)) by (conclude proposition_10);destruct Tf as [E];spliter.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq B E).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (BetS A B C) by (conclude cn_equalitysub).
(* Goal: False *)
 assert (Col A B C) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq E B) by (conclude lemma_inequalitysymmetric).
let Tf:=fresh in
assert (Tf:exists F, (BetS B E F /\ Cong E F E B)) by (conclude lemma_extension);destruct Tf as [F];spliter.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq A C).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A B C) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C A) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
assert (neq E C) by (forward_using lemma_betweennotequal).
let Tf:=fresh in
assert (Tf:exists G, (BetS A C G /\ Cong C G E C)) by (conclude lemma_extension);destruct Tf as [G];spliter.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col B E A).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A E C) by (conclude_def Col ).
(* Goal: False *)
 assert (Col E A B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col E A C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq A E) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq E A) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col A B C) by (conclude lemma_collinear4).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B E A C E F) by (conclude proposition_15a).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col A E B).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col B E A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A E B B E A) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A E B C E F) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Cong B E F E) by (forward_using lemma_doublereverse).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Cong E B E F) by (forward_using lemma_congruenceflip).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col E A B).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col B E A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert ((Cong A B C F /\ CongA E A B E C F /\ CongA E B A E F C)) by (conclude proposition_04).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col B A E).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col E A B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out A C E) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (eq B B) by (conclude cn_equalityreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq A B) by (forward_using lemma_angledistinct).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq B A) by (conclude lemma_inequalitysymmetric).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out A B B) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col B A C).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C B A C) by (conclude lemma_equalanglesreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C B A E) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A E E A B) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C E A B) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C E C F) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS C E A) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C E) by (forward_using lemma_betweennotequal).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C E A) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (eq F F) by (conclude cn_equalityreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col E C F).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col B E F) by (conclude_def Col ).
(* Goal: False *)
 assert (Col F E B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col F E C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq E F) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq F E) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col E B C) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col A E C) by (conclude_def Col ).
(* Goal: False *)
 assert (Col E C B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col E C A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq E C) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (Col C B A) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq C F).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col E C F) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C F F) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA E C F E C F) by (conclude lemma_equalanglesreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA E C F A C F) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C A C F) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS D C B) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS F E B) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col D B F).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col F B D) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col B E F) by (conclude_def Col ).
(* Goal: False *)
 assert (Col F B E) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq B F) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq F B) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col B D E) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col D B E) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col B C D) by (conclude_def Col ).
(* Goal: False *)
 assert (Col D B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq B D) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq D B) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col B E C) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col E C B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col A E C) by (conclude_def Col ).
(* Goal: False *)
 assert (Col E C A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq E C) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (Col C B A) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
rename_H H;
let Tf:=fresh in
assert (Tf:exists H, (BetS D H E /\ BetS F H C)) by (conclude postulate_Pasch_inner);destruct Tf as [H];spliter.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS C H F) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C F H) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (eq A A) by (conclude cn_equalityreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C A A) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C A C H) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C A C F) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS E H D) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C A E) by (conclude lemma_ray5).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (eq D D) by (conclude cn_equalityreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq D C) by (forward_using lemma_betweennotequal).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C D) by (conclude lemma_inequalitysymmetric).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C D D) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B A C A C H) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (LtA B A C A C D) by (conclude_def LtA ).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq B C) by (forward_using lemma_betweennotequal).
let Tf:=fresh in
assert (Tf:exists e, (BetS B e C /\ Cong e B e C)) by (conclude proposition_10);destruct Tf as [e];spliter.
(* Goal: False *)
assert (Col B e C) by (conclude_def Col ).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq A e).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (BetS B A C) by (conclude cn_equalitysub).
(* Goal: False *)
 assert (Col B A C) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq e A) by (conclude lemma_inequalitysymmetric).
let Tf:=fresh in
assert (Tf:exists f, (BetS A e f /\ Cong e f e A)) by (conclude lemma_extension);destruct Tf as [f];spliter.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq B C).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col B A C) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col A e B).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col B e C) by (conclude_def Col ).
(* Goal: False *)
 assert (Col e B A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col e B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq B e) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq e B) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col B A C) by (conclude lemma_collinear4).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A e B C e f) by (conclude proposition_15a).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col B e A).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A e B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B e A A e B) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA B e A C e f) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Cong A e f e) by (forward_using lemma_doublereverse).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Cong e A e f) by (forward_using lemma_congruenceflip).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col e B A).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A e B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert ((Cong B A C f /\ CongA e B A e C f /\ CongA e A B e f C)) by (conclude proposition_04).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col A B e).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col e B A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out B C e) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out B A A) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col A B C).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col B A C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C A B C) by (conclude lemma_equalanglesreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C A B e) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B e e B A) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C e B A) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C e C f) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS C e B) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C e) by (forward_using lemma_betweennotequal).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C e B) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (eq f f) by (conclude cn_equalityreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (nCol e C f) by (conclude lemma_equalanglesNC).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ eq C f).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col e C f) by (conclude_def Col ).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C f f) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col e C f).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A e f) by (conclude_def Col ).
(* Goal: False *)
 assert (Col f e A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col f e C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq e f) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq f e) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col e A C) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col e C A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col e C B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq e C) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (Col C A B) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col B A C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA e C f e C f) by (conclude lemma_equalanglesreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA e C f B C f) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C B C f) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS G C A) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq G C) by (forward_using lemma_betweennotequal).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C G) by (conclude lemma_inequalitysymmetric).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS f e A) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col G A f).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col f A G) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col A e f) by (conclude_def Col ).
(* Goal: False *)
 assert (Col f A e) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq A f) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq f A) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col A G e) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col G A e) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col A C G) by (conclude_def Col ).
(* Goal: False *)
 assert (Col G A C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq A G) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq G A) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col A e C) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col e C A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col B e C) by (conclude_def Col ).
(* Goal: False *)
 assert (Col e C B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq e C) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (Col C A B) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
let Tf:=fresh in
assert (Tf:exists h, (BetS G h e /\ BetS f h C)) by (conclude postulate_Pasch_inner);destruct Tf as [h];spliter.
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS C h f) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq h C) by (forward_using lemma_betweennotequal).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (neq C h) by (conclude lemma_inequalitysymmetric).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C h f) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C f h) by (conclude lemma_ray5).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C B B) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C B C h) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C B C f) by (conclude lemma_equalangleshelper).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS e h G) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (BetS C e B) by (conclude axiom_betweennesssymmetry).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C e B) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C B e) by (conclude lemma_ray5).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (eq G G) by (conclude cn_equalityreflexive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (Out C G G) by (conclude lemma_ray4).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A B C B C h) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (LtA A B C B C G) by (conclude_def LtA ).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col G C B).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A C G) by (conclude_def Col ).
(* Goal: False *)
 assert (Col G C A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq C G) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq G C) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col C B A) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA G C B D C A) by (conclude proposition_15a).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col A C D).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col D C A) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (Col B C D) by (conclude_def Col ).
(* Goal: False *)
 assert (Col D C B) by (forward_using lemma_collinearorder).
(* Goal: False *)
 assert (neq C D) by (forward_using lemma_betweennotequal).
(* Goal: False *)
 assert (neq D C) by (conclude lemma_inequalitysymmetric).
(* Goal: False *)
 assert (Col C A B) by (conclude lemma_collinear4).
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA G C B B C G) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (LtA A B C G C B) by (conclude lemma_angleorderrespectscongruence).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col D C A).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A C D) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA D C A A C D) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA G C B A C D) by (conclude lemma_equalanglestransitive).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA A C D G C B) by (conclude lemma_equalanglessymmetric).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (LtA A B C A C D) by (conclude lemma_angleorderrespectscongruence).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (~ Col C B A).
(* Goal: not (@Col Ax0 C B A) *)
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
 {
(* Goal: not (@Col Ax0 C B A) *)
 intro.
(* Goal: False *)
 assert (Col A B C) by (forward_using lemma_collinearorder).
(* Goal: False *)
 contradict.
 }
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (CongA C B A A B C) by (conclude lemma_ABCequalsCBA).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
assert (LtA C B A A C D) by (conclude lemma_angleorderrespectscongruence2).
(* Goal: and (@LtA Ax0 B A C A C D) (@LtA Ax0 C B A A C D) *)
close.
Qed.

End Euclid.


