| 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 28880 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| 14 | 1, 3, 9, 5, 5, 10, 4, 13 | hlid 28677 | . . 3 ⊢ (𝜑 → 𝐴((hlG‘𝐺)‘𝐵)𝐴) |
| 15 | 1, 3, 9, 4, 5, 10, 6, 7, 11, 8, 12 | cgrane2 28881 | . . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 16 | 15 | necomd 2988 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐵) |
| 17 | 1, 3, 9, 6, 5, 10, 4, 16 | hlid 28677 | . . 3 ⊢ (𝜑 → 𝐶((hlG‘𝐺)‘𝐵)𝐶) |
| 18 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
| 19 | 1, 2, 3, 4, 5, 10, 7, 11, 18 | tgcgrcomlr 28548 | . . 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 28886 | . 2 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
| 22 | 1, 2, 3, 4, 5, 6, 7, 8, 21 | tgcgrcomlr 28548 | 1 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6499 (class class class)co 7367 〈“cs3 14804 Basecbs 17179 distcds 17229 TarskiGcstrkg 28495 Itvcitv 28501 hlGchlg 28668 cgrAccgra 28875 |
| 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 5213 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-er 8643 df-map 8775 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-fz 13462 df-fzo 13609 df-hash 14293 df-word 14476 df-concat 14533 df-s1 14559 df-s2 14810 df-s3 14811 df-trkgc 28516 df-trkgb 28517 df-trkgcb 28518 df-trkg 28521 df-cgrg 28579 df-leg 28651 df-hlg 28669 df-cgra 28876 |
| This theorem is referenced by: tgsas 28923 tgsas2 28924 tgsas3 28925 |
| Copyright terms: Public domain | W3C validator |