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

Theorem tgcgrcomr 28949
Description: Congruence commutes on the RHS. Variant of Theorem 2.5 of [Schwabhauser] p. 27, but in a convenient form for a common case. (Contributed by David A. Wheeler, 29-Jun-2020.)
Hypotheses
Ref Expression
tkgeom.p 𝑃 = (Base‘𝐺)
tkgeom.d − = (dist‘𝐺)
tkgeom.i 𝐼 = (Itv‘𝐺)
tkgeom.g (𝜑 → 𝐺 ∈ TarskiG)
tgcgrcomr.a (𝜑 → 𝐴 ∈ 𝑃)
tgcgrcomr.b (𝜑 → 𝐵 ∈ 𝑃)
tgcgrcomr.c (𝜑 → 𝐶 ∈ 𝑃)
tgcgrcomr.d (𝜑 → 𝐷 ∈ 𝑃)
tgcgrcomr.6 (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐷))
Assertion
Ref Expression
tgcgrcomr (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐶))

Proof of Theorem tgcgrcomr
StepHypRef Expression
1 tgcgrcomr.6 . 2 (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐷))
2 tkgeom.p . . 3 𝑃 = (Base‘𝐺)
3 tkgeom.d . . 3 − = (dist‘𝐺)
4 tkgeom.i . . 3 𝐼 = (Itv‘𝐺)
5 tkgeom.g . . 3 (𝜑 → 𝐺 ∈ TarskiG)
6 tgcgrcomr.c . . 3 (𝜑 → 𝐶 ∈ 𝑃)
7 tgcgrcomr.d . . 3 (𝜑 → 𝐷 ∈ 𝑃)
82, 3, 4, 5, 6, 7axtgcgrrflx 28933 . 2 (𝜑 → (𝐶 − 𝐷) = (𝐷 − 𝐶))
91, 8eqtrd 2795 1 (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  distcds 17446  TarskiGcstrkg 28898  Itvcitv 28904
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6497  df-fv 6551  df-ov 7427  df-trkgc 28919  df-trkg 28924
This theorem is used by:  tgbtwnconn1lem1  29044  dfcgra2  29347
  Copyright terms: Public domain W3C validator