Theorem tgjustc2 28502

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
tgjustc2.p	⊢ 𝑃 = (Base‘𝐺)
tgjustc2.d	⊢ 𝑅 Er (𝑃 × 𝑃)

Assertion

Ref	Expression
tgjustc2	⊢ ∃𝑑(𝑑 Fn (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))

Distinct variable groups:   𝑃,𝑑,𝑤,𝑥,𝑦,𝑧   𝑅,𝑑,𝑤,𝑥,𝑦,𝑧

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

Proof of Theorem tgjustc2

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

Step	Hyp	Ref	Expression
1		tgjustc2.p	. . . . 5 ⊢ 𝑃 = (Base‘𝐺)
2	1	fvexi 6934	. . . 4 ⊢ 𝑃 ∈ V
3	2, 2	xpex 7788	. . 3 ⊢ (𝑃 × 𝑃) ∈ V
4		tgjustc2.d	. . 3 ⊢ 𝑅 Er (𝑃 × 𝑃)
5		tgjustr 28500	. . 3 ⊢ (((𝑃 × 𝑃) ∈ V ∧ 𝑅 Er (𝑃 × 𝑃)) → ∃𝑑(𝑑 Fn (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣))))
6	3, 4, 5	mp2an 691	. 2 ⊢ ∃𝑑(𝑑 Fn (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)))
7		simplrl 776	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑤 ∈ 𝑃)
8		simplrr 777	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑥 ∈ 𝑃)
9	7, 8	opelxpd 5739	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ⟨𝑤, 𝑥⟩ ∈ (𝑃 × 𝑃))
10		simprl 770	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑦 ∈ 𝑃)
11		simprr 772	. . . . . . 7 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → 𝑧 ∈ 𝑃)
12	10, 11	opelxpd 5739	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ⟨𝑦, 𝑧⟩ ∈ (𝑃 × 𝑃))
13		simpll 766	. . . . . 6 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)))
14		breq1 5169	. . . . . . . 8 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (𝑢𝑅𝑣 ↔ ⟨𝑤, 𝑥⟩𝑅𝑣))
15		fveq2 6920	. . . . . . . . . 10 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (𝑑‘𝑢) = (𝑑‘⟨𝑤, 𝑥⟩))
16		df-ov 7451	. . . . . . . . . 10 ⊢ (𝑤𝑑𝑥) = (𝑑‘⟨𝑤, 𝑥⟩)
17	15, 16	eqtr4di 2798	. . . . . . . . 9 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → (𝑑‘𝑢) = (𝑤𝑑𝑥))
18	17	eqeq1d 2742	. . . . . . . 8 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ((𝑑‘𝑢) = (𝑑‘𝑣) ↔ (𝑤𝑑𝑥) = (𝑑‘𝑣)))
19	14, 18	bibi12d 345	. . . . . . 7 ⊢ (𝑢 = ⟨𝑤, 𝑥⟩ → ((𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ↔ (⟨𝑤, 𝑥⟩𝑅𝑣 ↔ (𝑤𝑑𝑥) = (𝑑‘𝑣))))
20		breq2 5170	. . . . . . . 8 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → (⟨𝑤, 𝑥⟩𝑅𝑣 ↔ ⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩))
21		fveq2 6920	. . . . . . . . . 10 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → (𝑑‘𝑣) = (𝑑‘⟨𝑦, 𝑧⟩))
22		df-ov 7451	. . . . . . . . . 10 ⊢ (𝑦𝑑𝑧) = (𝑑‘⟨𝑦, 𝑧⟩)
23	21, 22	eqtr4di 2798	. . . . . . . . 9 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → (𝑑‘𝑣) = (𝑦𝑑𝑧))
24	23	eqeq2d 2751	. . . . . . . 8 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ((𝑤𝑑𝑥) = (𝑑‘𝑣) ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))
25	20, 24	bibi12d 345	. . . . . . 7 ⊢ (𝑣 = ⟨𝑦, 𝑧⟩ → ((⟨𝑤, 𝑥⟩𝑅𝑣 ↔ (𝑤𝑑𝑥) = (𝑑‘𝑣)) ↔ (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧))))
26	19, 25	rspc2va 3647	. . . . . 6 ⊢ (((⟨𝑤, 𝑥⟩ ∈ (𝑃 × 𝑃) ∧ ⟨𝑦, 𝑧⟩ ∈ (𝑃 × 𝑃)) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣))) → (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))
27	9, 12, 13, 26	syl21anc 837	. . . . 5 ⊢ (((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) ∧ (𝑦 ∈ 𝑃 ∧ 𝑧 ∈ 𝑃)) → (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))
28	27	ralrimivva 3208	. . . 4 ⊢ ((∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) ∧ (𝑤 ∈ 𝑃 ∧ 𝑥 ∈ 𝑃)) → ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))
29	28	ralrimivva 3208	. . 3 ⊢ (∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣)) → ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))
30	29	anim2i 616	. 2 ⊢ ((𝑑 Fn (𝑃 × 𝑃) ∧ ∀𝑢 ∈ (𝑃 × 𝑃)∀𝑣 ∈ (𝑃 × 𝑃)(𝑢𝑅𝑣 ↔ (𝑑‘𝑢) = (𝑑‘𝑣))) → (𝑑 Fn (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧))))
31	6, 30	eximii 1835	1 ⊢ ∃𝑑(𝑑 Fn (𝑃 × 𝑃) ∧ ∀𝑤 ∈ 𝑃 ∀𝑥 ∈ 𝑃 ∀𝑦 ∈ 𝑃 ∀𝑧 ∈ 𝑃 (⟨𝑤, 𝑥⟩𝑅⟨𝑦, 𝑧⟩ ↔ (𝑤𝑑𝑥) = (𝑦𝑑𝑧)))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  ∀wral 3067  Vcvv 3488  ⟨cop 4654   class class class wbr 5166   × cxp 5698   Fn wfn 6568  ‘cfv 6573  (class class class)co 7448   Er wer 8760  Basecbs 17258

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-er 8763  df-ec 8765  df-qs 8769

This theorem is referenced by: (None)