| 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 2752 | . . 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 28947 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| 14 | 1, 3, 9, 5, 5, 10, 4, 13 | hlid 28744 | . . 3 ⊢ (𝜑 → 𝐴((hlG‘𝐺)‘𝐵)𝐴) |
| 15 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12 | cgrane2 28948 | . . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 16 | 15 | necomd 3002 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 17 | 1, 3, 9, 6, 5, 10, 4, 16 | hlid 28744 | . . 3 ⊢ (𝜑 → 𝐶((hlG‘𝐺)‘𝐵)𝐶) |
| 18 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
| 19 | 1, 2, 3, 4, 5, 10, 7, 11, 18 | tgcgrcomlr 28615 | . . 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 28953 | . 2 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
| 22 | 1, 2, 3, 4, 5, 6, 7, 8, 21 | tgcgrcomlr 28615 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1550 ∈ wcel 2132 class class class wbr 5090 ‘cfv 6506 (class class class)co 7381 〈“cs3 14841 Basecbs 17217 distcds 17267 TarskiGcstrkg 28562 Itvcitv 28568 hlGchlg 28735 cgrAccgra 28942 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-tp 4577 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-oadd 8425 df-er 8662 df-map 8794 df-pm 8795 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-dju 9845 df-card 9883 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-nn 12197 df-2 12266 df-3 12267 df-n0 12468 df-xnn0 12541 df-z 12555 df-uz 12826 df-fz 13499 df-fzo 13646 df-hash 14330 df-word 14513 df-concat 14570 df-s1 14596 df-s2 14847 df-s3 14848 df-trkgc 28583 df-trkgb 28584 df-trkgcb 28585 df-trkg 28588 df-cgrg 28646 df-leg 28718 df-hlg 28736 df-cgra 28943 |
| This theorem is referenced by: tgsas 28990 tgsas2 28991 tgsas3 28992 |
| Copyright terms: Public domain | W3C validator |