Metamath Proof Explorer


Theorem tgextalt1

Description: tgexta 's FIRST conjunct, strict -- the remote interior angle at A is strictly less than the exterior angle at C . tgextale and tgextancgra deliver both halves already, but stated about <" C A B "> ; tgexta wants <" B A C "> , the same angle read backwards. So this is cgraswap plus two transports: leacgra1 for the leA half, and cgratr under mtand for the negation -- if <" B A C "> were congruent to the exterior angle then so would <" C A B "> be, which tgextancgra forbids. (Contributed by JAG, 12-Aug-2026)

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

Proof

Step Hyp Ref Expression
1 tgextalt1.p ⊢ P = Base G
2 tgextalt1.m ⊢ - ˙ = dist ⁡ G
3 tgextalt1.i ⊢ I = Itv ⁡ G
4 tgextalt1.l ⊢ L = Line 𝒢 ⁡ G
5 tgextalt1.k ⊢ K = hl 𝒢 ⁡ G
6 tgextalt1.s ⊢ ≤ ˙ = ≤ 𝒢 ∠ ⁡ G
7 tgextalt1.g ⊢ φ → G ∈ 𝒢 Tarski
8 tgextalt1.a ⊢ φ → A ∈ P
9 tgextalt1.b ⊢ φ → B ∈ P
10 tgextalt1.c ⊢ φ → C ∈ P
11 tgextalt1.d ⊢ φ → D ∈ P
12 tgextalt1.ext ⊢ φ → C ∈ B I D
13 tgextalt1.ncol ⊢ φ → ¬ A ∈ B L C ∨ B = C
14 tgextalt1.ne ⊢ φ → C ≠ D
15 1 2 3 4 5 7 8 9 10 11 12 13 14 tgextale ⊢ φ → ⟨“ CAB ”⟩ ≤ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
16 1 3 4 7 8 9 10 13 ncolne2 ⊢ φ → A ≠ C
17 16 necomd ⊢ φ → C ≠ A
18 1 3 4 7 8 9 10 13 ncolne1 ⊢ φ → A ≠ B
19 1 3 7 5 10 8 9 17 18 cgraswap ⊢ φ → ⟨“ CAB ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ BAC ”⟩
20 1 3 5 7 10 8 9 8 10 11 9 8 10 15 19 leacgra1 ⊢ φ → ⟨“ BAC ”⟩ ≤ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
21 6 breqi ⊢ ⟨“ BAC ”⟩ ≤ ˙ ⟨“ ACD ”⟩ ↔ ⟨“ BAC ”⟩ ≤ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
22 20 21 sylibr ⊢ φ → ⟨“ BAC ”⟩ ≤ ˙ ⟨“ ACD ”⟩
23 1 2 3 4 5 7 8 9 10 11 12 13 14 tgextancgra ⊢ φ → ¬ ⟨“ CAB ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
24 7 adantr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → G ∈ 𝒢 Tarski
25 10 adantr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → C ∈ P
26 8 adantr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → A ∈ P
27 9 adantr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → B ∈ P
28 19 adantr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ CAB ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ BAC ”⟩
29 11 adantr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → D ∈ P
30 simpr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
31 1 3 24 5 25 26 27 27 26 25 28 26 25 29 30 cgratr ⊢ φ ∧ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩ → ⟨“ CAB ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
32 23 31 mtand ⊢ φ → ¬ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩
33 22 32 jca ⊢ φ → ⟨“ BAC ”⟩ ≤ ˙ ⟨“ ACD ”⟩ ∧ ¬ ⟨“ BAC ”⟩ ∼ 𝒢 ∠ ⁡ G ⟨“ ACD ”⟩