| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > motcgr | Structured version Visualization version GIF version | ||
| Description: Property of a motion: distances are preserved. (Contributed by Thierry Arnoux, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| ismot.p | ⊢ 𝑃 = (Base‘𝐺) |
| ismot.m | ⊢ − = (dist‘𝐺) |
| motgrp.1 | ⊢ (𝜑 → 𝐺 ∈ 𝑉) |
| motcgr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| motcgr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| motcgr.f | ⊢ (𝜑 → 𝐹 ∈ (𝐺Ismt𝐺)) |
| Ref | Expression |
|---|---|
| motcgr | ⊢ (𝜑 → ((𝐹‘𝐴) − (𝐹‘𝐵)) = (𝐴 − 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | motcgr.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 2 | motcgr.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 3 | motcgr.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝐺Ismt𝐺)) | |
| 4 | motgrp.1 | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
| 5 | ismot.p | . . . . . 6 ⊢ 𝑃 = (Base‘𝐺) | |
| 6 | ismot.m | . . . . . 6 ⊢ − = (dist‘𝐺) | |
| 7 | 5, 6 | ismot 29055 | . . . . 5 ⊢ (𝐺 ∈ 𝑉 → (𝐹 ∈ (𝐺Ismt𝐺) ↔ (𝐹:𝑃⟶1-1onto𝑃 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) − (𝐹‘𝑏)) = (𝑎 − 𝑏)))) |
| 8 | 4, 7 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ (𝐺Ismt𝐺) ↔ (𝐹:𝑃⟶1-1onto𝑃 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) − (𝐹‘𝑏)) = (𝑎 − 𝑏)))) |
| 9 | 3, 8 | mpbid 235 | . . 3 ⊢ (𝜑 → (𝐹:𝑃⟶1-1onto𝑃 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) − (𝐹‘𝑏)) = (𝑎 − 𝑏))) |
| 10 | 9 | simprd 501 | . 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) − (𝐹‘𝑏)) = (𝑎 − 𝑏)) |
| 11 | fveq2 6916 | . . . . 5 ⊢ (𝑎 = 𝐴 → (𝐹‘𝑎) = (𝐹‘𝐴)) | |
| 12 | 11 | oveq1d 7466 | . . . 4 ⊢ (𝑎 = 𝐴 → ((𝐹‘𝑎) − (𝐹‘𝑏)) = ((𝐹‘𝐴) − (𝐹‘𝑏))) |
| 13 | oveq1 7458 | . . . 4 ⊢ (𝑎 = 𝐴 → (𝑎 − 𝑏) = (𝐴 − 𝑏)) | |
| 14 | 12, 13 | eqeq12d 2779 | . . 3 ⊢ (𝑎 = 𝐴 → (((𝐹‘𝑎) − (𝐹‘𝑏)) = (𝑎 − 𝑏) ↔ ((𝐹‘𝐴) − (𝐹‘𝑏)) = (𝐴 − 𝑏))) |
| 15 | fveq2 6916 | . . . . 5 ⊢ (𝑏 = 𝐵 → (𝐹‘𝑏) = (𝐹‘𝐵)) | |
| 16 | 15 | oveq2d 7467 | . . . 4 ⊢ (𝑏 = 𝐵 → ((𝐹‘𝐴) − (𝐹‘𝑏)) = ((𝐹‘𝐴) − (𝐹‘𝐵))) |
| 17 | oveq2 7459 | . . . 4 ⊢ (𝑏 = 𝐵 → (𝐴 − 𝑏) = (𝐴 − 𝐵)) | |
| 18 | 16, 17 | eqeq12d 2779 | . . 3 ⊢ (𝑏 = 𝐵 → (((𝐹‘𝐴) − (𝐹‘𝑏)) = (𝐴 − 𝑏) ↔ ((𝐹‘𝐴) − (𝐹‘𝐵)) = (𝐴 − 𝐵))) |
| 19 | 14, 18 | rspc2va 3591 | . 2 ⊢ (((𝐴 ∈ 𝑃 ∧ 𝐵 ∈ 𝑃) ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 ((𝐹‘𝑎) − (𝐹‘𝑏)) = (𝑎 − 𝑏)) → ((𝐹‘𝐴) − (𝐹‘𝐵)) = (𝐴 − 𝐵)) |
| 20 | 1, 2, 10, 19 | syl21anc 851 | 1 ⊢ (𝜑 → ((𝐹‘𝐴) − (𝐹‘𝐵)) = (𝐴 − 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⟶1-1ontowf1o 6565 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 distcds 17481 Ismtcismt 29052 |
| 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 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 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-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-map 8887 df-ismt 29053 |
| This theorem is used by: motco 29060 cnvmot 29061 motcgrg 29064 motcgr3 29065 |
| Copyright terms: Public domain | W3C validator |