| 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 2762 | . 2 ⊢ (Itv‘𝐺) = (Itv‘𝐺) | |
| 4 | eqid 2762 | . 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 28942 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| 10 | 1, 3, 7, 5, 6, 8 | hlgrcl1 28941 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| 11 | tghlsub.2 | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 12 | tghlsub.4 | . . 3 ⊢ (𝜑 → 𝐷(𝐾‘𝐸)𝐹) | |
| 13 | 1, 3, 7, 5, 11, 12 | hlgrcl2 28942 | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| 14 | 1, 3, 7, 5, 11, 12 | hlgrcl1 28941 | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| 15 | 1, 3, 7, 10, 9, 6, 5 | ishlg 28943 | . . . . 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 28943 | . . . . 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 28933 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 Basecbs 17303 distcds 17353 TarskiGcstrkg 28764 Itvcitv 28770 ≤Gcleg 28920 hlGchlg 28938 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-oadd 8462 df-er 8699 df-pm 8832 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9909 df-card 9947 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-3 12329 df-n0 12530 df-xnn0 12603 df-z 12617 df-uz 12889 df-fz 13562 df-fzo 13710 df-hash 14395 df-word 14579 df-concat 14636 df-s1 14663 df-s2 14919 df-s3 14920 df-trkgc 28785 df-trkgb 28786 df-trkgcb 28787 df-trkg 28790 df-cgrg 28849 df-leg 28921 df-hlg 28939 |
| This theorem is used by: zerocgra 29206 |
| Copyright terms: Public domain | W3C validator |