| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgsas1 | Structured version Visualization version GIF version | ||
| Description: First congruence theorem: SAS (Side-Angle-Side): If two pairs of sides of two triangles are equal in length, and the included angles are equal in measurement, then third sides are equal in length. Theorem 11.49 of [Schwabhauser] p. 107. (Contributed by Thierry Arnoux, 1-Aug-2020.) |
| Ref | Expression |
|---|---|
| tgsas.p | ⊢ 𝑃 = (Base‘𝐺) |
| tgsas.m | ⊢ − = (dist‘𝐺) |
| tgsas.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tgsas.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tgsas.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| tgsas.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| tgsas.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| tgsas.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| tgsas.e | ⊢ (𝜑 → 𝐸 ∈ 𝑃) |
| tgsas.f | ⊢ (𝜑 → 𝐹 ∈ 𝑃) |
| tgsas.1 | ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) |
| tgsas.2 | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) |
| tgsas.3 | ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) |
| Ref | Expression |
|---|---|
| tgsas1 | ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tgsas.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | tgsas.m | . 2 ⊢ − = (dist‘𝐺) | |
| 3 | tgsas.i | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | tgsas.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | tgsas.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 6 | tgsas.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 7 | tgsas.d | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 8 | tgsas.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
| 9 | eqid 2737 | . . 3 ⊢ (hlG‘𝐺) = (hlG‘𝐺) | |
| 10 | tgsas.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 11 | tgsas.e | . . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 12 | tgsas.2 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) | |
| 13 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12 | cgrane1 28889 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| 14 | 1, 3, 9, 5, 5, 10, 4, 13 | hlid 28686 | . . 3 ⊢ (𝜑 → 𝐴((hlG‘𝐺)‘𝐵)𝐴) |
| 15 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12 | cgrane2 28890 | . . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 16 | 15 | necomd 2988 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 17 | 1, 3, 9, 6, 5, 10, 4, 16 | hlid 28686 | . . 3 ⊢ (𝜑 → 𝐶((hlG‘𝐺)‘𝐵)𝐶) |
| 18 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
| 19 | 1, 2, 3, 4, 5, 10, 7, 11, 18 | tgcgrcomlr 28557 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝐸 − 𝐷)) |
| 20 | tgsas.3 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) | |
| 21 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12, 5, 2, 6, 14, 17, 19, 20 | cgracgr 28895 | . 2 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
| 22 | 1, 2, 3, 4, 5, 6, 7, 8, 21 | tgcgrcomlr 28557 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 class class class wbr 5099 ‘cfv 6493 (class class class)co 7361 〈“cs3 14770 Basecbs 17141 distcds 17191 TarskiGcstrkg 28504 Itvcitv 28510 hlGchlg 28677 cgrAccgra 28884 |
| 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 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-oadd 8404 df-er 8638 df-map 8770 df-pm 8771 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-dju 9818 df-card 9856 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-nn 12151 df-2 12213 df-3 12214 df-n0 12407 df-xnn0 12480 df-z 12494 df-uz 12757 df-fz 13429 df-fzo 13576 df-hash 14259 df-word 14442 df-concat 14499 df-s1 14525 df-s2 14776 df-s3 14777 df-trkgc 28525 df-trkgb 28526 df-trkgcb 28527 df-trkg 28530 df-cgrg 28588 df-leg 28660 df-hlg 28678 df-cgra 28885 |
| This theorem is referenced by: tgsas 28932 tgsas2 28933 tgsas3 28934 |
| Copyright terms: Public domain | W3C validator |