| 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 2763 | . 2 ⊢ (Itv‘𝐺) = (Itv‘𝐺) | |
| 4 | eqid 2763 | . 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 29094 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| 10 | 1, 3, 7, 5, 6, 8 | hlgrcl1 29093 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| 11 | tghlsub.2 | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 12 | tghlsub.4 | . . 3 ⊢ (𝜑 → 𝐷(𝐾‘𝐸)𝐹) | |
| 13 | 1, 3, 7, 5, 11, 12 | hlgrcl2 29094 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| 14 | 1, 3, 7, 5, 11, 12 | hlgrcl1 29093 | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| 15 | 1, 3, 7, 10, 9, 6, 5 | ishlg 29095 | . . . . 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 29095 | . . . . 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 29085 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5106 ‘cfv 6555 (class class class)co 7440 Basecbs 17413 distcds 17463 TarskiGcstrkg 28916 Itvcitv 28922 ≤Gcleg 29072 hlGchlg 29090 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-oadd 8505 df-er 8742 df-pm 8875 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-dju 10006 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-n0 12631 df-xnn0 12704 df-z 12718 df-uz 12990 df-fz 13664 df-fzo 13813 df-hash 14499 df-word 14683 df-concat 14740 df-s1 14767 df-s2 15024 df-s3 15025 df-trkgc 28937 df-trkgb 28938 df-trkgcb 28939 df-trkg 28942 df-cgrg 29001 df-leg 29073 df-hlg 29091 |
| This theorem is used by: zerocgra 29358 |
| Copyright terms: Public domain | W3C validator |