Theorem tgjustc1 28561

Description: A justification for using distance equality instead of the textbook relation on pairs of points for congruence. (Contributed by Thierry Arnoux, 29-Jan-2023.)

Hypotheses

Ref	Expression
tgjustc1.p	⊢ 𝑃 = (Base‘𝐺)
tgjustc1.d	⊢ − = (dist‘𝐺)

Assertion

Ref	Expression
tgjustc1	⊢ ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))

Distinct variable groups:   − ,𝑟,𝑤,𝑥,𝑦,𝑧   𝑃,𝑟,𝑤,𝑥,𝑦,𝑧

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

Proof of Theorem tgjustc1

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tgjustc1.p	. . . . 5 ⊢ 𝑃 = (Base‘𝐺)
2	1	fvexi 6841	. . . 4 ⊢ 𝑃 ∈ V
3	2, 2	xpex 7696	. . 3 ⊢ (𝑃 × 𝑃) ∈ V
4		tgjustf 28559	. . 3 ⊢ ((𝑃 × 𝑃) ∈ V → ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣))))
5	3, 4	ax-mp 5	. 2 ⊢ ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)))
6		simplrl 782	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑤 ∈ 𝑃)
7		simplrr 783	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑥 ∈ 𝑃)
8	6, 7	opelxpd 5657	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ⟨𝑤, 𝑥⟩ ∈ (𝑃 × 𝑃))
9		simprl 776	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑦 ∈ 𝑃)
10		simprr 778	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑧 ∈ 𝑃)
11	9, 10	opelxpd 5657	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ⟨𝑦, 𝑧⟩ ∈ (𝑃 × 𝑃))
12		simpll 772	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)))
13		breq1 5075	. . . . . . . 8 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (𝑢𝑟𝑣 ↔ ⟨𝑤, 𝑥⟩𝑟𝑣))
14		fveq2 6827	. . . . . . . . . 10 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ( − ‘𝑢) = ( − ‘⟨𝑤, 𝑥⟩))
15		df-ov 7359	. . . . . . . . . 10 ⊢ (𝑤 − 𝑥) = ( − ‘⟨𝑤, 𝑥⟩)
16	14, 15	eqtr4di 2792	. . . . . . . . 9 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ( − ‘𝑢) = (𝑤 − 𝑥))
17	16	eqeq1d 2741	. . . . . . . 8 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (( − ‘𝑢) = ( − ‘𝑣) ↔ (𝑤 − 𝑥) = ( − ‘𝑣)))
18	13, 17	bibi12d 346	. . . . . . 7 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ((𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ↔ (⟨𝑤, 𝑥⟩𝑟𝑣 ↔ (𝑤 − 𝑥) = ( − ‘𝑣))))
19		breq2 5076	. . . . . . . 8 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → (⟨𝑤, 𝑥⟩𝑟𝑣 ↔ ⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩))
20		fveq2 6827	. . . . . . . . . 10 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ( − ‘𝑣) = ( − ‘⟨𝑦, 𝑧⟩))
21		df-ov 7359	. . . . . . . . . 10 ⊢ (𝑦 − 𝑧) = ( − ‘⟨𝑦, 𝑧⟩)
22	20, 21	eqtr4di 2792	. . . . . . . . 9 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ( − ‘𝑣) = (𝑦 − 𝑧))
23	22	eqeq2d 2750	. . . . . . . 8 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ((𝑤 − 𝑥) = ( − ‘𝑣) ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
24	19, 23	bibi12d 346	. . . . . . 7 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ((⟨𝑤, 𝑥⟩𝑟𝑣 ↔ (𝑤 − 𝑥) = ( − ‘𝑣)) ↔ (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧))))
25	18, 24	rspc2va 3572	. . . . . 6 ⊢ (((⟨𝑤, 𝑥⟩ ∈ (𝑃 × 𝑃) ∧ ⟨𝑦, 𝑧⟩ ∈ (𝑃 × 𝑃)) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣))) → (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
26	8, 11, 12, 25	syl21anc 843	. . . . 5 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
27	26	ralrimivva 3182	. . . 4 ⊢ ((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) → ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
28	27	ralrimivva 3182	. . 3 ⊢ (∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) → ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
29	28	anim2i 623	. 2 ⊢ ((𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣))) → (𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧))))
30	5, 29	eximii 1844	1 ⊢ ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))

Syntax hints:   ↔ wb 207   ∧ wa 396   = wceq 1547  ∃wex 1786   ∈ wcel 2119  ∀wral 3053  Vcvv 3431  ⟨cop 4561   class class class wbr 5072   × cxp 5616  ‘cfv 6485  (class class class)co 7356   Er wer 8630  Basecbs 17170  distcds 17220

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fv 6493  df-ov 7359  df-er 8633

This theorem is referenced by: (None)