hlcgreulem - Metamath Proof Explorer

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

Theorem hlcgreulem 29084

Description: Lemma for hlcgreu 29085. (Contributed by Thierry Arnoux, 9-Aug-2020.)

**Hypotheses**
Ref	Expression
ishlg.p	⊢ 𝑃 = (Base‘𝐺)
ishlg.i	⊢ 𝐼 = (Itv‘𝐺)
ishlg.k	⊢ 𝐾 = (hlG‘𝐺)
ishlg.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
ishlg.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
ishlg.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
hlln.1	⊢ (𝜑 → 𝐺 ∈ TarskiG)
hltr.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
hlcgrex.m	⊢ − = (dist‘𝐺)
hlcgrex.1	⊢ (𝜑 → 𝐷 ≠ 𝐴)
hlcgrex.2	⊢ (𝜑 → 𝐵 ≠ 𝐶)
hlcgreulem.x	⊢ (𝜑 → 𝑋 ∈ 𝑃)
hlcgreulem.y	⊢ (𝜑 → 𝑌 ∈ 𝑃)
hlcgreulem.1	⊢ (𝜑 → 𝑋(𝐾‘𝐴)𝐷)
hlcgreulem.2	⊢ (𝜑 → 𝑌(𝐾‘𝐴)𝐷)
hlcgreulem.3	⊢ (𝜑 → (𝐴 − 𝑋) = (𝐵 − 𝐶))
hlcgreulem.4	⊢ (𝜑 → (𝐴 − 𝑌) = (𝐵 − 𝐶))

**Assertion**
Ref	Expression
hlcgreulem	⊢ (𝜑 → 𝑋 = 𝑌)

Proof of Theorem hlcgreulem Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ishlg.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		hlcgrex.m	. . 3 ⊢ − = (dist‘𝐺)
3		ishlg.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
4		hlln.1	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐺 ∈ TarskiG)
6		ishlg.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
7	6	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ∈ 𝑃)
8		ishlg.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
9	8	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐵 ∈ 𝑃)
10		ishlg.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
11	10	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐶 ∈ 𝑃)
12		simplr 781	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝑦 ∈ 𝑃)
13		hlcgreulem.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
14	13	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝑋 ∈ 𝑃)
15		hlcgreulem.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
16	15	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝑌 ∈ 𝑃)
17		simprr 785	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ≠ 𝑦)
18	17	necomd 3010	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝑦 ≠ 𝐴)
19		ishlg.k	. . . . 5 ⊢ 𝐾 = (hlG‘𝐺)
20		hltr.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
21	20	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐷 ∈ 𝑃)
22		hlcgreulem.1	. . . . . . 7 ⊢ (𝜑 → 𝑋(𝐾‘𝐴)𝐷)
23	1, 3, 19, 13, 20, 6, 4, 22	hlcomd 29071	. . . . . 6 ⊢ (𝜑 → 𝐷(𝐾‘𝐴)𝑋)
24	23	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐷(𝐾‘𝐴)𝑋)
25		simprl 783	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ∈ (𝐷𝐼𝑦))
26	1, 3, 19, 21, 14, 12, 5, 7, 24, 25	btwnhl 29081	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ∈ (𝑋𝐼𝑦))
27	1, 2, 3, 5, 14, 7, 12, 26	tgbtwncom 28952	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ∈ (𝑦𝐼𝑋))
28		hlcgreulem.2	. . . . . . 7 ⊢ (𝜑 → 𝑌(𝐾‘𝐴)𝐷)
29	1, 3, 19, 15, 20, 6, 4, 28	hlcomd 29071	. . . . . 6 ⊢ (𝜑 → 𝐷(𝐾‘𝐴)𝑌)
30	29	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐷(𝐾‘𝐴)𝑌)
31	1, 3, 19, 21, 16, 12, 5, 7, 30, 25	btwnhl 29081	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ∈ (𝑌𝐼𝑦))
32	1, 2, 3, 5, 16, 7, 12, 31	tgbtwncom 28952	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝐴 ∈ (𝑦𝐼𝑌))
33		hlcgreulem.3	. . . 4 ⊢ (𝜑 → (𝐴 − 𝑋) = (𝐵 − 𝐶))
34	33	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → (𝐴 − 𝑋) = (𝐵 − 𝐶))
35		hlcgreulem.4	. . . 4 ⊢ (𝜑 → (𝐴 − 𝑌) = (𝐵 − 𝐶))
36	35	ad2antrr 739	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → (𝐴 − 𝑌) = (𝐵 − 𝐶))
37	1, 2, 3, 5, 7, 9, 11, 12, 14, 16, 18, 27, 32, 34, 36	tgsegconeq 28949	. 2 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦)) → 𝑋 = 𝑌)
38	1	fvexi 6899	. . . . 5 ⊢ 𝑃 ∈ V
39	38	a1i 11	. . . 4 ⊢ (𝜑 → 𝑃 ∈ V)
40		hlcgrex.2	. . . 4 ⊢ (𝜑 → 𝐵 ≠ 𝐶)
41	39, 8, 10, 40	nehash2 14620	. . 3 ⊢ (𝜑 → 2 ≤ (♯‘𝑃))
42	1, 2, 3, 4, 20, 6, 41	tgbtwndiff 28970	. 2 ⊢ (𝜑 → ∃𝑦 ∈ 𝑃 (𝐴 ∈ (𝐷𝐼𝑦) ∧ 𝐴 ≠ 𝑦))
43	37, 42	r19.29a 3170	1 ⊢ (𝜑 → 𝑋 = 𝑌)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 Vcvv 3450 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 Basecbs 17388 distcds 17438 TarskiGcstrkg 28890 Itvcitv 28896 hlGchlg 29064

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-pre-mulgt0 11278

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-1o 8477 df-oadd 8481 df-er 8718 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-dju 9983 df-card 10021 df-pnf 11346 df-mnf 11347 df-xr 11348 df-ltxr 11349 df-le 11350 df-sub 11544 df-neg 11545 df-nn 12337 df-2 12406 df-n0 12608 df-xnn0 12681 df-z 12695 df-uz 12967 df-fz 13641 df-hash 14476 df-trkgc 28911 df-trkgb 28912 df-trkgcb 28913 df-trkg 28916 df-hlg 29065

This theorem is used by: hlcgreu 29085 hlcgreq 29086 iscgra1 29318

W3C validator