| 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 2763 | . . 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 29013 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| 14 | 1, 3, 9, 5, 5, 10, 4, 13 | hlid 28785 | . . 3 ⊢ (𝜑 → 𝐴((hlG‘𝐺)‘𝐵)𝐴) |
| 15 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12 | cgrane2 29014 | . . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 16 | 15 | necomd 3013 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 17 | 1, 3, 9, 6, 5, 10, 4, 16 | hlid 28785 | . . 3 ⊢ (𝜑 → 𝐶((hlG‘𝐺)‘𝐵)𝐶) |
| 18 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
| 19 | 1, 2, 3, 4, 5, 10, 7, 11, 18 | tgcgrcomlr 28656 | . . 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 29019 | . 2 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
| 22 | 1, 2, 3, 4, 5, 6, 7, 8, 21 | tgcgrcomlr 28656 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1561 ∈ wcel 2143 class class class wbr 5101 ‘cfv 6521 (class class class)co 7396 〈“cs3 14865 Basecbs 17255 distcds 17305 TarskiGcstrkg 28603 Itvcitv 28609 hlGchlg 28776 cgrAccgra 29008 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-oadd 8441 df-er 8678 df-map 8810 df-pm 8811 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-dju 9871 df-card 9909 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-nn 12221 df-2 12290 df-3 12291 df-n0 12492 df-xnn0 12565 df-z 12579 df-uz 12850 df-fz 13523 df-fzo 13670 df-hash 14354 df-word 14537 df-concat 14594 df-s1 14620 df-s2 14871 df-s3 14872 df-trkgc 28624 df-trkgb 28625 df-trkgcb 28626 df-trkg 28629 df-cgrg 28687 df-leg 28759 df-hlg 28777 df-cgra 29009 |
| This theorem is referenced by: tgsas 29056 tgsas2 29057 tgsas3 29058 |
| Copyright terms: Public domain | W3C validator |