Theorem istrkgc 28734

Description: Property of being a Tarski geometry - congruence part. (Contributed by Thierry Arnoux, 14-Mar-2019.)

Hypotheses

Ref	Expression
istrkg.p	⊢ 𝑃 = (Base‘𝐺)
istrkg.d	⊢ − = (dist‘𝐺)
istrkg.i	⊢ 𝐼 = (Itv‘𝐺)

Assertion

Ref	Expression
istrkgc	⊢ (𝐺 ∈ TarskiGC ↔ (𝐺 ∈ V ∧ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐼   𝑥,𝑃,𝑦,𝑧   𝑥, − ,𝑦,𝑧

Allowed substitution hints:   𝐺(𝑥, 𝑦, 𝑧)

Proof of Theorem istrkgc

Dummy variables 𝑓 𝑑 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		istrkg.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		istrkg.d	. . 3 ⊢ − = (dist‘𝐺)
3		simpl 487	. . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → 𝑝 = 𝑃)
4		simpr 489	. . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → 𝑑 = − )
5	4	oveqd 7429	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (𝑥𝑑𝑦) = (𝑥 − 𝑦))
6	4	oveqd 7429	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (𝑦𝑑𝑥) = (𝑦 − 𝑥))
7	5, 6	eqeq12d 2778	. . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → ((𝑥𝑑𝑦) = (𝑦𝑑𝑥) ↔ (𝑥 − 𝑦) = (𝑦 − 𝑥)))
8	3, 7	raleqbidv 3337	. . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ↔ ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥)))
9	3, 8	raleqbidv 3337	. . . 4 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ↔ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥)))
10	4	oveqd 7429	. . . . . . . . 9 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (𝑧𝑑𝑧) = (𝑧 − 𝑧))
11	5, 10	eqeq12d 2778	. . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) ↔ (𝑥 − 𝑦) = (𝑧 − 𝑧)))
12	11	imbi1d 344	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
13	3, 12	raleqbidv 3337	. . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
14	3, 13	raleqbidv 3337	. . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
15	3, 14	raleqbidv 3337	. . . 4 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
16	9, 15	anbi12d 643	. . 3 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → ((∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ∧ ∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))
17	1, 2, 16	sbcie2s 17227	. 2 ⊢ (𝑓 = 𝐺 → ([(Base‘𝑓) / 𝑝][(dist‘𝑓) / 𝑑](∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ∧ ∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))
18		df-trkgc 28728	. 2 ⊢ TarskiGC = {𝑓 ∣ [(Base‘𝑓) / 𝑝][(dist‘𝑓) / 𝑑](∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ∧ ∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦))}
19	17, 18	elab4g 3641	1 ⊢ (𝐺 ∈ TarskiGC ↔ (𝐺 ∈ V ∧ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∀wral 3078  Vcvv 3454  [wsbc 3743  ‘cfv 6536  (class class class)co 7412  Basecbs 17275  distcds 17325  TarskiG_Ccstrkgc 28708  Itvcitv 28713

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-nul 5268

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-iota 6492  df-fv 6544  df-ov 7415  df-trkgc 28728

This theorem is used by:  axtgcgrrflx  28742  axtgcgrid  28743  f1otrg  29231  xmstrkgc  29246  eengtrkg  29347