| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ablsubsub4 | 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 13812 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 4 | ablsubsub.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 5 | ablsubsub.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 6 | ablsubadd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 7 | ablsubadd.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 8 | 6, 7 | grpsubcl 13599 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) ∈ 𝐵) |
| 9 | 3, 4, 5, 8 | syl3anc 1271 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝐵) |
| 10 | ablsubsub.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 11 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 12 | eqid 2229 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 13 | 6, 11, 12, 7 | grpsubval 13565 | . . 3 ⊢ (((𝑋 − 𝑌) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 14 | 9, 10, 13 | syl2anc 411 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 15 | 6, 12 | grpinvcl 13567 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((invg‘𝐺)‘𝑍) ∈ 𝐵) |
| 16 | 3, 10, 15 | syl2anc 411 | . . 3 ⊢ (𝜑 → ((invg‘𝐺)‘𝑍) ∈ 𝐵) |
| 17 | 6, 11, 7, 1, 4, 5, 16 | ablsubsub 13841 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌 − ((invg‘𝐺)‘𝑍))) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 18 | 6, 11, 7, 12, 3, 5, 10 | grpsubinv 13592 | . . 3 ⊢ (𝜑 → (𝑌 − ((invg‘𝐺)‘𝑍)) = (𝑌 + 𝑍)) |
| 19 | 18 | oveq2d 6010 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌 − ((invg‘𝐺)‘𝑍))) = (𝑋 − (𝑌 + 𝑍))) |
| 20 | 14, 17, 19 | 3eqtr2d 2268 | 1 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = (𝑋 − (𝑌 + 𝑍))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ‘cfv 5314 (class class class)co 5994 Basecbs 13018 +gcplusg 13096 Grpcgrp 13519 invgcminusg 13520 -gcsg 13521 Abelcabl 13808 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4521 ax-setind 4626 ax-cnex 8078 ax-resscn 8079 ax-1re 8081 ax-addrcl 8084 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-rn 4727 df-res 4728 df-ima 4729 df-iota 5274 df-fun 5316 df-fn 5317 df-f 5318 df-f1 5319 df-fo 5320 df-f1o 5321 df-fv 5322 df-riota 5947 df-ov 5997 df-oprab 5998 df-mpo 5999 df-1st 6276 df-2nd 6277 df-inn 9099 df-2 9157 df-ndx 13021 df-slot 13022 df-base 13024 df-plusg 13109 df-0g 13277 df-mgm 13375 df-sgrp 13421 df-mnd 13436 df-grp 13522 df-minusg 13523 df-sbg 13524 df-cmn 13809 df-abl 13810 |
| This theorem is referenced by: ablsub32 13845 ablnnncan 13846 |
| Copyright terms: Public domain | W3C validator |