| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablsubsub4 | Structured version Visualization version GIF version | ||
| Description: Law for double subtraction. (Contributed by NM, 7-Apr-2015.) |
| Ref | Expression |
|---|---|
| ablsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablsubadd.p | ⊢ + = (+g‘𝐺) |
| ablsubadd.m | ⊢ − = (-g‘𝐺) |
| ablsubsub.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
| ablsubsub.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ablsubsub.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| ablsubsub.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ablsubsub4 | ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = (𝑋 − (𝑌 + 𝑍))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablsubsub.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
| 2 | ablgrp 19878 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 4 | ablsubsub.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 5 | ablsubsub.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 6 | ablsubadd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 7 | ablsubadd.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 8 | 6, 7 | grpsubcl 19109 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) ∈ 𝐵) |
| 9 | 3, 4, 5, 8 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝐵) |
| 10 | ablsubsub.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 11 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 12 | eqid 2765 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 13 | 6, 11, 12, 7 | grpsubval 19075 | . . 3 ⊢ (((𝑋 − 𝑌) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 14 | 9, 10, 13 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 15 | 6, 12 | grpinvcl 19077 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((invg‘𝐺)‘𝑍) ∈ 𝐵) |
| 16 | 3, 10, 15 | syl2anc 596 | . . 3 ⊢ (𝜑 → ((invg‘𝐺)‘𝑍) ∈ 𝐵) |
| 17 | 6, 11, 7, 1, 4, 5, 16 | ablsubsub 19910 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌 − ((invg‘𝐺)‘𝑍))) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 18 | 6, 11, 7, 12, 3, 5, 10 | grpsubinv 19101 | . . 3 ⊢ (𝜑 → (𝑌 − ((invg‘𝐺)‘𝑍)) = (𝑌 + 𝑍)) |
| 19 | 18 | oveq2d 7432 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌 − ((invg‘𝐺)‘𝑍))) = (𝑋 − (𝑌 + 𝑍))) |
| 20 | 14, 17, 19 | 3eqtr2d 2806 | 1 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = (𝑋 − (𝑌 + 𝑍))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 ‘cfv 6540 (class class class)co 7416 Basecbs 17286 +gcplusg 17327 Grpcgrp 19023 invgcminusg 19024 -gcsg 19025 Abelcabl 19874 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-0g 17511 df-mgm 18715 df-sgrp 18798 df-mnd 18814 df-grp 19026 df-minusg 19027 df-sbg 19028 df-cmn 19875 df-abl 19876 |
| This theorem is used by: ablsub32 19914 ablnnncan 19915 rngqiprngfulem4 21483 ip2subdi 21823 cpmadugsumlemF 23062 baerlem5alem2 42518 |
| Copyright terms: Public domain | W3C validator |