Theorem tgcgrcomimp 28799

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 28784	. . 3 ⊢ (𝜑 → (𝐶 − 𝐷) = (𝐷 − 𝐶))
8	7	eqeq2d 2776	. 2 ⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐶 − 𝐷) ↔ (𝐴 − 𝐵) = (𝐷 − 𝐶)))
9	8	biimpd 232	1 ⊢ (𝜑 → ((𝐴 − 𝐵) = (𝐶 − 𝐷) → (𝐴 − 𝐵) = (𝐷 − 𝐶)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  ‘cfv 6540  (class class class)co 7419  Basecbs 17293  distcds 17343  TarskiGcstrkg 28749  Itvcitv 28755

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 2148  ax-9 2156  ax-ext 2737  ax-nul 5271

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-trkgc 28770  df-trkg 28775

This theorem is used by: (None)