| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tghlsub | Structured version Visualization version GIF version | ||
| Description: Removing identical parts from the end of a ray segment preserves congruence. (Contributed by Thierry Arnoux, 23-Aug-2026.) |
| Ref | Expression |
|---|---|
| tghlsub.p | ⊢ 𝑃 = (Base‘𝐺) |
| tghlsub.d | ⊢ − = (dist‘𝐺) |
| tghlsub.k | ⊢ 𝐾 = (hlG‘𝐺) |
| tghlsub.h | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tghlsub.1 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| tghlsub.2 | ⊢ (𝜑 → 𝐸 ∈ 𝑃) |
| tghlsub.3 | ⊢ (𝜑 → 𝐴(𝐾‘𝐵)𝐶) |
| tghlsub.4 | ⊢ (𝜑 → 𝐷(𝐾‘𝐸)𝐹) |
| tghlsub.5 | ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) |
| tghlsub.6 | ⊢ (𝜑 → (𝐵 − 𝐴) = (𝐸 − 𝐷)) |
| Ref | Expression |
|---|---|
| tghlsub | ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tghlsub.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | tghlsub.d | . 2 ⊢ − = (dist‘𝐺) | |
| 3 | eqid 2760 | . 2 ⊢ (Itv‘𝐺) = (Itv‘𝐺) | |
| 4 | eqid 2760 | . 2 ⊢ (≤G‘𝐺) = (≤G‘𝐺) | |
| 5 | tghlsub.h | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | tghlsub.1 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 7 | tghlsub.k | . . 3 ⊢ 𝐾 = (hlG‘𝐺) | |
| 8 | tghlsub.3 | . . 3 ⊢ (𝜑 → 𝐴(𝐾‘𝐵)𝐶) | |
| 9 | 1, 3, 7, 5, 6, 8 | hlgrcl2 29067 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| 10 | 1, 3, 7, 5, 6, 8 | hlgrcl1 29066 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| 11 | tghlsub.2 | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 12 | tghlsub.4 | . . 3 ⊢ (𝜑 → 𝐷(𝐾‘𝐸)𝐹) | |
| 13 | 1, 3, 7, 5, 11, 12 | hlgrcl2 29067 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| 14 | 1, 3, 7, 5, 11, 12 | hlgrcl1 29066 | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| 15 | 1, 3, 7, 10, 9, 6, 5 | ishlg 29068 | . . . . 5 ⊢ (𝜑 → (𝐴(𝐾‘𝐵)𝐶 ↔ (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ (𝐴 ∈ (𝐵(Itv‘𝐺)𝐶) ∨ 𝐶 ∈ (𝐵(Itv‘𝐺)𝐴))))) |
| 16 | 8, 15 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ (𝐴 ∈ (𝐵(Itv‘𝐺)𝐶) ∨ 𝐶 ∈ (𝐵(Itv‘𝐺)𝐴)))) |
| 17 | 16 | simp3d 1162 | . . 3 ⊢ (𝜑 → (𝐴 ∈ (𝐵(Itv‘𝐺)𝐶) ∨ 𝐶 ∈ (𝐵(Itv‘𝐺)𝐴))) |
| 18 | 17 | orcomd 885 | . 2 ⊢ (𝜑 → (𝐶 ∈ (𝐵(Itv‘𝐺)𝐴) ∨ 𝐴 ∈ (𝐵(Itv‘𝐺)𝐶))) |
| 19 | 1, 3, 7, 14, 13, 11, 5 | ishlg 29068 | . . . . 5 ⊢ (𝜑 → (𝐷(𝐾‘𝐸)𝐹 ↔ (𝐷 ≠ 𝐸 ∧ 𝐹 ≠ 𝐸 ∧ (𝐷 ∈ (𝐸(Itv‘𝐺)𝐹) ∨ 𝐹 ∈ (𝐸(Itv‘𝐺)𝐷))))) |
| 20 | 12, 19 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝐷 ≠ 𝐸 ∧ 𝐹 ≠ 𝐸 ∧ (𝐷 ∈ (𝐸(Itv‘𝐺)𝐹) ∨ 𝐹 ∈ (𝐸(Itv‘𝐺)𝐷)))) |
| 21 | 20 | simp3d 1162 | . . 3 ⊢ (𝜑 → (𝐷 ∈ (𝐸(Itv‘𝐺)𝐹) ∨ 𝐹 ∈ (𝐸(Itv‘𝐺)𝐷))) |
| 22 | 21 | orcomd 885 | . 2 ⊢ (𝜑 → (𝐹 ∈ (𝐸(Itv‘𝐺)𝐷) ∨ 𝐷 ∈ (𝐸(Itv‘𝐺)𝐹))) |
| 23 | tghlsub.5 | . 2 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) | |
| 24 | tghlsub.6 | . 2 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝐸 − 𝐷)) | |
| 25 | 1, 2, 3, 4, 5, 6, 9, 10, 11, 11, 13, 14, 18, 22, 23, 24 | tgcgrsub2 29058 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 distcds 17437 TarskiGcstrkg 28889 Itvcitv 28895 ≤Gcleg 29045 hlGchlg 29063 |
| 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 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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-tp 4588 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 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-pm 8850 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-xnn0 12680 df-z 12694 df-uz 12966 df-fz 13640 df-fzo 13789 df-hash 14475 df-word 14659 df-concat 14716 df-s1 14743 df-s2 14999 df-s3 15000 df-trkgc 28910 df-trkgb 28911 df-trkgcb 28912 df-trkg 28915 df-cgrg 28974 df-leg 29046 df-hlg 29064 |
| This theorem is used by: zerocgra 29331 |
| Copyright terms: Public domain | W3C validator |