Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tgsas2 | Structured version Visualization version GIF version |
Description: First congruence theorem: SAS. 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 | ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) |
tgsas2.4 | ⊢ (𝜑 → 𝐴 ≠ 𝐶) |
Ref | Expression |
---|---|
tgsas2 | ⊢ (𝜑 → 〈“𝐶𝐴𝐵”〉(cgrA‘𝐺)〈“𝐹𝐷𝐸”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tgsas.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
2 | tgsas.i | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
3 | eqid 2736 | . 2 ⊢ (hlG‘𝐺) = (hlG‘𝐺) | |
4 | tgsas.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
5 | tgsas.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
6 | tgsas.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
7 | tgsas.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
8 | tgsas.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
9 | tgsas.d | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
10 | tgsas.e | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
11 | tgsas.m | . . 3 ⊢ − = (dist‘𝐺) | |
12 | eqid 2736 | . . 3 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺) | |
13 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
14 | tgsas.2 | . . . 4 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) | |
15 | tgsas.3 | . . . 4 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) | |
16 | 1, 11, 2, 4, 6, 7, 5, 9, 10, 8, 13, 14, 15 | tgsas 27506 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝐷𝐸𝐹”〉) |
17 | 1, 11, 2, 12, 4, 6, 7, 5, 9, 10, 8, 16 | cgr3rotr 27177 | . 2 ⊢ (𝜑 → 〈“𝐶𝐴𝐵”〉(cgrG‘𝐺)〈“𝐹𝐷𝐸”〉) |
18 | 1, 11, 2, 4, 6, 7, 5, 9, 10, 8, 13, 14, 15 | tgsas1 27505 | . . . 4 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
19 | tgsas2.4 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
20 | 19 | necomd 2996 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
21 | 1, 11, 2, 4, 5, 6, 8, 9, 18, 20 | tgcgrneq 27134 | . . 3 ⊢ (𝜑 → 𝐹 ≠ 𝐷) |
22 | 1, 2, 3, 8, 6, 9, 4, 21 | hlid 27260 | . 2 ⊢ (𝜑 → 𝐹((hlG‘𝐺)‘𝐷)𝐹) |
23 | 1, 2, 3, 4, 6, 7, 5, 9, 10, 8, 14 | cgrane3 27465 | . . 3 ⊢ (𝜑 → 𝐸 ≠ 𝐷) |
24 | 1, 2, 3, 10, 6, 9, 4, 23 | hlid 27260 | . 2 ⊢ (𝜑 → 𝐸((hlG‘𝐺)‘𝐷)𝐸) |
25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 8, 10, 17, 22, 24 | iscgrad 27462 | 1 ⊢ (𝜑 → 〈“𝐶𝐴𝐵”〉(cgrA‘𝐺)〈“𝐹𝐷𝐸”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2105 ≠ wne 2940 class class class wbr 5093 ‘cfv 6480 (class class class)co 7338 〈“cs3 14655 Basecbs 17010 distcds 17069 TarskiGcstrkg 27078 Itvcitv 27084 cgrGccgrg 27161 hlGchlg 27251 cgrAccgra 27458 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5230 ax-sep 5244 ax-nul 5251 ax-pow 5309 ax-pr 5373 ax-un 7651 ax-cnex 11029 ax-resscn 11030 ax-1cn 11031 ax-icn 11032 ax-addcl 11033 ax-addrcl 11034 ax-mulcl 11035 ax-mulrcl 11036 ax-mulcom 11037 ax-addass 11038 ax-mulass 11039 ax-distr 11040 ax-i2m1 11041 ax-1ne0 11042 ax-1rid 11043 ax-rnegex 11044 ax-rrecex 11045 ax-cnre 11046 ax-pre-lttri 11047 ax-pre-lttrn 11048 ax-pre-ltadd 11049 ax-pre-mulgt0 11050 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4271 df-if 4475 df-pw 4550 df-sn 4575 df-pr 4577 df-tp 4579 df-op 4581 df-uni 4854 df-int 4896 df-iun 4944 df-br 5094 df-opab 5156 df-mpt 5177 df-tr 5211 df-id 5519 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5576 df-we 5578 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6239 df-ord 6306 df-on 6307 df-lim 6308 df-suc 6309 df-iota 6432 df-fun 6482 df-fn 6483 df-f 6484 df-f1 6485 df-fo 6486 df-f1o 6487 df-fv 6488 df-riota 7294 df-ov 7341 df-oprab 7342 df-mpo 7343 df-om 7782 df-1st 7900 df-2nd 7901 df-frecs 8168 df-wrecs 8199 df-recs 8273 df-rdg 8312 df-1o 8368 df-oadd 8372 df-er 8570 df-map 8689 df-pm 8690 df-en 8806 df-dom 8807 df-sdom 8808 df-fin 8809 df-dju 9759 df-card 9797 df-pnf 11113 df-mnf 11114 df-xr 11115 df-ltxr 11116 df-le 11117 df-sub 11309 df-neg 11310 df-nn 12076 df-2 12138 df-3 12139 df-n0 12336 df-xnn0 12408 df-z 12422 df-uz 12685 df-fz 13342 df-fzo 13485 df-hash 14147 df-word 14319 df-concat 14375 df-s1 14401 df-s2 14661 df-s3 14662 df-trkgc 27099 df-trkgb 27100 df-trkgcb 27101 df-trkg 27104 df-cgrg 27162 df-leg 27234 df-hlg 27252 df-cgra 27459 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |