iseqlg - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > iseqlg		Structured version Visualization version GIF version

Theorem iseqlg 28689

Description: Property of a triangle being equilateral. (Contributed by Thierry Arnoux, 5-Oct-2020.)

**Hypotheses**
Ref	Expression
iseqlg.p	⊢ 𝑃 = (Base‘𝐺)
iseqlg.m	⊢ − = (dist‘𝐺)
iseqlg.i	⊢ 𝐼 = (Itv‘𝐺)
iseqlg.l	⊢ 𝐿 = (LineG‘𝐺)
iseqlg.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
iseqlg.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
iseqlg.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
iseqlg.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)

**Assertion**
Ref	Expression
iseqlg	⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩ ∈ (eqltrG‘𝐺) ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐵𝐶𝐴”⟩))

Proof of Theorem iseqlg Dummy variables 𝑥 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iseqlg.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
2		elex 3490	. . . 4 ⊢ (𝐺 ∈ TarskiG → 𝐺 ∈ V)
3		fveq2 6900	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
4		iseqlg.p	. . . . . . . 8 ⊢ 𝑃 = (Base‘𝐺)
5	3, 4	eqtr4di 2785	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
6	5	oveq1d 7439	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((Base‘𝑔) ↑_m (0..^3)) = (𝑃 ↑_m (0..^3)))
7		fveq2 6900	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (cgrG‘𝑔) = (cgrG‘𝐺))
8	7	breqd 5161	. . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑥(cgrG‘𝑔)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩ ↔ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩))
9	6, 8	rabeqbidv 3446	. . . . 5 ⊢ (𝑔 = 𝐺 → {𝑥 ∈ ((Base‘𝑔) ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝑔)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩} = {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩})
10		df-eqlg 28688	. . . . 5 ⊢ eqltrG = (𝑔 ∈ V ↦ {𝑥 ∈ ((Base‘𝑔) ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝑔)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩})
11		ovex 7457	. . . . . 6 ⊢ (𝑃 ↑_m (0..^3)) ∈ V
12	11	rabex 5336	. . . . 5 ⊢ {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩} ∈ V
13	9, 10, 12	fvmpt 7008	. . . 4 ⊢ (𝐺 ∈ V → (eqltrG‘𝐺) = {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩})
14	1, 2, 13	3syl 18	. . 3 ⊢ (𝜑 → (eqltrG‘𝐺) = {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩})
15	14	eleq2d 2814	. 2 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩ ∈ (eqltrG‘𝐺) ↔ ⟨“𝐴𝐵𝐶”⟩ ∈ {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩}))
16		id 22	. . . . 5 ⊢ (𝑥 = ⟨“𝐴𝐵𝐶”⟩ → 𝑥 = ⟨“𝐴𝐵𝐶”⟩)
17		fveq1 6899	. . . . . 6 ⊢ (𝑥 = ⟨“𝐴𝐵𝐶”⟩ → (𝑥‘1) = (⟨“𝐴𝐵𝐶”⟩‘1))
18		fveq1 6899	. . . . . 6 ⊢ (𝑥 = ⟨“𝐴𝐵𝐶”⟩ → (𝑥‘2) = (⟨“𝐴𝐵𝐶”⟩‘2))
19		fveq1 6899	. . . . . 6 ⊢ (𝑥 = ⟨“𝐴𝐵𝐶”⟩ → (𝑥‘0) = (⟨“𝐴𝐵𝐶”⟩‘0))
20	17, 18, 19	s3eqd 14853	. . . . 5 ⊢ (𝑥 = ⟨“𝐴𝐵𝐶”⟩ → ⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩ = ⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩)
21	16, 20	breq12d 5163	. . . 4 ⊢ (𝑥 = ⟨“𝐴𝐵𝐶”⟩ → (𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩))
22	21	elrab 3682	. . 3 ⊢ (⟨“𝐴𝐵𝐶”⟩ ∈ {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩} ↔ (⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩))
23	22	a1i 11	. 2 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩ ∈ {𝑥 ∈ (𝑃 ↑_m (0..^3)) ∣ 𝑥(cgrG‘𝐺)⟨“(𝑥‘1)(𝑥‘2)(𝑥‘0)”⟩} ↔ (⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩)))
24		iseqlg.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
25		iseqlg.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
26		iseqlg.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
27	24, 25, 26	s3cld 14861	. . . . 5 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ ∈ Word 𝑃)
28		s3len 14883	. . . . 5 ⊢ (♯‘⟨“𝐴𝐵𝐶”⟩) = 3
29	4	fvexi 6914	. . . . . 6 ⊢ 𝑃 ∈ V
30		3nn0 12526	. . . . . 6 ⊢ 3 ∈ ℕ₀
31		wrdmap 14534	. . . . . 6 ⊢ ((𝑃 ∈ V ∧ 3 ∈ ℕ₀) → ((⟨“𝐴𝐵𝐶”⟩ ∈ Word 𝑃 ∧ (♯‘⟨“𝐴𝐵𝐶”⟩) = 3) ↔ ⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3))))
32	29, 30, 31	mp2an 690	. . . . 5 ⊢ ((⟨“𝐴𝐵𝐶”⟩ ∈ Word 𝑃 ∧ (♯‘⟨“𝐴𝐵𝐶”⟩) = 3) ↔ ⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3)))
33	27, 28, 32	sylanblc 587	. . . 4 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3)))
34	33	biantrurd 531	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩ ↔ (⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩)))
35		s3fv1 14881	. . . . . 6 ⊢ (𝐵 ∈ 𝑃 → (⟨“𝐴𝐵𝐶”⟩‘1) = 𝐵)
36	25, 35	syl 17	. . . . 5 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩‘1) = 𝐵)
37		s3fv2 14882	. . . . . 6 ⊢ (𝐶 ∈ 𝑃 → (⟨“𝐴𝐵𝐶”⟩‘2) = 𝐶)
38	26, 37	syl 17	. . . . 5 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩‘2) = 𝐶)
39		s3fv0 14880	. . . . . 6 ⊢ (𝐴 ∈ 𝑃 → (⟨“𝐴𝐵𝐶”⟩‘0) = 𝐴)
40	24, 39	syl 17	. . . . 5 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩‘0) = 𝐴)
41	36, 38, 40	s3eqd 14853	. . . 4 ⊢ (𝜑 → ⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩ = ⟨“𝐵𝐶𝐴”⟩)
42	41	breq2d 5162	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐵𝐶𝐴”⟩))
43	34, 42	bitr3d 280	. 2 ⊢ (𝜑 → ((⟨“𝐴𝐵𝐶”⟩ ∈ (𝑃 ↑_m (0..^3)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“(⟨“𝐴𝐵𝐶”⟩‘1)(⟨“𝐴𝐵𝐶”⟩‘2)(⟨“𝐴𝐵𝐶”⟩‘0)”⟩) ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐵𝐶𝐴”⟩))
44	15, 23, 43	3bitrd 304	1 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩ ∈ (eqltrG‘𝐺) ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐵𝐶𝐴”⟩))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 {crab 3428 Vcvv 3471 class class class wbr 5150 ‘cfv 6551 (class class class)co 7424 ↑_m cmap 8849 0cc0 11144 1c1 11145 2c2 12303 3c3 12304 ℕ₀cn0 12508 ..^cfzo 13665 ♯chash 14327 Word cword 14502 ⟨“cs3 14831 Basecbs 17185 distcds 17247 TarskiGcstrkg 28249 Itvcitv 28255 LineGclng 28256 cgrGccgrg 28332 eqltrGceqlg 28687

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2698 ax-rep 5287 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 ax-cnex 11200 ax-resscn 11201 ax-1cn 11202 ax-icn 11203 ax-addcl 11204 ax-addrcl 11205 ax-mulcl 11206 ax-mulrcl 11207 ax-mulcom 11208 ax-addass 11209 ax-mulass 11210 ax-distr 11211 ax-i2m1 11212 ax-1ne0 11213 ax-1rid 11214 ax-rnegex 11215 ax-rrecex 11216 ax-cnre 11217 ax-pre-lttri 11218 ax-pre-lttrn 11219 ax-pre-ltadd 11220 ax-pre-mulgt0 11221

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-int 4952 df-iun 5000 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-lim 6377 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7875 df-1st 7997 df-2nd 7998 df-frecs 8291 df-wrecs 8322 df-recs 8396 df-rdg 8435 df-1o 8491 df-er 8729 df-map 8851 df-en 8969 df-dom 8970 df-sdom 8971 df-fin 8972 df-card 9968 df-pnf 11286 df-mnf 11287 df-xr 11288 df-ltxr 11289 df-le 11290 df-sub 11482 df-neg 11483 df-nn 12249 df-2 12311 df-3 12312 df-n0 12509 df-z 12595 df-uz 12859 df-fz 13523 df-fzo 13666 df-hash 14328 df-word 14503 df-concat 14559 df-s1 14584 df-s2 14837 df-s3 14838 df-eqlg 28688

This theorem is referenced by: iseqlgd 28690

W3C validator