hypcgrlem1 - Metamath Proof Explorer

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

Theorem hypcgrlem1 28744

Description: Lemma for hypcgr 28746, case where triangles share a cathetus. (Contributed by Thierry Arnoux, 15-Dec-2019.)

**Hypotheses**
Ref	Expression
hypcgr.p	⊢ 𝑃 = (Base‘𝐺)
hypcgr.m	⊢ − = (dist‘𝐺)
hypcgr.i	⊢ 𝐼 = (Itv‘𝐺)
hypcgr.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
hypcgr.h	⊢ (𝜑 → 𝐺Dim_TarskiG≥2)
hypcgr.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
hypcgr.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
hypcgr.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
hypcgr.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
hypcgr.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
hypcgr.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
hypcgr.1	⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
hypcgr.2	⊢ (𝜑 → ⟨“𝐷𝐸𝐹”⟩ ∈ (∟G‘𝐺))
hypcgr.3	⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸))
hypcgr.4	⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹))
hypcgrlem2.b	⊢ (𝜑 → 𝐵 = 𝐸)
hypcgrlem1.s	⊢ 𝑆 = ((lInvG‘𝐺)‘((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵))
hypcgrlem1.a	⊢ (𝜑 → 𝐶 = 𝐹)

**Assertion**
Ref	Expression
hypcgrlem1	⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹))

**Proof of Theorem hypcgrlem1**
Step	Hyp	Ref	Expression
1		hypcgr.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		hypcgr.m	. . 3 ⊢ − = (dist‘𝐺)
3		hypcgr.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
4		hypcgr.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐺 ∈ TarskiG)
6		hypcgr.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
7	6	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐶 ∈ 𝑃)
8		hypcgr.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
9	8	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐴 ∈ 𝑃)
10		hypcgr.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
11	10	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐹 ∈ 𝑃)
12		hypcgr.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
13	12	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐷 ∈ 𝑃)
14		eqid 2734	. . . . . . 7 ⊢ (LineG‘𝐺) = (LineG‘𝐺)
15		eqid 2734	. . . . . . 7 ⊢ (pInvG‘𝐺) = (pInvG‘𝐺)
16		hypcgr.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
17		hypcgr.1	. . . . . . 7 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
18	1, 2, 3, 14, 15, 4, 8, 16, 6, 17	ragcom 28643	. . . . . 6 ⊢ (𝜑 → ⟨“𝐶𝐵𝐴”⟩ ∈ (∟G‘𝐺))
19	1, 2, 3, 14, 15, 4, 6, 16, 8	israg 28642	. . . . . 6 ⊢ (𝜑 → (⟨“𝐶𝐵𝐴”⟩ ∈ (∟G‘𝐺) ↔ (𝐶 − 𝐴) = (𝐶 − (((pInvG‘𝐺)‘𝐵)‘𝐴))))
20	18, 19	mpbid 232	. . . . 5 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐶 − (((pInvG‘𝐺)‘𝐵)‘𝐴)))
21	20	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → (𝐶 − 𝐴) = (𝐶 − (((pInvG‘𝐺)‘𝐵)‘𝐴)))
22		hypcgrlem1.a	. . . . . . 7 ⊢ (𝜑 → 𝐶 = 𝐹)
23	22	eqcomd 2740	. . . . . 6 ⊢ (𝜑 → 𝐹 = 𝐶)
24	23	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐹 = 𝐶)
25		hypcgr.h	. . . . . . 7 ⊢ (𝜑 → 𝐺Dim_TarskiG≥2)
26	1, 2, 3, 4, 25, 8, 12, 15, 16	ismidb 28723	. . . . . 6 ⊢ (𝜑 → (𝐷 = (((pInvG‘𝐺)‘𝐵)‘𝐴) ↔ (𝐴(midG‘𝐺)𝐷) = 𝐵))
27	26	biimpar 477	. . . . 5 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → 𝐷 = (((pInvG‘𝐺)‘𝐵)‘𝐴))
28	24, 27	oveq12d 7431	. . . 4 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → (𝐹 − 𝐷) = (𝐶 − (((pInvG‘𝐺)‘𝐵)‘𝐴)))
29	21, 28	eqtr4d 2772	. . 3 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → (𝐶 − 𝐴) = (𝐹 − 𝐷))
30	1, 2, 3, 5, 7, 9, 11, 13, 29	tgcgrcomlr 28425	. 2 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) = 𝐵) → (𝐴 − 𝐶) = (𝐷 − 𝐹))
31		simpr 484	. . . 4 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = 𝐷) → 𝐴 = 𝐷)
32	22	ad2antrr 726	. . . 4 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = 𝐷) → 𝐶 = 𝐹)
33	31, 32	oveq12d 7431	. . 3 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = 𝐷) → (𝐴 − 𝐶) = (𝐷 − 𝐹))
34	17	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
35	4	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐺 ∈ TarskiG)
36	8	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐴 ∈ 𝑃)
37	16	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐵 ∈ 𝑃)
38	6	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐶 ∈ 𝑃)
39	1, 2, 3, 14, 15, 35, 36, 37, 38	israg 28642	. . . . . 6 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺) ↔ (𝐴 − 𝐶) = (𝐴 − (((pInvG‘𝐺)‘𝐵)‘𝐶))))
40	34, 39	mpbid 232	. . . . 5 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 − 𝐶) = (𝐴 − (((pInvG‘𝐺)‘𝐵)‘𝐶)))
41	25	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐺Dim_TarskiG≥2)
42		hypcgrlem1.s	. . . . . . 7 ⊢ 𝑆 = ((lInvG‘𝐺)‘((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵))
43	12	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐷 ∈ 𝑃)
44	1, 2, 3, 35, 41, 36, 43	midcl 28722	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ∈ 𝑃)
45		simplr 768	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ≠ 𝐵)
46	1, 3, 14, 35, 44, 37, 45	tgelrnln 28575	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵) ∈ ran (LineG‘𝐺))
47		eqid 2734	. . . . . . 7 ⊢ ((pInvG‘𝐺)‘𝐵) = ((pInvG‘𝐺)‘𝐵)
48		eqid 2734	. . . . . . . . 9 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺)
49	1, 2, 3, 14, 15, 35, 37, 47, 38	mircl 28606	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (((pInvG‘𝐺)‘𝐵)‘𝐶) ∈ 𝑃)
50		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐴 ≠ 𝐷)
51	1, 2, 3, 35, 41, 36, 43	midbtwn 28724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ∈ (𝐴𝐼𝐷))
52	1, 14, 3, 35, 36, 44, 43, 51	btwncolg3 28502	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷 ∈ (𝐴(LineG‘𝐺)(𝐴(midG‘𝐺)𝐷)) ∨ 𝐴 = (𝐴(midG‘𝐺)𝐷)))
53		eqidd 2735	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 = 𝐷)
54		hypcgrlem2.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 = 𝐸)
55	53, 54, 22	s3eqd 14886	. . . . . . . . . . . 12 ⊢ (𝜑 → ⟨“𝐷𝐵𝐶”⟩ = ⟨“𝐷𝐸𝐹”⟩)
56	55	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ⟨“𝐷𝐵𝐶”⟩ = ⟨“𝐷𝐸𝐹”⟩)
57		hypcgr.2	. . . . . . . . . . . 12 ⊢ (𝜑 → ⟨“𝐷𝐸𝐹”⟩ ∈ (∟G‘𝐺))
58	57	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ⟨“𝐷𝐸𝐹”⟩ ∈ (∟G‘𝐺))
59	56, 58	eqeltrd 2833	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ⟨“𝐷𝐵𝐶”⟩ ∈ (∟G‘𝐺))
60	1, 2, 3, 14, 15, 35, 43, 37, 38	israg 28642	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (⟨“𝐷𝐵𝐶”⟩ ∈ (∟G‘𝐺) ↔ (𝐷 − 𝐶) = (𝐷 − (((pInvG‘𝐺)‘𝐵)‘𝐶))))
61	59, 60	mpbid 232	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷 − 𝐶) = (𝐷 − (((pInvG‘𝐺)‘𝐵)‘𝐶)))
62	1, 14, 3, 35, 36, 43, 44, 48, 38, 49, 2, 50, 52, 40, 61	lncgr 28514	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ((𝐴(midG‘𝐺)𝐷) − 𝐶) = ((𝐴(midG‘𝐺)𝐷) − (((pInvG‘𝐺)‘𝐵)‘𝐶)))
63	1, 2, 3, 14, 15, 35, 44, 37, 38	israg 28642	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (⟨“(𝐴(midG‘𝐺)𝐷)𝐵𝐶”⟩ ∈ (∟G‘𝐺) ↔ ((𝐴(midG‘𝐺)𝐷) − 𝐶) = ((𝐴(midG‘𝐺)𝐷) − (((pInvG‘𝐺)‘𝐵)‘𝐶))))
64	62, 63	mpbird 257	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ⟨“(𝐴(midG‘𝐺)𝐷)𝐵𝐶”⟩ ∈ (∟G‘𝐺))
65	1, 3, 14, 35, 44, 37, 45	tglinerflx1 28578	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ∈ ((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵))
66	1, 3, 14, 35, 44, 37, 45	tglinerflx2 28579	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐵 ∈ ((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵))
67	1, 2, 3, 35, 41, 42, 14, 46, 44, 47, 64, 65, 66, 38, 45	lmimid 28739	. . . . . 6 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝑆‘𝐶) = (((pInvG‘𝐺)‘𝐵)‘𝐶))
68	67	oveq2d 7429	. . . . 5 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 − (𝑆‘𝐶)) = (𝐴 − (((pInvG‘𝐺)‘𝐵)‘𝐶)))
69	40, 68	eqtr4d 2772	. . . 4 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 − 𝐶) = (𝐴 − (𝑆‘𝐶)))
70	1, 2, 3, 35, 41, 43, 36	midcom 28727	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷(midG‘𝐺)𝐴) = (𝐴(midG‘𝐺)𝐷))
71	70, 65	eqeltrd 2833	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷(midG‘𝐺)𝐴) ∈ ((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵))
72	50	necomd 2986	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐷 ≠ 𝐴)
73	1, 3, 14, 35, 43, 36, 72	tgelrnln 28575	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷(LineG‘𝐺)𝐴) ∈ ran (LineG‘𝐺))
74	1, 2, 3, 35, 36, 44, 43, 51	tgbtwncom 28433	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ∈ (𝐷𝐼𝐴))
75	1, 3, 14, 35, 43, 36, 44, 72, 74	btwnlng1 28564	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ∈ (𝐷(LineG‘𝐺)𝐴))
76	65, 75	elind 4180	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) ∈ (((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵) ∩ (𝐷(LineG‘𝐺)𝐴)))
77	1, 3, 14, 35, 43, 36, 72	tglinerflx2 28579	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐴 ∈ (𝐷(LineG‘𝐺)𝐴))
78	45	necomd 2986	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐵 ≠ (𝐴(midG‘𝐺)𝐷))
79	4	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → 𝐺 ∈ TarskiG)
80	8	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → 𝐴 ∈ 𝑃)
81	12	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → 𝐷 ∈ 𝑃)
82	25	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → 𝐺Dim_TarskiG≥2)
83		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → 𝐴 = (𝐴(midG‘𝐺)𝐷))
84	83	eqcomd 2740	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → (𝐴(midG‘𝐺)𝐷) = 𝐴)
85	1, 2, 3, 79, 82, 80, 81, 84	midcgr 28725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → (𝐴 − 𝐴) = (𝐴 − 𝐷))
86	85	eqcomd 2740	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → (𝐴 − 𝐷) = (𝐴 − 𝐴))
87	1, 2, 3, 79, 80, 81, 80, 86	axtgcgrid 28408	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 = (𝐴(midG‘𝐺)𝐷)) → 𝐴 = 𝐷)
88	87	ex 412	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) → (𝐴 = (𝐴(midG‘𝐺)𝐷) → 𝐴 = 𝐷))
89	88	necon3d 2952	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) → (𝐴 ≠ 𝐷 → 𝐴 ≠ (𝐴(midG‘𝐺)𝐷)))
90	89	imp 406	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐴 ≠ (𝐴(midG‘𝐺)𝐷))
91		hypcgr.e	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
92		hypcgr.3	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸))
93	1, 2, 3, 4, 8, 16, 12, 91, 92	tgcgrcomlr 28425	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝐸 − 𝐷))
94	54	oveq1d 7428	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐵 − 𝐷) = (𝐸 − 𝐷))
95	93, 94	eqtr4d 2772	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝐵 − 𝐷))
96	95	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐵 − 𝐴) = (𝐵 − 𝐷))
97		eqidd 2735	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴(midG‘𝐺)𝐷) = (𝐴(midG‘𝐺)𝐷))
98	1, 2, 3, 35, 41, 36, 43, 15, 44	ismidb 28723	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷 = (((pInvG‘𝐺)‘(𝐴(midG‘𝐺)𝐷))‘𝐴) ↔ (𝐴(midG‘𝐺)𝐷) = (𝐴(midG‘𝐺)𝐷)))
99	97, 98	mpbird 257	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐷 = (((pInvG‘𝐺)‘(𝐴(midG‘𝐺)𝐷))‘𝐴))
100	99	oveq2d 7429	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐵 − 𝐷) = (𝐵 − (((pInvG‘𝐺)‘(𝐴(midG‘𝐺)𝐷))‘𝐴)))
101	96, 100	eqtrd 2769	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐵 − 𝐴) = (𝐵 − (((pInvG‘𝐺)‘(𝐴(midG‘𝐺)𝐷))‘𝐴)))
102	1, 2, 3, 14, 15, 35, 37, 44, 36	israg 28642	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (⟨“𝐵(𝐴(midG‘𝐺)𝐷)𝐴”⟩ ∈ (∟G‘𝐺) ↔ (𝐵 − 𝐴) = (𝐵 − (((pInvG‘𝐺)‘(𝐴(midG‘𝐺)𝐷))‘𝐴))))
103	101, 102	mpbird 257	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ⟨“𝐵(𝐴(midG‘𝐺)𝐷)𝐴”⟩ ∈ (∟G‘𝐺))
104	1, 2, 3, 14, 35, 46, 73, 76, 66, 77, 78, 90, 103	ragperp 28662	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵)(⟂G‘𝐺)(𝐷(LineG‘𝐺)𝐴))
105	104	orcd 873	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵)(⟂G‘𝐺)(𝐷(LineG‘𝐺)𝐴) ∨ 𝐷 = 𝐴))
106	1, 2, 3, 35, 41, 42, 14, 46, 43, 36	islmib 28732	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 = (𝑆‘𝐷) ↔ ((𝐷(midG‘𝐺)𝐴) ∈ ((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵) ∧ (((𝐴(midG‘𝐺)𝐷)(LineG‘𝐺)𝐵)(⟂G‘𝐺)(𝐷(LineG‘𝐺)𝐴) ∨ 𝐷 = 𝐴))))
107	71, 105, 106	mpbir2and 713	. . . . . 6 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → 𝐴 = (𝑆‘𝐷))
108	107	oveq1d 7428	. . . . 5 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 − (𝑆‘𝐶)) = ((𝑆‘𝐷) − (𝑆‘𝐶)))
109	1, 2, 3, 35, 41, 42, 14, 46, 43, 38	lmiiso 28742	. . . . 5 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → ((𝑆‘𝐷) − (𝑆‘𝐶)) = (𝐷 − 𝐶))
110	22	oveq2d 7429	. . . . . 6 ⊢ (𝜑 → (𝐷 − 𝐶) = (𝐷 − 𝐹))
111	110	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐷 − 𝐶) = (𝐷 − 𝐹))
112	108, 109, 111	3eqtrd 2773	. . . 4 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 − (𝑆‘𝐶)) = (𝐷 − 𝐹))
113	69, 112	eqtrd 2769	. . 3 ⊢ (((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) ∧ 𝐴 ≠ 𝐷) → (𝐴 − 𝐶) = (𝐷 − 𝐹))
114	33, 113	pm2.61dane 3018	. 2 ⊢ ((𝜑 ∧ (𝐴(midG‘𝐺)𝐷) ≠ 𝐵) → (𝐴 − 𝐶) = (𝐷 − 𝐹))
115	30, 114	pm2.61dane 3018	1 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1539 ∈ wcel 2107 ≠ wne 2931 class class class wbr 5123 ‘cfv 6541 (class class class)co 7413 2c2 12303 ⟨“cs3 14864 Basecbs 17230 distcds 17283 TarskiGcstrkg 28372 Dim_TarskiG≥cstrkgld 28376 Itvcitv 28378 LineGclng 28379 cgrGccgrg 28455 pInvGcmir 28597 ∟Gcrag 28638 ⟂Gcperpg 28640 midGcmid 28717 lInvGclmi 28718

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5259 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-cnex 11193 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4888 df-int 4927 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7870 df-1st 7996 df-2nd 7997 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-1o 8488 df-oadd 8492 df-er 8727 df-map 8850 df-pm 8851 df-en 8968 df-dom 8969 df-sdom 8970 df-fin 8971 df-dju 9923 df-card 9961 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 df-nn 12249 df-2 12311 df-3 12312 df-n0 12510 df-xnn0 12583 df-z 12597 df-uz 12861 df-fz 13530 df-fzo 13677 df-hash 14353 df-word 14536 df-concat 14592 df-s1 14617 df-s2 14870 df-s3 14871 df-trkgc 28393 df-trkgb 28394 df-trkgcb 28395 df-trkgld 28397 df-trkg 28398 df-cgrg 28456 df-leg 28528 df-mir 28598 df-rag 28639 df-perpg 28641 df-mid 28719 df-lmi 28720

This theorem is referenced by: hypcgrlem2 28745

W3C validator