colperpexlem1 - Metamath Proof Explorer

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

Theorem colperpexlem1 28521

Description: Lemma for colperp 28520. First part of lemma 8.20 of [Schwabhauser] p. 62. (Contributed by Thierry Arnoux, 27-Oct-2019.)

**Hypotheses**
Ref	Expression
colperpex.p	⊢ 𝑃 = (Base‘𝐺)
colperpex.d	⊢ − = (dist‘𝐺)
colperpex.i	⊢ 𝐼 = (Itv‘𝐺)
colperpex.l	⊢ 𝐿 = (LineG‘𝐺)
colperpex.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
colperpexlem.s	⊢ 𝑆 = (pInvG‘𝐺)
colperpexlem.m	⊢ 𝑀 = (𝑆‘𝐴)
colperpexlem.n	⊢ 𝑁 = (𝑆‘𝐵)
colperpexlem.k	⊢ 𝐾 = (𝑆‘𝑄)
colperpexlem.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
colperpexlem.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
colperpexlem.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
colperpexlem.q	⊢ (𝜑 → 𝑄 ∈ 𝑃)
colperpexlem.1	⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
colperpexlem.2	⊢ (𝜑 → (𝐾‘(𝑀‘𝐶)) = (𝑁‘𝐶))

**Assertion**
Ref	Expression
colperpexlem1	⊢ (𝜑 → ⟨“𝐵𝐴𝑄”⟩ ∈ (∟G‘𝐺))

**Proof of Theorem colperpexlem1**
Step	Hyp	Ref	Expression
1		colperpex.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
2		colperpex.d	. . . 4 ⊢ − = (dist‘𝐺)
3		colperpex.i	. . . 4 ⊢ 𝐼 = (Itv‘𝐺)
4		colperpex.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5		colperpexlem.q	. . . 4 ⊢ (𝜑 → 𝑄 ∈ 𝑃)
6		colperpexlem.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
7		colperpex.l	. . . . 5 ⊢ 𝐿 = (LineG‘𝐺)
8		colperpexlem.s	. . . . 5 ⊢ 𝑆 = (pInvG‘𝐺)
9		colperpexlem.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
10		colperpexlem.m	. . . . 5 ⊢ 𝑀 = (𝑆‘𝐴)
11	1, 2, 3, 7, 8, 4, 9, 10, 5	mircl 28452	. . . 4 ⊢ (𝜑 → (𝑀‘𝑄) ∈ 𝑃)
12		colperpexlem.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
13	1, 2, 3, 7, 8, 4, 9, 10, 12	mircl 28452	. . . . 5 ⊢ (𝜑 → (𝑀‘𝐶) ∈ 𝑃)
14		eqid 2727	. . . . . 6 ⊢ (𝑆‘𝐵) = (𝑆‘𝐵)
15	1, 2, 3, 7, 8, 4, 6, 14, 12	mircl 28452	. . . . 5 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝐶) ∈ 𝑃)
16	1, 2, 3, 7, 8, 4, 9, 10, 15	mircl 28452	. . . . 5 ⊢ (𝜑 → (𝑀‘((𝑆‘𝐵)‘𝐶)) ∈ 𝑃)
17		colperpexlem.2	. . . . . . . 8 ⊢ (𝜑 → (𝐾‘(𝑀‘𝐶)) = (𝑁‘𝐶))
18		colperpexlem.n	. . . . . . . . 9 ⊢ 𝑁 = (𝑆‘𝐵)
19	1, 2, 3, 7, 8, 4, 6, 18, 12	mircl 28452	. . . . . . . 8 ⊢ (𝜑 → (𝑁‘𝐶) ∈ 𝑃)
20	17, 19	eqeltrd 2828	. . . . . . 7 ⊢ (𝜑 → (𝐾‘(𝑀‘𝐶)) ∈ 𝑃)
21		colperpexlem.k	. . . . . . . 8 ⊢ 𝐾 = (𝑆‘𝑄)
22	1, 2, 3, 7, 8, 4, 5, 21, 13	mirbtwn 28449	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ ((𝐾‘(𝑀‘𝐶))𝐼(𝑀‘𝐶)))
23	1, 2, 3, 4, 20, 5, 13, 22	tgbtwncom 28279	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ((𝑀‘𝐶)𝐼(𝐾‘(𝑀‘𝐶))))
24	18	fveq1i 6892	. . . . . . . 8 ⊢ (𝑁‘𝐶) = ((𝑆‘𝐵)‘𝐶)
25	17, 24	eqtrdi 2783	. . . . . . 7 ⊢ (𝜑 → (𝐾‘(𝑀‘𝐶)) = ((𝑆‘𝐵)‘𝐶))
26	25	oveq2d 7430	. . . . . 6 ⊢ (𝜑 → ((𝑀‘𝐶)𝐼(𝐾‘(𝑀‘𝐶))) = ((𝑀‘𝐶)𝐼((𝑆‘𝐵)‘𝐶)))
27	23, 26	eleqtrd 2830	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ ((𝑀‘𝐶)𝐼((𝑆‘𝐵)‘𝐶)))
28	1, 2, 3, 4, 13, 5, 15, 27	tgbtwncom 28279	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ (((𝑆‘𝐵)‘𝐶)𝐼(𝑀‘𝐶)))
29	1, 2, 3, 7, 8, 4, 9, 10, 15, 5, 13, 28	mirbtwni 28462	. . . . . 6 ⊢ (𝜑 → (𝑀‘𝑄) ∈ ((𝑀‘((𝑆‘𝐵)‘𝐶))𝐼(𝑀‘(𝑀‘𝐶))))
30	1, 2, 3, 7, 8, 4, 9, 10, 12	mirmir 28453	. . . . . . 7 ⊢ (𝜑 → (𝑀‘(𝑀‘𝐶)) = 𝐶)
31	30	oveq2d 7430	. . . . . 6 ⊢ (𝜑 → ((𝑀‘((𝑆‘𝐵)‘𝐶))𝐼(𝑀‘(𝑀‘𝐶))) = ((𝑀‘((𝑆‘𝐵)‘𝐶))𝐼𝐶))
32	29, 31	eleqtrd 2830	. . . . 5 ⊢ (𝜑 → (𝑀‘𝑄) ∈ ((𝑀‘((𝑆‘𝐵)‘𝐶))𝐼𝐶))
33	1, 2, 3, 4, 13, 15	axtgcgrrflx 28253	. . . . . 6 ⊢ (𝜑 → ((𝑀‘𝐶) − ((𝑆‘𝐵)‘𝐶)) = (((𝑆‘𝐵)‘𝐶) − (𝑀‘𝐶)))
34	1, 2, 3, 7, 8, 4, 9, 10, 15, 13	miriso 28461	. . . . . 6 ⊢ (𝜑 → ((𝑀‘((𝑆‘𝐵)‘𝐶)) − (𝑀‘(𝑀‘𝐶))) = (((𝑆‘𝐵)‘𝐶) − (𝑀‘𝐶)))
35	30	oveq2d 7430	. . . . . 6 ⊢ (𝜑 → ((𝑀‘((𝑆‘𝐵)‘𝐶)) − (𝑀‘(𝑀‘𝐶))) = ((𝑀‘((𝑆‘𝐵)‘𝐶)) − 𝐶))
36	33, 34, 35	3eqtr2d 2773	. . . . 5 ⊢ (𝜑 → ((𝑀‘𝐶) − ((𝑆‘𝐵)‘𝐶)) = ((𝑀‘((𝑆‘𝐵)‘𝐶)) − 𝐶))
37	25	oveq2d 7430	. . . . . . 7 ⊢ (𝜑 → (𝑄 − (𝐾‘(𝑀‘𝐶))) = (𝑄 − ((𝑆‘𝐵)‘𝐶)))
38	1, 2, 3, 7, 8, 4, 5, 21, 13	mircgr 28448	. . . . . . 7 ⊢ (𝜑 → (𝑄 − (𝐾‘(𝑀‘𝐶))) = (𝑄 − (𝑀‘𝐶)))
39	37, 38	eqtr3d 2769	. . . . . 6 ⊢ (𝜑 → (𝑄 − ((𝑆‘𝐵)‘𝐶)) = (𝑄 − (𝑀‘𝐶)))
40	1, 2, 3, 7, 8, 4, 9, 10, 5, 13	miriso 28461	. . . . . 6 ⊢ (𝜑 → ((𝑀‘𝑄) − (𝑀‘(𝑀‘𝐶))) = (𝑄 − (𝑀‘𝐶)))
41	30	oveq2d 7430	. . . . . 6 ⊢ (𝜑 → ((𝑀‘𝑄) − (𝑀‘(𝑀‘𝐶))) = ((𝑀‘𝑄) − 𝐶))
42	39, 40, 41	3eqtr2d 2773	. . . . 5 ⊢ (𝜑 → (𝑄 − ((𝑆‘𝐵)‘𝐶)) = ((𝑀‘𝑄) − 𝐶))
43	1, 2, 3, 7, 8, 4, 9, 10, 6	mirmir 28453	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀‘(𝑀‘𝐵)) = 𝐵)
44		eqidd 2728	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀‘𝐵) = (𝑀‘𝐵))
45		eqidd 2728	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀‘𝐶) = (𝑀‘𝐶))
46	43, 44, 45	s3eqd 14839	. . . . . . . . 9 ⊢ (𝜑 → ⟨“(𝑀‘(𝑀‘𝐵))(𝑀‘𝐵)(𝑀‘𝐶)”⟩ = ⟨“𝐵(𝑀‘𝐵)(𝑀‘𝐶)”⟩)
47	1, 2, 3, 7, 8, 4, 9, 10, 6	mircl 28452	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝑃)
48		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
49	48	fveq2d 6895	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝑀‘𝐴) = (𝑀‘𝐵))
50	4	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG)
51	9	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃)
52	1, 2, 3, 7, 8, 50, 51, 10	mircinv 28459	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝑀‘𝐴) = 𝐴)
53	49, 52	eqtr3d 2769	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝑀‘𝐵) = 𝐴)
54		eqidd 2728	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 = 𝐵)
55		eqidd 2728	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐶 = 𝐶)
56	53, 54, 55	s3eqd 14839	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ⟨“(𝑀‘𝐵)𝐵𝐶”⟩ = ⟨“𝐴𝐵𝐶”⟩)
57		colperpexlem.1	. . . . . . . . . . . . 13 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
58	57	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
59	56, 58	eqeltrd 2828	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ⟨“(𝑀‘𝐵)𝐵𝐶”⟩ ∈ (∟G‘𝐺))
60	4	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐺 ∈ TarskiG)
61	9	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ 𝑃)
62	6	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐵 ∈ 𝑃)
63	12	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐶 ∈ 𝑃)
64	1, 2, 3, 7, 8, 60, 61, 10, 62	mircl 28452	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (𝑀‘𝐵) ∈ 𝑃)
65	57	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ⟨“𝐴𝐵𝐶”⟩ ∈ (∟G‘𝐺))
66		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ≠ 𝐵)
67	1, 2, 3, 7, 8, 60, 61, 10, 62	mirbtwn 28449	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ ((𝑀‘𝐵)𝐼𝐵))
68	1, 7, 3, 60, 64, 62, 61, 67	btwncolg1 28346	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (𝐴 ∈ ((𝑀‘𝐵)𝐿𝐵) ∨ (𝑀‘𝐵) = 𝐵))
69	1, 7, 3, 60, 64, 62, 61, 68	colcom 28349	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (𝐴 ∈ (𝐵𝐿(𝑀‘𝐵)) ∨ 𝐵 = (𝑀‘𝐵)))
70	1, 2, 3, 7, 8, 60, 61, 62, 63, 64, 65, 66, 69	ragcol 28490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ⟨“(𝑀‘𝐵)𝐵𝐶”⟩ ∈ (∟G‘𝐺))
71	59, 70	pm2.61dane 3024	. . . . . . . . . 10 ⊢ (𝜑 → ⟨“(𝑀‘𝐵)𝐵𝐶”⟩ ∈ (∟G‘𝐺))
72	1, 2, 3, 7, 8, 4, 47, 6, 12, 71, 10, 9	mirrag 28492	. . . . . . . . 9 ⊢ (𝜑 → ⟨“(𝑀‘(𝑀‘𝐵))(𝑀‘𝐵)(𝑀‘𝐶)”⟩ ∈ (∟G‘𝐺))
73	46, 72	eqeltrrd 2829	. . . . . . . 8 ⊢ (𝜑 → ⟨“𝐵(𝑀‘𝐵)(𝑀‘𝐶)”⟩ ∈ (∟G‘𝐺))
74	1, 2, 3, 7, 8, 4, 6, 47, 13	israg 28488	. . . . . . . 8 ⊢ (𝜑 → (⟨“𝐵(𝑀‘𝐵)(𝑀‘𝐶)”⟩ ∈ (∟G‘𝐺) ↔ (𝐵 − (𝑀‘𝐶)) = (𝐵 − ((𝑆‘(𝑀‘𝐵))‘(𝑀‘𝐶)))))
75	73, 74	mpbid 231	. . . . . . 7 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐶)) = (𝐵 − ((𝑆‘(𝑀‘𝐵))‘(𝑀‘𝐶))))
76	1, 2, 3, 7, 8, 4, 9, 10, 12, 6	mirmir2 28465	. . . . . . . 8 ⊢ (𝜑 → (𝑀‘((𝑆‘𝐵)‘𝐶)) = ((𝑆‘(𝑀‘𝐵))‘(𝑀‘𝐶)))
77	76	oveq2d 7430	. . . . . . 7 ⊢ (𝜑 → (𝐵 − (𝑀‘((𝑆‘𝐵)‘𝐶))) = (𝐵 − ((𝑆‘(𝑀‘𝐵))‘(𝑀‘𝐶))))
78	75, 77	eqtr4d 2770	. . . . . 6 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐶)) = (𝐵 − (𝑀‘((𝑆‘𝐵)‘𝐶))))
79	1, 2, 3, 4, 6, 13, 6, 16, 78	tgcgrcomlr 28271	. . . . 5 ⊢ (𝜑 → ((𝑀‘𝐶) − 𝐵) = ((𝑀‘((𝑆‘𝐵)‘𝐶)) − 𝐵))
80	1, 2, 3, 7, 8, 4, 6, 14, 12	mircgr 28448	. . . . . 6 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝐶)) = (𝐵 − 𝐶))
81	1, 2, 3, 4, 6, 15, 6, 12, 80	tgcgrcomlr 28271	. . . . 5 ⊢ (𝜑 → (((𝑆‘𝐵)‘𝐶) − 𝐵) = (𝐶 − 𝐵))
82	1, 2, 3, 4, 13, 5, 15, 6, 16, 11, 12, 6, 27, 32, 36, 42, 79, 81	tgifscgr 28299	. . . 4 ⊢ (𝜑 → (𝑄 − 𝐵) = ((𝑀‘𝑄) − 𝐵))
83	1, 2, 3, 4, 5, 6, 11, 6, 82	tgcgrcomlr 28271	. . 3 ⊢ (𝜑 → (𝐵 − 𝑄) = (𝐵 − (𝑀‘𝑄)))
84	10	fveq1i 6892	. . . 4 ⊢ (𝑀‘𝑄) = ((𝑆‘𝐴)‘𝑄)
85	84	oveq2i 7425	. . 3 ⊢ (𝐵 − (𝑀‘𝑄)) = (𝐵 − ((𝑆‘𝐴)‘𝑄))
86	83, 85	eqtrdi 2783	. 2 ⊢ (𝜑 → (𝐵 − 𝑄) = (𝐵 − ((𝑆‘𝐴)‘𝑄)))
87	1, 2, 3, 7, 8, 4, 6, 9, 5	israg 28488	. 2 ⊢ (𝜑 → (⟨“𝐵𝐴𝑄”⟩ ∈ (∟G‘𝐺) ↔ (𝐵 − 𝑄) = (𝐵 − ((𝑆‘𝐴)‘𝑄))))
88	86, 87	mpbird 257	1 ⊢ (𝜑 → ⟨“𝐵𝐴𝑄”⟩ ∈ (∟G‘𝐺))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 ‘cfv 6542 (class class class)co 7414 ⟨“cs3 14817 Basecbs 17171 distcds 17233 TarskiGcstrkg 28218 Itvcitv 28224 LineGclng 28225 pInvGcmir 28443 ∟Gcrag 28484

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-oadd 8484 df-er 8718 df-map 8838 df-pm 8839 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9916 df-card 9954 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-nn 12235 df-2 12297 df-3 12298 df-n0 12495 df-xnn0 12567 df-z 12581 df-uz 12845 df-fz 13509 df-fzo 13652 df-hash 14314 df-word 14489 df-concat 14545 df-s1 14570 df-s2 14823 df-s3 14824 df-trkgc 28239 df-trkgb 28240 df-trkgcb 28241 df-trkg 28244 df-cgrg 28302 df-mir 28444 df-rag 28485

This theorem is referenced by: colperpexlem3 28523

W3C validator