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 2818 | . . 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 26525 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
14 | 1, 3, 9, 5, 5, 10, 4, 13 | hlid 26322 | . . 3 ⊢ (𝜑 → 𝐴((hlG‘𝐺)‘𝐵)𝐴) |
15 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12 | cgrane2 26526 | . . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
16 | 15 | necomd 3068 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
17 | 1, 3, 9, 6, 5, 10, 4, 16 | hlid 26322 | . . 3 ⊢ (𝜑 → 𝐶((hlG‘𝐺)‘𝐵)𝐶) |
18 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
19 | 1, 2, 3, 4, 5, 10, 7, 11, 18 | tgcgrcomlr 26193 | . . 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 26531 | . 2 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
22 | 1, 2, 3, 4, 5, 6, 7, 8, 21 | tgcgrcomlr 26193 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 ∈ wcel 2105 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 〈“cs3 14192 Basecbs 16471 distcds 16562 TarskiGcstrkg 26143 Itvcitv 26149 hlGchlg 26313 cgrAccgra 26520 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-map 8397 df-pm 8398 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-dju 9318 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 df-hash 13679 df-word 13850 df-concat 13911 df-s1 13938 df-s2 14198 df-s3 14199 df-trkgc 26161 df-trkgb 26162 df-trkgcb 26163 df-trkg 26166 df-cgrg 26224 df-leg 26296 df-hlg 26314 df-cgra 26521 |
This theorem is referenced by: tgsas 26568 tgsas2 26569 tgsas3 26570 |
Copyright terms: Public domain | W3C validator |