| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpsubsub | Structured version Visualization version GIF version | ||
| Description: Double group subtraction. (Contributed by NM, 24-Feb-2008.) (Revised by Mario Carneiro, 2-Dec-2014.) |
| Ref | Expression |
|---|---|
| grpsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubadd.p | ⊢ + = (+g‘𝐺) |
| grpsubadd.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| grpsubsub | ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 − (𝑌 − 𝑍)) = (𝑋 + (𝑍 − 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr1 1213 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 2 | grpsubadd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpsubadd.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 4 | 2, 3 | grpsubcl 19130 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) ∈ 𝐵) |
| 5 | 4 | 3adant3r1 1201 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 − 𝑍) ∈ 𝐵) |
| 6 | grpsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 7 | eqid 2765 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 8 | 2, 6, 7, 3 | grpsubval 19096 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑌 − 𝑍) ∈ 𝐵) → (𝑋 − (𝑌 − 𝑍)) = (𝑋 + ((invg‘𝐺)‘(𝑌 − 𝑍)))) |
| 9 | 1, 5, 8 | syl2anc 596 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 − (𝑌 − 𝑍)) = (𝑋 + ((invg‘𝐺)‘(𝑌 − 𝑍)))) |
| 10 | 2, 3, 7 | grpinvsub 19132 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((invg‘𝐺)‘(𝑌 − 𝑍)) = (𝑍 − 𝑌)) |
| 11 | 10 | 3adant3r1 1201 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((invg‘𝐺)‘(𝑌 − 𝑍)) = (𝑍 − 𝑌)) |
| 12 | 11 | oveq2d 7435 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 + ((invg‘𝐺)‘(𝑌 − 𝑍))) = (𝑋 + (𝑍 − 𝑌))) |
| 13 | 9, 12 | eqtrd 2800 | 1 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 − (𝑌 − 𝑍)) = (𝑋 + (𝑍 − 𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ‘cfv 6540 (class class class)co 7419 Basecbs 17291 +gcplusg 17332 Grpcgrp 19044 invgcminusg 19045 -gcsg 19046 |
| 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 7742 |
| 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 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-1st 7992 df-2nd 7993 df-0g 17516 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-grp 19047 df-minusg 19048 df-sbg 19049 |
| This theorem is used by: ablsubsub 19931 |
| Copyright terms: Public domain | W3C validator |