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 28064

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 2733	. . . 4 ⊢ (hlG‘𝐺) = (hlG‘𝐺)
6		dfcgra2.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7	6	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐺 ∈ TarskiG)
8		dfcgra2.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
9	8	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐴 ∈ 𝑃)
10		dfcgra2.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
11	10	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐵 ∈ 𝑃)
12		dfcgra2.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
13	12	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐶 ∈ 𝑃)
14		simplr 768	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑 ∈ 𝑃)
15		dfcgra2.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
16	15	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐸 ∈ 𝑃)
17		dfcgra2.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
18	17	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐹 ∈ 𝑃)
19		acopy.1	. . . . 5 ⊢ (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
20	19	ad2antrr 725	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
21		dfcgra2.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
22	21	ad2antrr 725	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝐷 ∈ 𝑃)
23		acopy.2	. . . . . 6 ⊢ (𝜑 → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
24	23	ad2antrr 725	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
25		simprl 770	. . . . . 6 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑((hlG‘𝐺)‘𝐸)𝐷)
26	1, 3, 5, 14, 22, 16, 7, 4, 25	hlln 27838	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑 ∈ (𝐷𝐿𝐸))
27	1, 3, 5, 14, 22, 16, 7, 25	hlne1 27836	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → 𝑑 ≠ 𝐸)
28	1, 3, 4, 7, 22, 16, 18, 14, 24, 26, 27	ncolncol 27877	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ¬ (𝑑 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
29		simprr 772	. . . . . 6 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (𝐸 − 𝑑) = (𝐵 − 𝐴))
30	29	eqcomd 2739	. . . . 5 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (𝐵 − 𝐴) = (𝐸 − 𝑑))
31	1, 2, 3, 7, 11, 9, 16, 14, 30	tgcgrcomlr 27711	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (𝐴 − 𝐵) = (𝑑 − 𝐸))
32	1, 2, 3, 4, 5, 7, 9, 11, 13, 14, 16, 18, 20, 28, 31	trgcopy 28035	. . 3 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹))
33	7	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐺 ∈ TarskiG)
34	9	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐴 ∈ 𝑃)
35	11	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐵 ∈ 𝑃)
36	13	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐶 ∈ 𝑃)
37	14	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝑑 ∈ 𝑃)
38	16	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐸 ∈ 𝑃)
39		simplr 768	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝑓 ∈ 𝑃)
40	1, 3, 4, 6, 8, 10, 12, 19	ncolne1 27856	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ≠ 𝐵)
41	40	ad4antr 731	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐴 ≠ 𝐵)
42	1, 4, 3, 6, 10, 12, 8, 19	ncolrot1 27793	. . . . . . . . . 10 ⊢ (𝜑 → ¬ (𝐵 ∈ (𝐶𝐿𝐴) ∨ 𝐶 = 𝐴))
43	1, 3, 4, 6, 10, 12, 8, 42	ncolne1 27856	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ≠ 𝐶)
44	43	ad4antr 731	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐵 ≠ 𝐶)
45		simpr 486	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩)
46	1, 3, 33, 5, 34, 35, 36, 37, 38, 39, 41, 44, 45	cgrcgra 28052	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝑑𝐸𝑓”⟩)
47	22	ad2antrr 725	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐷 ∈ 𝑃)
48	25	ad2antrr 725	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝑑((hlG‘𝐺)‘𝐸)𝐷)
49	1, 3, 5, 37, 47, 38, 33, 48	hlcomd 27835	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → 𝐷((hlG‘𝐺)‘𝐸)𝑑)
50	1, 3, 5, 33, 34, 35, 36, 37, 38, 39, 46, 47, 49	cgrahl1 28047	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩)
51	50	ex 414	. . . . 5 ⊢ ((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩))
52		simpr 486	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹)
53	7	ad2antrr 725	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝐺 ∈ TarskiG)
54	14	ad2antrr 725	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑑 ∈ 𝑃)
55	16	ad2antrr 725	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝐸 ∈ 𝑃)
56	27	ad2antrr 725	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑑 ≠ 𝐸)
57	1, 3, 4, 6, 21, 15, 17, 23	ncolne1 27856	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ≠ 𝐸)
58	1, 3, 4, 6, 21, 15, 57	tgelrnln 27861	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐷𝐿𝐸) ∈ ran 𝐿)
59	58	ad4antr 731	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (𝐷𝐿𝐸) ∈ ran 𝐿)
60	26	ad2antrr 725	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑑 ∈ (𝐷𝐿𝐸))
61	1, 3, 4, 6, 21, 15, 57	tglinerflx2 27865	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐸 ∈ (𝐷𝐿𝐸))
62	61	ad4antr 731	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝐸 ∈ (𝐷𝐿𝐸))
63	1, 3, 4, 53, 54, 55, 56, 56, 59, 60, 62	tglinethru 27867	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (𝐷𝐿𝐸) = (𝑑𝐿𝐸))
64	63	fveq2d 6892	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → ((hpG‘𝐺)‘(𝐷𝐿𝐸)) = ((hpG‘𝐺)‘(𝑑𝐿𝐸)))
65	64	breqd 5158	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹 ↔ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹))
66	52, 65	mpbird 257	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)
67	66	ex 414	. . . . 5 ⊢ ((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) → (𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹 → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
68	51, 67	anim12d 610	. . . 4 ⊢ ((((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) ∧ 𝑓 ∈ 𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
69	68	reximdva 3169	. . 3 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → (∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑑𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝑑𝐿𝐸))𝐹) → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
70	32, 69	mpd 15	. 2 ⊢ (((𝜑 ∧ 𝑑 ∈ 𝑃) ∧ (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴))) → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
71	40	necomd 2997	. . 3 ⊢ (𝜑 → 𝐵 ≠ 𝐴)
72	1, 3, 5, 15, 10, 8, 6, 21, 2, 57, 71	hlcgrex 27847	. 2 ⊢ (𝜑 → ∃𝑑 ∈ 𝑃 (𝑑((hlG‘𝐺)‘𝐸)𝐷 ∧ (𝐸 − 𝑑) = (𝐵 − 𝐴)))
73	70, 72	r19.29a 3163	1 ⊢ (𝜑 → ∃𝑓 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∃wrex 3071 class class class wbr 5147 ran crn 5676 ‘cfv 6540 (class class class)co 7404 ⟨“cs3 14789 Basecbs 17140 distcds 17202 TarskiGcstrkg 27658 Itvcitv 27664 LineGclng 27665 cgrGccgrg 27741 hlGchlg 27831 hpGchpg 27988 cgrAccgra 28038

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7720 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7851 df-1st 7970 df-2nd 7971 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-oadd 8465 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-dju 9892 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-xnn0 12541 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-hash 14287 df-word 14461 df-concat 14517 df-s1 14542 df-s2 14795 df-s3 14796 df-trkgc 27679 df-trkgb 27680 df-trkgcb 27681 df-trkgld 27683 df-trkg 27684 df-cgrg 27742 df-ismt 27764 df-leg 27814 df-hlg 27832 df-mir 27884 df-rag 27925 df-perpg 27927 df-hpg 27989 df-mid 28005 df-lmi 28006 df-cgra 28039

This theorem is referenced by: (None)

W3C validator