MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  motco Structured version   Visualization version   GIF version

Theorem motco 29060
Description: The composition of two motions is a motion. (Contributed by Thierry Arnoux, 15-Dec-2019.)
Hypotheses
Ref Expression
ismot.p 𝑃 = (Base‘𝐺)
ismot.m − = (dist‘𝐺)
motgrp.1 (𝜑 → 𝐺 ∈ 𝑉)
motco.2 (𝜑 → 𝐹 ∈ (𝐺Ismt𝐺))
motco.3 (𝜑 → 𝐻 ∈ (𝐺Ismt𝐺))
Assertion
Ref Expression
motco (𝜑 → (𝐹 ∘ 𝐻) ∈ (𝐺Ismt𝐺))

Proof of Theorem motco
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ismot.p . . . 4 𝑃 = (Base‘𝐺)
2 ismot.m . . . 4 − = (dist‘𝐺)
3 motgrp.1 . . . 4 (𝜑 → 𝐺 ∈ 𝑉)
4 motco.2 . . . 4 (𝜑 → 𝐹 ∈ (𝐺Ismt𝐺))
51, 2, 3, 4motf1o 29058 . . 3 (𝜑 → 𝐹:𝑃⟶1-1onto𝑃)
6 motco.3 . . . 4 (𝜑 → 𝐻 ∈ (𝐺Ismt𝐺))
71, 2, 3, 6motf1o 29058 . . 3 (𝜑 → 𝐻:𝑃⟶1-1onto𝑃)
8 f1oco 6878 . . 3 ((𝐹:𝑃⟶1-1onto𝑃 ∧ 𝐻:𝑃⟶1-1onto𝑃) → (𝐹 ∘ 𝐻):𝑃⟶1-1onto𝑃)
95, 7, 8syl2anc 596 . 2 (𝜑 → (𝐹 ∘ 𝐻):𝑃⟶1-1onto𝑃)
10 f1of 6854 . . . . . . . 8 (𝐻:𝑃⟶1-1onto𝑃 → 𝐻:𝑃⟶𝑃)
117, 10syl 18 . . . . . . 7 (𝜑 → 𝐻:𝑃⟶𝑃)
1211adantr 486 . . . . . 6 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → 𝐻:𝑃⟶𝑃)
13 simprl 783 . . . . . 6 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → 𝑎 ∈ 𝑃)
14 fvco3 7016 . . . . . 6 ((𝐻:𝑃⟶𝑃 ∧ 𝑎 ∈ 𝑃) → ((𝐹 ∘ 𝐻)‘𝑎) = (𝐹‘(𝐻‘𝑎)))
1512, 13, 14syl2anc 596 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → ((𝐹 ∘ 𝐻)‘𝑎) = (𝐹‘(𝐻‘𝑎)))
16 simprr 785 . . . . . 6 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → 𝑏 ∈ 𝑃)
17 fvco3 7016 . . . . . 6 ((𝐻:𝑃⟶𝑃 ∧ 𝑏 ∈ 𝑃) → ((𝐹 ∘ 𝐻)‘𝑏) = (𝐹‘(𝐻‘𝑏)))
1812, 16, 17syl2anc 596 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → ((𝐹 ∘ 𝐻)‘𝑏) = (𝐹‘(𝐻‘𝑏)))
1915, 18oveq12d 7469 . . . 4 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → (((𝐹 ∘ 𝐻)‘𝑎) − ((𝐹 ∘ 𝐻)‘𝑏)) = ((𝐹‘(𝐻‘𝑎)) − (𝐹‘(𝐻‘𝑏))))
203adantr 486 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → 𝐺 ∈ 𝑉)
2112, 13ffvelcdmd 7117 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → (𝐻‘𝑎) ∈ 𝑃)
2212, 16ffvelcdmd 7117 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → (𝐻‘𝑏) ∈ 𝑃)
234adantr 486 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → 𝐹 ∈ (𝐺Ismt𝐺))
241, 2, 20, 21, 22, 23motcgr 29056 . . . 4 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → ((𝐹‘(𝐻‘𝑎)) − (𝐹‘(𝐻‘𝑏))) = ((𝐻‘𝑎) − (𝐻‘𝑏)))
256adantr 486 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → 𝐻 ∈ (𝐺Ismt𝐺))
261, 2, 20, 13, 16, 25motcgr 29056 . . . 4 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → ((𝐻‘𝑎) − (𝐻‘𝑏)) = (𝑎 − 𝑏))
2719, 24, 263eqtrd 2802 . . 3 ((𝜑 ∧ (𝑎 ∈ 𝑃 ∧ 𝑏 ∈ 𝑃)) → (((𝐹 ∘ 𝐻)‘𝑎) − ((𝐹 ∘ 𝐻)‘𝑏)) = (𝑎 − 𝑏))
2827ralrimivva 3209 . 2 (𝜑 → ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 (((𝐹 ∘ 𝐻)‘𝑎) − ((𝐹 ∘ 𝐻)‘𝑏)) = (𝑎 − 𝑏))
291, 2ismot 29055 . . 3 (𝐺 ∈ 𝑉 → ((𝐹 ∘ 𝐻) ∈ (𝐺Ismt𝐺) ↔ ((𝐹 ∘ 𝐻):𝑃⟶1-1onto𝑃 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 (((𝐹 ∘ 𝐻)‘𝑎) − ((𝐹 ∘ 𝐻)‘𝑏)) = (𝑎 − 𝑏))))
303, 29syl 18 . 2 (𝜑 → ((𝐹 ∘ 𝐻) ∈ (𝐺Ismt𝐺) ↔ ((𝐹 ∘ 𝐻):𝑃⟶1-1onto𝑃 ∧ ∀𝑎 ∈ 𝑃 ∀𝑏 ∈ 𝑃 (((𝐹 ∘ 𝐻)‘𝑎) − ((𝐹 ∘ 𝐻)‘𝑏)) = (𝑎 − 𝑏))))
319, 28, 30mpbir2and 726 1 (𝜑 → (𝐹 ∘ 𝐻) ∈ (𝐺Ismt𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ∘ ccom 5662  ⟶wf 6562  ⟶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:  motgrp  29063
  Copyright terms: Public domain W3C validator