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

Theorem dfcgrg2 26661
 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 26309, already covers that part: see trgcgr 26314. 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 26314. (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
StepHypRef Expression
1 dfcgrg2.p . . . . . 6 𝑃 = (Base‘𝐺)
2 dfcgrg2.m . . . . . 6 = (dist‘𝐺)
3 eqid 2801 . . . . . 6 (Itv‘𝐺) = (Itv‘𝐺)
4 dfcgrg2.g . . . . . . 7 (𝜑𝐺 ∈ TarskiG)
54adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐺 ∈ TarskiG)
6 dfcgrg2.a . . . . . . 7 (𝜑𝐴𝑃)
76adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐴𝑃)
8 dfcgrg2.b . . . . . . 7 (𝜑𝐵𝑃)
98adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐵𝑃)
10 dfcgrg2.c . . . . . . 7 (𝜑𝐶𝑃)
1110adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐶𝑃)
12 dfcgrg2.d . . . . . . 7 (𝜑𝐷𝑃)
1312adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐷𝑃)
14 dfcgrg2.e . . . . . . 7 (𝜑𝐸𝑃)
1514adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐸𝑃)
16 dfcgrg2.f . . . . . . 7 (𝜑𝐹𝑃)
1716adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐹𝑃)
18 eqid 2801 . . . . . . . . 9 (cgrG‘𝐺) = (cgrG‘𝐺)
191, 2, 18, 4, 6, 8, 10, 12, 14, 16trgcgrg 26313 . . . . . . . 8 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ((𝐴 𝐵) = (𝐷 𝐸) ∧ (𝐵 𝐶) = (𝐸 𝐹) ∧ (𝐶 𝐴) = (𝐹 𝐷))))
2019biimpa 480 . . . . . . 7 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ((𝐴 𝐵) = (𝐷 𝐸) ∧ (𝐵 𝐶) = (𝐸 𝐹) ∧ (𝐶 𝐴) = (𝐹 𝐷)))
2120simp1d 1139 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (𝐴 𝐵) = (𝐷 𝐸))
2220simp2d 1140 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (𝐵 𝐶) = (𝐸 𝐹))
2320simp3d 1141 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (𝐶 𝐴) = (𝐹 𝐷))
24 dfcgrg2.1 . . . . . . 7 (𝜑𝐴𝐵)
2524adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐴𝐵)
26 dfcgrg2.2 . . . . . . 7 (𝜑𝐵𝐶)
2726adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐵𝐶)
28 dfcgrg2.3 . . . . . . 7 (𝜑𝐶𝐴)
2928adantr 484 . . . . . 6 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → 𝐶𝐴)
301, 2, 3, 5, 7, 9, 11, 13, 15, 17, 21, 22, 23, 25, 27, 29tgsss1 26658 . . . . 5 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
311, 2, 3, 5, 11, 7, 9, 17, 13, 15, 23, 21, 22, 29, 25, 27tgsss1 26658 . . . . 5 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩)
321, 2, 3, 5, 9, 11, 7, 15, 17, 13, 22, 23, 21, 27, 29, 25tgsss1 26658 . . . . 5 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩)
3330, 31, 323jca 1125 . . . 4 ((𝜑 ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩) → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))
3433ex 416 . . 3 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩)))
3534pm4.71d 565 . 2 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))
3619anbi1d 632 . 2 (𝜑 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩)) ↔ (((𝐴 𝐵) = (𝐷 𝐸) ∧ (𝐵 𝐶) = (𝐸 𝐹) ∧ (𝐶 𝐴) = (𝐹 𝐷)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))
3735, 36bitrd 282 1 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ (((𝐴 𝐵) = (𝐷 𝐸) ∧ (𝐵 𝐶) = (𝐸 𝐹) ∧ (𝐶 𝐴) = (𝐹 𝐷)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ∧ ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩ ∧ ⟨“𝐵𝐶𝐴”⟩(cgrA‘𝐺)⟨“𝐸𝐹𝐷”⟩))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2112   ≠ wne 2990   class class class wbr 5033  ‘cfv 6328  (class class class)co 7139  ⟨“cs3 14199  Basecbs 16479  distcds 16570  TarskiGcstrkg 26228  Itvcitv 26234  cgrGccgrg 26308  cgrAccgra 26605 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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445  ax-cnex 10586  ax-resscn 10587  ax-1cn 10588  ax-icn 10589  ax-addcl 10590  ax-addrcl 10591  ax-mulcl 10592  ax-mulrcl 10593  ax-mulcom 10594  ax-addass 10595  ax-mulass 10596  ax-distr 10597  ax-i2m1 10598  ax-1ne0 10599  ax-1rid 10600  ax-rnegex 10601  ax-rrecex 10602  ax-cnre 10603  ax-pre-lttri 10604  ax-pre-lttrn 10605  ax-pre-ltadd 10606  ax-pre-mulgt0 10607 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-nel 3095  df-ral 3114  df-rex 3115  df-reu 3116  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-tp 4533  df-op 4535  df-uni 4804  df-int 4842  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-tr 5140  df-id 5428  df-eprel 5433  df-po 5442  df-so 5443  df-fr 5482  df-we 5484  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-pred 6120  df-ord 6166  df-on 6167  df-lim 6168  df-suc 6169  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7097  df-ov 7142  df-oprab 7143  df-mpo 7144  df-om 7565  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-1o 8089  df-oadd 8093  df-er 8276  df-map 8395  df-pm 8396  df-en 8497  df-dom 8498  df-sdom 8499  df-fin 8500  df-card 9356  df-pnf 10670  df-mnf 10671  df-xr 10672  df-ltxr 10673  df-le 10674  df-sub 10865  df-neg 10866  df-nn 11630  df-2 11692  df-3 11693  df-n0 11890  df-z 11974  df-uz 12236  df-fz 12890  df-fzo 13033  df-hash 13691  df-word 13862  df-concat 13918  df-s1 13945  df-s2 14205  df-s3 14206  df-trkgc 26246  df-trkgcb 26248  df-trkg 26251  df-cgrg 26309  df-hlg 26399  df-cgra 26606 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator