Theorem istrkgc 28916

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 488	. . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → 𝑝 = 𝑃)
4		simpr 490	. . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → 𝑑 = − )
5	4	oveqd 7437	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (𝑥𝑑𝑦) = (𝑥 − 𝑦))
6	4	oveqd 7437	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (𝑦𝑑𝑥) = (𝑦 − 𝑥))
7	5, 6	eqeq12d 2776	. . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → ((𝑥𝑑𝑦) = (𝑦𝑑𝑥) ↔ (𝑥 − 𝑦) = (𝑦 − 𝑥)))
8	3, 7	raleqbidv 3334	. . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ↔ ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥)))
9	3, 8	raleqbidv 3334	. . . 4 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ↔ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥)))
10	4	oveqd 7437	. . . . . . . . 9 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (𝑧𝑑𝑧) = (𝑧 − 𝑧))
11	5, 10	eqeq12d 2776	. . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) ↔ (𝑥 − 𝑦) = (𝑧 − 𝑧)))
12	11	imbi1d 344	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
13	3, 12	raleqbidv 3334	. . . . . 6 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
14	3, 13	raleqbidv 3334	. . . . 5 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
15	3, 14	raleqbidv 3334	. . . 4 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → (∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦)))
16	9, 15	anbi12d 644	. . 3 ⊢ ((𝑝 = 𝑃 ∧ 𝑑 = − ) → ((∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ∧ ∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))
17	1, 2, 16	sbcie2s 17339	. 2 ⊢ (𝑓 = 𝐺 → ([(Base‘𝑓) / 𝑝][(dist‘𝑓) / 𝑑](∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ∧ ∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))
18		df-trkgc 28910	. 2 ⊢ TarskiGC = {𝑓 ∣ [(Base‘𝑓) / 𝑝][(dist‘𝑓) / 𝑑](∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 (𝑥𝑑𝑦) = (𝑦𝑑𝑥) ∧ ∀𝑥 ∈ 𝑝 ∀𝑦 ∈ 𝑝 ∀𝑧 ∈ 𝑝 ((𝑥𝑑𝑦) = (𝑧𝑑𝑧) → 𝑥 = 𝑦))}
19	17, 18	elab4g 3636	1 ⊢ (𝐺 ∈ TarskiGC ↔ (𝐺 ∈ V ∧ (∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 (𝑥 − 𝑦) = (𝑦 − 𝑥) ∧ ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 ((𝑥 − 𝑦) = (𝑧 − 𝑧) → 𝑥 = 𝑦))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450  [wsbc 3738  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  distcds 17437  TarskiG_Ccstrkgc 28890  Itvcitv 28895

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 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546  df-ov 7423  df-trkgc 28910

This theorem is used by:  axtgcgrrflx  28924  axtgcgrid  28925  f1otrg  29448  xmstrkgc  29463  eengtrkg  29564