| 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 2763 | . 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 2763 | . . 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 29457 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉(cgrG‘𝐺)〈“𝐷𝐸𝐹”〉) |
| 17 | 1, 11, 2, 12, 4, 7, 5, 6, 10, 8, 9, 16 | cgr3rotl 29047 | . 2 ⊢ (𝜑 → 〈“𝐵𝐶𝐴”〉(cgrG‘𝐺)〈“𝐸𝐹𝐷”〉) |
| 18 | 1, 2, 3, 4, 7, 5, 6, 10, 8, 9, 14 | cgrane4 29379 | . . 3 ⊢ (𝜑 → 𝐸 ≠ 𝐹) |
| 19 | 1, 2, 3, 8, 7, 9, 4, 18 | hlid 29132 | . 2 ⊢ (𝜑 → 𝐸((hlG‘𝐺)‘𝐹)𝐸) |
| 20 | 1, 11, 2, 4, 7, 5, 6, 10, 8, 9, 13, 14, 15 | tgsas1 29456 | . . . . 5 ⊢ (𝜑 → (𝐶 − 𝐴) = (𝐹 − 𝐷)) |
| 21 | 1, 11, 2, 4, 6, 7, 9, 10, 20 | tgcgrcomlr 28999 | . . . 4 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐷 − 𝐹)) |
| 22 | tgsas2.4 | . . . 4 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
| 23 | 1, 11, 2, 4, 7, 6, 10, 9, 21, 22 | tgcgrneq 29002 | . . 3 ⊢ (𝜑 → 𝐷 ≠ 𝐹) |
| 24 | 1, 2, 3, 10, 7, 9, 4, 23 | hlid 29132 | . 2 ⊢ (𝜑 → 𝐷((hlG‘𝐺)‘𝐹)𝐷) |
| 25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 8, 10, 17, 19, 24 | iscgrad 29375 | 1 ⊢ (𝜑 → 〈“𝐵𝐶𝐴”〉(cgrA‘𝐺)〈“𝐸𝐹𝐷”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 〈“cs3 15035 Basecbs 17431 distcds 17481 TarskiGcstrkg 28946 Itvcitv 28952 cgrGccgrg 29030 hlGchlg 29120 cgrAccgra 29371 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 df-s3 15042 df-trkgc 28967 df-trkgb 28968 df-trkgcb 28969 df-trkg 28972 df-cgrg 29031 df-leg 29103 df-hlg 29121 df-cgra 29372 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |