| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ablnnncan1 | GIF version | ||
| Description: Cancellation law for group subtraction. (nnncan1 8562 analog.) (Contributed by NM, 7-Apr-2015.) |
| Ref | Expression |
|---|---|
| ablnncan.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablnncan.m | ⊢ − = (-g‘𝐺) |
| ablnncan.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
| ablnncan.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ablnncan.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| ablsub32.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ablnnncan1 | ⊢ (𝜑 → ((𝑋 − 𝑌) − (𝑋 − 𝑍)) = (𝑍 − 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablnncan.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | ablnncan.m | . . 3 ⊢ − = (-g‘𝐺) | |
| 3 | ablnncan.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
| 4 | ablnncan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 5 | ablnncan.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 6 | ablgrp 14092 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 7 | 3, 6 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 8 | ablsub32.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 9 | 1, 2 | grpsubcl 13885 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 − 𝑍) ∈ 𝐵) |
| 10 | 7, 4, 8, 9 | syl3anc 1278 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑍) ∈ 𝐵) |
| 11 | 1, 2, 3, 4, 5, 10 | ablsub32 14126 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑌) − (𝑋 − 𝑍)) = ((𝑋 − (𝑋 − 𝑍)) − 𝑌)) |
| 12 | 1, 2, 3, 4, 8 | ablnncan 14125 | . . 3 ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑍)) = 𝑍) |
| 13 | 12 | oveq1d 6100 | . 2 ⊢ (𝜑 → ((𝑋 − (𝑋 − 𝑍)) − 𝑌) = (𝑍 − 𝑌)) |
| 14 | 11, 13 | eqtrd 2271 | 1 ⊢ (𝜑 → ((𝑋 − 𝑌) − (𝑋 − 𝑍)) = (𝑍 − 𝑌)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ‘cfv 5377 (class class class)co 6085 Basecbs 13352 Grpcgrp 13805 -gcsg 13807 Abelcabl 14088 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-inn 9305 df-2 9363 df-ndx 13355 df-slot 13356 df-base 13358 df-plusg 13444 df-0g 13612 df-mgm 13676 df-sgrp 13717 df-mnd 13730 df-grp 13808 df-minusg 13809 df-sbg 13810 df-cmn 14089 df-abl 14090 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |