acopy - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > acopy		Structured version Visualization version GIF version

Theorem acopy 28517

Description: Angle construction. Theorem 11.15 of [Schwabhauser] p. 98. This is Hilbert's axiom III.4 for geometry. (Contributed by Thierry Arnoux, 9-Aug-2020.)

**Hypotheses**
Ref	Expression
dfcgra2.p	⊢ 𝑃 = (Base‘𝐺)
dfcgra2.i	⊢ 𝐼 = (Itv‘𝐺)
dfcgra2.m	⊢ − = (dist‘𝐺)
dfcgra2.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
dfcgra2.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
dfcgra2.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
dfcgra2.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
dfcgra2.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
dfcgra2.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
dfcgra2.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
acopy.l	⊢ 𝐿 = (LineG‘𝐺)
acopy.1	⊢ (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
acopy.2	⊢ (𝜑 → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))

**Assertion**
Ref	Expression
acopy	⊢ (𝜑 → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))

Distinct variable groups: − ,𝑓 𝐴,𝑓 𝐵,𝑓 𝐶,𝑓 𝐷,𝑓 𝑓,𝐸 𝑓,𝐹 𝑓,𝐺 𝑓,𝐼 𝑃,𝑓 𝑓,𝐿 𝜑,𝑓

Proof of Theorem acopy Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfcgra2.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
2		dfcgra2.m	. . . 4 ⊢ − = (dist‘𝐺)
3		dfcgra2.i	. . . 4 ⊢ 𝐼 = (Itv‘𝐺)
4		acopy.l	. . . 4 ⊢ 𝐿 = (LineG‘𝐺)
5		eqid 2731	. . . 4 ⊢ (hlG‘𝐺) = (hlG‘𝐺)
6		dfcgra2.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7	6	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐺 ∈ TarskiG)
8		dfcgra2.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
9	8	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐴 ∈ 𝑃)
10		dfcgra2.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
11	10	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐵 ∈ 𝑃)
12		dfcgra2.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
13	12	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐶 ∈ 𝑃)
14		simplr 766	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑 ∈ 𝑃)
15		dfcgra2.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
16	15	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐸 ∈ 𝑃)
17		dfcgra2.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
18	17	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐹 ∈ 𝑃)
19		acopy.1	. . . . 5 ⊢ (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
20	19	ad2antrr 723	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
21		dfcgra2.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
22	21	ad2antrr 723	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐷 ∈ 𝑃)
23		acopy.2	. . . . . 6 ⊢ (𝜑 → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
24	23	ad2antrr 723	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
25		simprl 768	. . . . . 6 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑((hlG‘𝐺)‘𝐸)𝐷)
26	1, 3, 5, 14, 22, 16, 7, 4, 25	hlln 28291	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑 ∈ (𝐷𝐿𝐸))
27	1, 3, 5, 14, 22, 16, 7, 25	hlne1 28289	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑 ≠ 𝐸)
28	1, 3, 4, 7, 22, 16, 18, 14, 24, 26, 27	ncolncol 28330	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ¬ (𝑑 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
29		simprr 770	. . . . . 6 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (𝐸 − 𝑑) = (𝐵 − 𝐴))
30	29	eqcomd 2737	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (𝐵 − 𝐴) = (𝐸 − 𝑑))
31	1, 2, 3, 7, 11, 9, 16, 14, 30	tgcgrcomlr 28164	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (𝐴 − 𝐵) = (𝑑 − 𝐸))
32	1, 2, 3, 4, 5, 7, 9, 11, 13, 14, 16, 18, 20, 28, 31	trgcopy 28488	. . 3 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹))
33	7	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐺 ∈ TarskiG)
34	9	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐴 ∈ 𝑃)
35	11	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐵 ∈ 𝑃)
36	13	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐶 ∈ 𝑃)
37	14	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝑑 ∈ 𝑃)
38	16	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐸 ∈ 𝑃)
39		simplr 766	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝑓 ∈ 𝑃)
40	1, 3, 4, 6, 8, 10, 12, 19	ncolne1 28309	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ≠ 𝐵)
41	40	ad4antr 729	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐴 ≠ 𝐵)
42	1, 4, 3, 6, 10, 12, 8, 19	ncolrot1 28246	. . . . . . . . . 10 ⊢ (𝜑 → ¬ (𝐵 ∈ (𝐶𝐿𝐴) ∨ 𝐶 = 𝐴))
43	1, 3, 4, 6, 10, 12, 8, 42	ncolne1 28309	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ≠ 𝐶)
44	43	ad4antr 729	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐵 ≠ 𝐶)
45		simpr 484	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩)
46	1, 3, 33, 5, 34, 35, 36, 37, 38, 39, 41, 44, 45	cgrcgra 28505	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝑑𝐸𝑓”⟩)
47	22	ad2antrr 723	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐷 ∈ 𝑃)
48	25	ad2antrr 723	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝑑((hlG‘𝐺)‘𝐸)𝐷)
49	1, 3, 5, 37, 47, 38, 33, 48	hlcomd 28288	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐷((hlG‘𝐺)‘𝐸)𝑑)
50	1, 3, 5, 33, 34, 35, 36, 37, 38, 39, 46, 47, 49	cgrahl1 28500	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩)
51	50	ex 412	. . . . 5 ⊢ ((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩))
52		simpr 484	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹)
53	7	ad2antrr 723	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝐺 ∈ TarskiG)
54	14	ad2antrr 723	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑑 ∈ 𝑃)
55	16	ad2antrr 723	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝐸 ∈ 𝑃)
56	27	ad2antrr 723	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑑 ≠ 𝐸)
57	1, 3, 4, 6, 21, 15, 17, 23	ncolne1 28309	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ≠ 𝐸)
58	1, 3, 4, 6, 21, 15, 57	tgelrnln 28314	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐷𝐿𝐸) ∈ ran 𝐿)
59	58	ad4antr 729	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (𝐷𝐿𝐸) ∈ ran 𝐿)
60	26	ad2antrr 723	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑑 ∈ (𝐷𝐿𝐸))
61	1, 3, 4, 6, 21, 15, 57	tglinerflx2 28318	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐸 ∈ (𝐷𝐿𝐸))
62	61	ad4antr 729	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝐸 ∈ (𝐷𝐿𝐸))
63	1, 3, 4, 53, 54, 55, 56, 56, 59, 60, 62	tglinethru 28320	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (𝐷𝐿𝐸) = (𝑑𝐿𝐸))
64	63	fveq2d 6895	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → ((hpG‘𝐺)‘(𝐷𝐿𝐸)) = ((hpG‘𝐺)‘(𝑑𝐿𝐸)))
65	64	breqd 5159	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹 ↔ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹))
66	52, 65	mpbird 257	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)
67	66	ex 412	. . . . 5 ⊢ ((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) → (𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹 → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
68	51, 67	anim12d 608	. . . 4 ⊢ ((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
69	68	reximdva 3167	. . 3 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
70	32, 69	mpd 15	. 2 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
71	40	necomd 2995	. . 3 ⊢ (𝜑 → 𝐵 ≠ 𝐴)
72	1, 3, 5, 15, 10, 8, 6, 21, 2, 57, 71	hlcgrex 28300	. 2 ⊢ (𝜑 → ∃𝑑 ∈ 𝑃 (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴)))
73	70, 72	r19.29a 3161	1 ⊢ (𝜑 → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 844 = wceq 1540 ∈ wcel 2105 ≠ wne 2939 ∃wrex 3069 class class class wbr 5148 ran crn 5677 ‘cfv 6543 (class class class)co 7412 ⟨“cs3 14800 Basecbs 17151 distcds 17213 TarskiGcstrkg 28111 Itvcitv 28117 LineGclng 28118 cgrGccgrg 28194 hlGchlg 28284 hpGchpg 28441 cgrAccgra 28491

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-oadd 8476 df-er 8709 df-map 8828 df-pm 8829 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-dju 9902 df-card 9940 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-nn 12220 df-2 12282 df-3 12283 df-n0 12480 df-xnn0 12552 df-z 12566 df-uz 12830 df-fz 13492 df-fzo 13635 df-hash 14298 df-word 14472 df-concat 14528 df-s1 14553 df-s2 14806 df-s3 14807 df-trkgc 28132 df-trkgb 28133 df-trkgcb 28134 df-trkgld 28136 df-trkg 28137 df-cgrg 28195 df-ismt 28217 df-leg 28267 df-hlg 28285 df-mir 28337 df-rag 28378 df-perpg 28380 df-hpg 28442 df-mid 28458 df-lmi 28459 df-cgra 28492

This theorem is referenced by: (None)

W3C validator