| 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 2766 | . 2 ⊢ (Itv‘𝐺) = (Itv‘𝐺) | |
| 4 | eqid 2766 | . 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 29126 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| 10 | 1, 3, 7, 5, 6, 8 | hlgrcl1 29125 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| 11 | tghlsub.2 | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 12 | tghlsub.4 | . . 3 ⊢ (𝜑 → 𝐷(𝐾‘𝐸)𝐹) | |
| 13 | 1, 3, 7, 5, 11, 12 | hlgrcl2 29126 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| 14 | 1, 3, 7, 5, 11, 12 | hlgrcl1 29125 | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| 15 | 1, 3, 7, 10, 9, 6, 5 | ishlg 29127 | . . . . 5 ⊢ (𝜑 → (𝐴(𝐾‘𝐵)𝐶 ↔ (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ (𝐴 ∈ (𝐵(Itv‘𝐺)𝐶) ∨ 𝐶 ∈ (𝐵(Itv‘𝐺)𝐴))))) |
| 16 | 8, 15 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ (𝐴 ∈ (𝐵(Itv‘𝐺)𝐶) ∨ 𝐶 ∈ (𝐵(Itv‘𝐺)𝐴)))) |
| 17 | 16 | simp3d 1163 | . . 3 ⊢ (𝜑 → (𝐴 ∈ (𝐵(Itv‘𝐺)𝐶) ∨ 𝐶 ∈ (𝐵(Itv‘𝐺)𝐴))) |
| 18 | 17 | orcomd 885 | . 2 ⊢ (𝜑 → (𝐶 ∈ (𝐵(Itv‘𝐺)𝐴) ∨ 𝐴 ∈ (𝐵(Itv‘𝐺)𝐶))) |
| 19 | 1, 3, 7, 14, 13, 11, 5 | ishlg 29127 | . . . . 5 ⊢ (𝜑 → (𝐷(𝐾‘𝐸)𝐹 ↔ (𝐷 ≠ 𝐸 ∧ 𝐹 ≠ 𝐸 ∧ (𝐷 ∈ (𝐸(Itv‘𝐺)𝐹) ∨ 𝐹 ∈ (𝐸(Itv‘𝐺)𝐷))))) |
| 20 | 12, 19 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝐷 ≠ 𝐸 ∧ 𝐹 ≠ 𝐸 ∧ (𝐷 ∈ (𝐸(Itv‘𝐺)𝐹) ∨ 𝐹 ∈ (𝐸(Itv‘𝐺)𝐷)))) |
| 21 | 20 | simp3d 1163 | . . 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 29117 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 class class class wbr 5107 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 distcds 17483 TarskiGcstrkg 28948 Itvcitv 28954 ≤Gcleg 29104 hlGchlg 29122 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-oadd 8517 df-er 8754 df-pm 8887 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-s2 15040 df-s3 15041 df-trkgc 28969 df-trkgb 28970 df-trkgcb 28971 df-trkg 28974 df-cgrg 29033 df-leg 29105 df-hlg 29123 |
| This theorem is used by: zerocgra 29390 |
| Copyright terms: Public domain | W3C validator |