| 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 14006 | . . . . 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 13793 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) ∈ 𝐵) |
| 9 | 3, 4, 5, 8 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝐵) |
| 10 | ablsubsub.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 11 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 12 | eqid 2232 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 13 | 6, 11, 12, 7 | grpsubval 13759 | . . 3 ⊢ (((𝑋 − 𝑌) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 14 | 9, 10, 13 | syl2anc 411 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 15 | 6, 12 | grpinvcl 13761 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((invg‘𝐺)‘𝑍) ∈ 𝐵) |
| 16 | 3, 10, 15 | syl2anc 411 | . . 3 ⊢ (𝜑 → ((invg‘𝐺)‘𝑍) ∈ 𝐵) |
| 17 | 6, 11, 7, 1, 4, 5, 16 | ablsubsub 14035 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌 − ((invg‘𝐺)‘𝑍))) = ((𝑋 − 𝑌) + ((invg‘𝐺)‘𝑍))) |
| 18 | 6, 11, 7, 12, 3, 5, 10 | grpsubinv 13786 | . . 3 ⊢ (𝜑 → (𝑌 − ((invg‘𝐺)‘𝑍)) = (𝑌 + 𝑍)) |
| 19 | 18 | oveq2d 6066 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌 − ((invg‘𝐺)‘𝑍))) = (𝑋 − (𝑌 + 𝑍))) |
| 20 | 14, 17, 19 | 3eqtr2d 2271 | 1 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = (𝑋 − (𝑌 + 𝑍))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 ‘cfv 5352 (class class class)co 6050 Basecbs 13212 +gcplusg 13290 Grpcgrp 13713 invgcminusg 13714 -gcsg 13715 Abelcabl 14002 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1re 8221 ax-addrcl 8224 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-inn 9238 df-2 9296 df-ndx 13215 df-slot 13216 df-base 13218 df-plusg 13303 df-0g 13471 df-mgm 13569 df-sgrp 13615 df-mnd 13630 df-grp 13716 df-minusg 13717 df-sbg 13718 df-cmn 14003 df-abl 14004 |
| This theorem is referenced by: ablsub32 14039 ablnnncan 14040 |
| Copyright terms: Public domain | W3C validator |