dfcgrg2 - Metamath Proof Explorer

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

Theorem dfcgrg2 28931

Description: Congruence for two triangles can also be defined as congruence of sides and angles (6 parts). This is often the actual textbook definition of triangle congruence, see for example https://en.wikipedia.org/wiki/Congruence_(geometry)#Congruence_of_triangles. With this definition, the "SSS" congruence theorem has an additional part, namely, that triangle congruence implies congruence of the sides (which means equality of the lengths). Because our development of elementary geometry strives to closely follow Schwabhaeuser's, our original definition of shape congruence, df-cgrg 28579, already covers that part: see trgcgr 28584. This theorem is also named "CPCTC", which stands for "Corresponding Parts of Congruent Triangles are Congruent", see https://en.wikipedia.org/wiki/Congruence_(geometry)#CPCTC 28584. (Contributed by Thierry Arnoux, 18-Jan-2023.)

**Hypotheses**
Ref	Expression
dfcgrg2.p	⊢ 𝑃 = (Base‘𝐺)
dfcgrg2.m	⊢ − = (dist‘𝐺)
dfcgrg2.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
dfcgrg2.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
dfcgrg2.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
dfcgrg2.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
dfcgrg2.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
dfcgrg2.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
dfcgrg2.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
dfcgrg2.1	⊢ (𝜑 → 𝐴 ≠ 𝐵)
dfcgrg2.2	⊢ (𝜑 → 𝐵 ≠ 𝐶)
dfcgrg2.3	⊢ (𝜑 → 𝐶 ≠ 𝐴)

**Assertion**
Ref	Expression
dfcgrg2	⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ (((𝐴 − 𝐵) = (𝐷 − 𝐸) ∧ (𝐵 − 𝐶) = (𝐸 − 𝐹) ∧ (𝐶 − 𝐴) = (𝐹 − 𝐷)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))

**Proof of Theorem dfcgrg2**
Step	Hyp	Ref	Expression
1		dfcgrg2.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
2		dfcgrg2.m	. . . . . 6 ⊢ − = (dist‘𝐺)
3		eqid 2736	. . . . . 6 ⊢ (Itv‘𝐺) = (Itv‘𝐺)
4		dfcgrg2.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐺 ∈ TarskiG)
6		dfcgrg2.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
7	6	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐴 ∈ 𝑃)
8		dfcgrg2.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
9	8	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐵 ∈ 𝑃)
10		dfcgrg2.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
11	10	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐶 ∈ 𝑃)
12		dfcgrg2.d	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
13	12	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐷 ∈ 𝑃)
14		dfcgrg2.e	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
15	14	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐸 ∈ 𝑃)
16		dfcgrg2.f	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
17	16	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐹 ∈ 𝑃)
18		eqid 2736	. . . . . . . . 9 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺)
19	1, 2, 18, 4, 6, 8, 10, 12, 14, 16	trgcgrg 28583	. . . . . . . 8 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ((𝐴 − 𝐵) = (𝐷 − 𝐸) ∧ (𝐵 − 𝐶) = (𝐸 − 𝐹) ∧ (𝐶 − 𝐴) = (𝐹 − 𝐷))))
20	19	biimpa 476	. . . . . . 7 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ((𝐴 − 𝐵) = (𝐷 − 𝐸) ∧ (𝐵 − 𝐶) = (𝐸 − 𝐹) ∧ (𝐶 − 𝐴) = (𝐹 − 𝐷)))
21	20	simp1d 1143	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (𝐴 − 𝐵) = (𝐷 − 𝐸))
22	20	simp2d 1144	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (𝐵 − 𝐶) = (𝐸 − 𝐹))
23	20	simp3d 1145	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (𝐶 − 𝐴) = (𝐹 − 𝐷))
24		dfcgrg2.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≠ 𝐵)
25	24	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐴 ≠ 𝐵)
26		dfcgrg2.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≠ 𝐶)
27	26	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐵 ≠ 𝐶)
28		dfcgrg2.3	. . . . . . 7 ⊢ (𝜑 → 𝐶 ≠ 𝐴)
29	28	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐶 ≠ 𝐴)
30	1, 2, 3, 5, 7, 9, 11, 13, 15, 17, 21, 22, 23, 25, 27, 29	tgsss1 28928	. . . . 5 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
31	1, 2, 3, 5, 11, 7, 9, 17, 13, 15, 23, 21, 22, 29, 25, 27	tgsss1 28928	. . . . 5 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩)
32	1, 2, 3, 5, 9, 11, 7, 15, 17, 13, 22, 23, 21, 27, 29, 25	tgsss1 28928	. . . . 5 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩)
33	30, 31, 32	3jca 1129	. . . 4 ⊢ ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))
34	33	ex 412	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩)))
35	34	pm4.71d 561	. 2 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))
36	19	anbi1d 632	. 2 ⊢ (𝜑 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩)) ↔ (((𝐴 − 𝐵) = (𝐷 − 𝐸) ∧ (𝐵 − 𝐶) = (𝐸 − 𝐹) ∧ (𝐶 − 𝐴) = (𝐹 − 𝐷)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))
37	35, 36	bitrd 279	1 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ (((𝐴 − 𝐵) = (𝐷 − 𝐸) ∧ (𝐵 − 𝐶) = (𝐸 − 𝐹) ∧ (𝐶 − 𝐴) = (𝐹 − 𝐷)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 ⟨“cs3 14804 Basecbs 17179 distcds 17229 TarskiGcstrkg 28495 Itvcitv 28501 cgrGccgrg 28578 cgrAccgra 28875

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 df-fzo 13609 df-hash 14293 df-word 14476 df-concat 14533 df-s1 14559 df-s2 14810 df-s3 14811 df-trkgc 28516 df-trkgcb 28518 df-trkg 28521 df-cgrg 28579 df-hlg 28669 df-cgra 28876

This theorem is referenced by: (None)

W3C validator