| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgsas3 | 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 |
|---|---|
| tgsas3 | ⊢ (𝜑 → 〈“𝐵𝐶𝐴”〉(cgrA‘𝐺)〈“𝐸𝐹𝐷”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tgsas.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | tgsas.i | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
| 3 | eqid 2769 | . 2 ⊢ (hlG‘𝐺) = (hlG‘𝐺) | |
| 4 | tgsas.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | tgsas.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 6 | tgsas.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 7 | tgsas.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 8 | tgsas.e | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑃) | |
| 9 | tgsas.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑃) | |
| 10 | tgsas.d | . 2 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 11 | tgsas.m | . . 3 ⊢ − = (dist‘𝐺) | |
| 12 | eqid 2769 | . . 3 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺) | |
| 13 | tgsas.1 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸)) | |
| 14 | tgsas.2 | . . . 4 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrA‘𝐺)〈“𝐷𝐸𝐹”〉) | |
| 15 | tgsas.3 | . . . 4 ⊢ (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹)) | |
| 16 | 1, 11, 2, 4, 7, 5, 6, 10, 8, 9, 13, 14, 15 | tgsas 29123 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝐷𝐸𝐹”〉) |
| 17 | 1, 11, 2, 12, 4, 7, 5, 6, 10, 8, 9, 16 | cgr3rotl 28758 | . 2 ⊢ (𝜑 → 〈“𝐵𝐶𝐴”〉(cgrG‘𝐺)〈“𝐸𝐹𝐷”〉) |
| 18 | 1, 2, 3, 4, 7, 5, 6, 10, 8, 9, 14 | cgrane4 29079 | . . 3 ⊢ (𝜑 → 𝐸 ≠ 𝐹) |
| 19 | 1, 2, 3, 8, 7, 9, 4, 18 | hlid 28840 | . 2 ⊢ (𝜑 → 𝐸((hlG‘𝐺)‘𝐹)𝐸) |
| 20 | 1, 11, 2, 4, 7, 5, 6, 10, 8, 9, 13, 14, 15 | tgsas1 29122 | . . . . 5 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| 21 | 1, 11, 2, 4, 6, 7, 9, 10, 20 | tgcgrcomlr 28711 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
| 22 | tgsas2.4 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
| 23 | 1, 11, 2, 4, 7, 6, 10, 9, 21, 22 | tgcgrneq 28714 | . . 3 ⊢ (𝜑 → 𝐷 ≠ 𝐹) |
| 24 | 1, 2, 3, 10, 7, 9, 4, 23 | hlid 28840 | . 2 ⊢ (𝜑 → 𝐷((hlG‘𝐺)‘𝐹)𝐷) |
| 25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 8, 10, 17, 19, 24 | iscgrad 29075 | 1 ⊢ (𝜑 → 〈“𝐵𝐶𝐴”〉(cgrA‘𝐺)〈“𝐸𝐹𝐷”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 class class class wbr 5110 ‘cfv 6533 (class class class)co 7408 〈“cs3 14875 Basecbs 17265 distcds 17315 TarskiGcstrkg 28658 Itvcitv 28664 cgrGccgrg 28741 hlGchlg 28831 cgrAccgra 29071 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-dju 9883 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-2 12299 df-3 12300 df-n0 12501 df-xnn0 12574 df-z 12588 df-uz 12859 df-fz 13532 df-fzo 13679 df-hash 14363 df-word 14547 df-concat 14604 df-s1 14630 df-s2 14881 df-s3 14882 df-trkgc 28679 df-trkgb 28680 df-trkgcb 28681 df-trkg 28684 df-cgrg 28742 df-leg 28814 df-hlg 28832 df-cgra 29072 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |