Theorem tgjustc1 26836

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 6788	. . . 4 ⊢ 𝑃 ∈ V
3	2, 2	xpex 7603	. . 3 ⊢ (𝑃 × 𝑃) ∈ V
4		tgjustf 26834	. . 3 ⊢ ((𝑃 × 𝑃) ∈ V → ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣))))
5	3, 4	ax-mp 5	. 2 ⊢ ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)))
6		simplrl 774	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑤 ∈ 𝑃)
7		simplrr 775	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑥 ∈ 𝑃)
8	6, 7	opelxpd 5627	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ⟨𝑤, 𝑥⟩ ∈ (𝑃 × 𝑃))
9		simprl 768	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑦 ∈ 𝑃)
10		simprr 770	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑧 ∈ 𝑃)
11	9, 10	opelxpd 5627	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ⟨𝑦, 𝑧⟩ ∈ (𝑃 × 𝑃))
12		simpll 764	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)))
13		breq1 5077	. . . . . . . 8 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (𝑢𝑟𝑣 ↔ ⟨𝑤, 𝑥⟩𝑟𝑣))
14		fveq2 6774	. . . . . . . . . 10 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ( − ‘𝑢) = ( − ‘⟨𝑤, 𝑥⟩))
15		df-ov 7278	. . . . . . . . . 10 ⊢ (𝑤 − 𝑥) = ( − ‘⟨𝑤, 𝑥⟩)
16	14, 15	eqtr4di 2796	. . . . . . . . 9 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ( − ‘𝑢) = (𝑤 − 𝑥))
17	16	eqeq1d 2740	. . . . . . . 8 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (( − ‘𝑢) = ( − ‘𝑣) ↔ (𝑤 − 𝑥) = ( − ‘𝑣)))
18	13, 17	bibi12d 346	. . . . . . 7 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ((𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ↔ (⟨𝑤, 𝑥⟩𝑟𝑣 ↔ (𝑤 − 𝑥) = ( − ‘𝑣))))
19		breq2 5078	. . . . . . . 8 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → (⟨𝑤, 𝑥⟩𝑟𝑣 ↔ ⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩))
20		fveq2 6774	. . . . . . . . . 10 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ( − ‘𝑣) = ( − ‘⟨𝑦, 𝑧⟩))
21		df-ov 7278	. . . . . . . . . 10 ⊢ (𝑦 − 𝑧) = ( − ‘⟨𝑦, 𝑧⟩)
22	20, 21	eqtr4di 2796	. . . . . . . . 9 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ( − ‘𝑣) = (𝑦 − 𝑧))
23	22	eqeq2d 2749	. . . . . . . 8 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ((𝑤 − 𝑥) = ( − ‘𝑣) ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
24	19, 23	bibi12d 346	. . . . . . 7 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ((⟨𝑤, 𝑥⟩𝑟𝑣 ↔ (𝑤 − 𝑥) = ( − ‘𝑣)) ↔ (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧))))
25	18, 24	rspc2va 3571	. . . . . 6 ⊢ (((⟨𝑤, 𝑥⟩ ∈ (𝑃 × 𝑃) ∧ ⟨𝑦, 𝑧⟩ ∈ (𝑃 × 𝑃)) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣))) → (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
26	8, 11, 12, 25	syl21anc 835	. . . . 5 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
27	26	ralrimivva 3123	. . . 4 ⊢ ((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) → ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
28	27	ralrimivva 3123	. . 3 ⊢ (∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣)) → ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))
29	28	anim2i 617	. 2 ⊢ ((𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑟𝑣 ↔ ( − ‘𝑢) = ( − ‘𝑣))) → (𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧))))
30	5, 29	eximii 1839	1 ⊢ ∃𝑟(𝑟 Er (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑟⟨𝑦, 𝑧⟩ ↔ (𝑤 − 𝑥) = (𝑦 − 𝑧)))

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106  ∀wral 3064  Vcvv 3432  ⟨cop 4567   class class class wbr 5074   × cxp 5587  ‘cfv 6433  (class class class)co 7275   Er wer 8495  Basecbs 16912  distcds 16971

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fv 6441  df-ov 7278  df-er 8498

This theorem is referenced by: (None)