| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpnpncan0 | GIF version | ||
| Description: Cancellation law for group subtraction (npncan2 8312 analog). (Contributed by AV, 24-Nov-2019.) |
| Ref | Expression |
|---|---|
| grpsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubadd.p | ⊢ + = (+g‘𝐺) |
| grpsubadd.m | ⊢ − = (-g‘𝐺) |
| grpnpncan0.0 | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| grpnpncan0 | ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 − 𝑌) + (𝑌 − 𝑋)) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 ∈ Grp) | |
| 2 | simprl 529 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 3 | simprr 531 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 4 | grpsubadd.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | grpsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 6 | grpsubadd.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 7 | 4, 5, 6 | grpnpncan 13477 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑋 − 𝑌) + (𝑌 − 𝑋)) = (𝑋 − 𝑋)) |
| 8 | 1, 2, 3, 2, 7 | syl13anc 1252 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 − 𝑌) + (𝑌 − 𝑋)) = (𝑋 − 𝑋)) |
| 9 | grpnpncan0.0 | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 10 | 4, 9, 6 | grpsubid 13466 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
| 11 | 10 | adantrr 479 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 − 𝑋) = 0 ) |
| 12 | 8, 11 | eqtrd 2239 | 1 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 − 𝑌) + (𝑌 − 𝑋)) = 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2177 ‘cfv 5277 (class class class)co 5954 Basecbs 12882 +gcplusg 12959 0gc0g 13138 Grpcgrp 13382 -gcsg 13384 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4164 ax-sep 4167 ax-pow 4223 ax-pr 4258 ax-un 4485 ax-setind 4590 ax-cnex 8029 ax-resscn 8030 ax-1re 8032 ax-addrcl 8035 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3001 df-csb 3096 df-dif 3170 df-un 3172 df-in 3174 df-ss 3181 df-pw 3620 df-sn 3641 df-pr 3642 df-op 3644 df-uni 3854 df-int 3889 df-iun 3932 df-br 4049 df-opab 4111 df-mpt 4112 df-id 4345 df-xp 4686 df-rel 4687 df-cnv 4688 df-co 4689 df-dm 4690 df-rn 4691 df-res 4692 df-ima 4693 df-iota 5238 df-fun 5279 df-fn 5280 df-f 5281 df-f1 5282 df-fo 5283 df-f1o 5284 df-fv 5285 df-riota 5909 df-ov 5957 df-oprab 5958 df-mpo 5959 df-1st 6236 df-2nd 6237 df-inn 9050 df-2 9108 df-ndx 12885 df-slot 12886 df-base 12888 df-plusg 12972 df-0g 13140 df-mgm 13238 df-sgrp 13284 df-mnd 13299 df-grp 13385 df-minusg 13386 df-sbg 13387 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |