Theorem tgcgrcomimp 28996

Description: Congruence commutes on the RHS. Theorem 2.5 of [Schwabhauser] p. 27. (Contributed by David A. Wheeler, 29-Jun-2020.)

Hypotheses

Ref	Expression
tkgeom.p	⊢ 𝑃 = (Base‘𝐺)
tkgeom.d	⊢ − = (dist‘𝐺)
tkgeom.i	⊢ 𝐼 = (Itv‘𝐺)
tkgeom.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
tgcgrcomimp.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
tgcgrcomimp.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
tgcgrcomimp.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
tgcgrcomimp.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)

Assertion

Ref	Expression
tgcgrcomimp	⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐶 − 𝐷) → (𝐴 − 𝐵) = (𝐷 − 𝐶)))

Proof of Theorem tgcgrcomimp

Step	Hyp	Ref	Expression
1		tkgeom.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
2		tkgeom.d	. . . 4 ⊢ − = (dist‘𝐺)
3		tkgeom.i	. . . 4 ⊢ 𝐼 = (Itv‘𝐺)
4		tkgeom.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5		tgcgrcomimp.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
6		tgcgrcomimp.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
7	1, 2, 3, 4, 5, 6	axtgcgrrflx 28981	. . 3 ⊢ (𝜑 → (𝐶 − 𝐷) = (𝐷 − 𝐶))
8	7	eqeq2d 2774	. 2 ⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐶 − 𝐷) ↔ (𝐴 − 𝐵) = (𝐷 − 𝐶)))
9	8	biimpd 232	1 ⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐶 − 𝐷) → (𝐴 − 𝐵) = (𝐷 − 𝐶)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  distcds 17481  TarskiGcstrkg 28946  Itvcitv 28952

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-ext 2735  ax-nul 5266

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454  df-trkgc 28967  df-trkg 28972

This theorem is used by: (None)