Metamath Proof Explorer


Theorem tgextalt2

Description: tgexta 's SECOND conjunct, strict, at a supplied second extension point E . This is NOT a permutation of the first conjunct: E is a new point, C between A and E , and tgextale / tgextancgra are applied a second time at the reconfigured triangle (the roles of A and B exchanged, exterior angle <" B C E "> ). tgextaoa then identifies <" B C E "> with <" A C D "> as vertical angles, and the two halves are transported across that congruence -- leacgra for leA , and cgratr under mtand for the negation, which leacgra cannot move. E is existentially constructed by tgexta , not here. (Contributed by JAG, 12-Aug-2026)

Ref Expression
Hypotheses tgextalt2.p ⊢ P = Base G
tgextalt2.m ⊢ - ˙ = dist ⁡ G
tgextalt2.i ⊢ I = Itv ⁡ G
tgextalt2.l ⊢ L = Line 𝒢 ⁡ G
tgextalt2.k ⊢ K = hl 𝒢 ⁡ G
tgextalt2.s ⊢ ≤ ˙ = ≤ 𝒢 ∠ ⁡ G
tgextalt2.g ⊢ φ → G ∈ 𝒢 Tarski
tgextalt2.a ⊢ φ → A ∈ P
tgextalt2.b ⊢ φ → B ∈ P
tgextalt2.c ⊢ φ → C ∈ P
tgextalt2.d ⊢ φ → D ∈ P
tgextalt2.e ⊢ φ → E ∈ P
tgextalt2.ext ⊢ φ → C ∈ B I D
tgextalt2.ext2 ⊢ φ → C ∈ A I E
tgextalt2.ncol ⊢ φ → ¬ A ∈ B L C ∨ B = C
tgextalt2.ne ⊢ φ → C ≠ D
tgextalt2.ne2 ⊢ φ → C ≠ E
Assertion tgextalt2 ⊢ φ → ⟨“ ABC ”⟩ ≤ ˙ ⟨“ ACD ”⟩ ∧ ¬ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩

Proof

Step Hyp Ref Expression
1 tgextalt2.p ⊢ P = Base G
2 tgextalt2.m ⊢ - ˙ = dist ⁡ G
3 tgextalt2.i ⊢ I = Itv ⁡ G
4 tgextalt2.l ⊢ L = Line 𝒢 ⁡ G
5 tgextalt2.k ⊢ K = hl 𝒢 ⁡ G
6 tgextalt2.s ⊢ ≤ ˙ = ≤ 𝒢 ∠ ⁡ G
7 tgextalt2.g ⊢ φ → G ∈ 𝒢 Tarski
8 tgextalt2.a ⊢ φ → A ∈ P
9 tgextalt2.b ⊢ φ → B ∈ P
10 tgextalt2.c ⊢ φ → C ∈ P
11 tgextalt2.d ⊢ φ → D ∈ P
12 tgextalt2.e ⊢ φ → E ∈ P
13 tgextalt2.ext ⊢ φ → C ∈ B I D
14 tgextalt2.ext2 ⊢ φ → C ∈ A I E
15 tgextalt2.ncol ⊢ φ → ¬ A ∈ B L C ∨ B = C
16 tgextalt2.ne ⊢ φ → C ≠ D
17 tgextalt2.ne2 ⊢ φ → C ≠ E
18 1 4 3 7 9 10 8 15 ncolrot2 ⊢ φ → ¬ C ∈ A L B ∨ A = B
19 1 4 3 7 8 9 10 18 ncolcom ⊢ φ → ¬ C ∈ B L A ∨ B = A
20 1 4 3 7 9 8 10 19 ncolrot1 ⊢ φ → ¬ B ∈ A L C ∨ A = C
21 1 2 3 4 5 7 9 8 10 12 14 20 17 tgextale ⊢ φ → ⟨“ CBA ”⟩ ≤ 𝒢 ∠ ⁡ G ⟨“ BCE ”⟩
22 6 breqi ⊢ ⟨“ CBA ”⟩ ≤ ˙ ⟨“ BCE ”⟩ ↔ ⟨“ CBA ”⟩ ≤ 𝒢 ∠ ⁡ G ⟨“ BCE ”⟩
23 21 22 sylibr ⊢ φ → ⟨“ CBA ”⟩ ≤ ˙ ⟨“ BCE ”⟩
24 1 4 3 7 9 10 8 15 ncolrot1 ⊢ φ → ¬ B ∈ C L A ∨ C = A
25 1 3 4 7 9 10 8 24 ncolne1 ⊢ φ → B ≠ C
26 25 necomd ⊢ φ → C ≠ B
27 1 3 4 7 8 9 10 15 ncolne1 ⊢ φ → A ≠ B
28 27 necomd ⊢ φ → B ≠ A
29 1 3 7 5 10 9 8 26 28 cgraswap ⊢ φ → ⟨“ CBA ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ABC ”⟩
30 1 3 4 7 8 9 10 15 ncolne2 ⊢ φ → A ≠ C
31 30 necomd ⊢ φ → C ≠ A
32 16 necomd ⊢ φ → D ≠ C
33 1 2 3 5 7 8 9 10 11 12 13 14 26 31 32 17 tgextaoa ⊢ φ → ⟨“ BCE ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
34 1 3 5 6 7 10 9 8 9 10 12 8 9 10 8 10 11 23 29 33 leacgra ⊢ φ → ⟨“ ABC ”⟩ ≤ ˙ ⟨“ ACD ”⟩
35 1 2 3 4 5 7 9 8 10 12 14 20 17 tgextancgra ⊢ φ → ¬ ⟨“ CBA ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ BCE ”⟩
36 7 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → G ∈ 𝒢 Tarski
37 10 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → C ∈ P
38 9 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → B ∈ P
39 8 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → A ∈ P
40 11 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → D ∈ P
41 29 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ CBA ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ABC ”⟩
42 simpr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
43 1 3 36 5 37 38 39 39 38 37 41 39 37 40 42 cgratr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ CBA ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
44 12 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → E ∈ P
45 1 3 7 5 9 10 12 8 10 11 33 cgracom ⊢ φ → ⟨“ ACD ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ BCE ”⟩
46 45 adantr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ ACD ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ BCE ”⟩
47 1 3 36 5 37 38 39 39 37 40 43 38 37 44 46 cgratr ⊢ φ ∧ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ CBA ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ BCE ”⟩
48 35 47 mtand ⊢ φ → ¬ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
49 34 48 jca ⊢ φ → ⟨“ ABC ”⟩ ≤ ˙ ⟨“ ACD ”⟩ ∧ ¬ ⟨“ ABC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩