| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ablsub32 | GIF version | ||
| Description: Swap the second and third terms in a double group subtraction. (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 |
|---|---|
| ablsub32 | ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑍) − 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablnncan.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
| 2 | ablnncan.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 3 | ablsub32.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 4 | ablnncan.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | eqid 2229 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | 4, 5 | ablcom 13877 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌(+g‘𝐺)𝑍) = (𝑍(+g‘𝐺)𝑌)) |
| 7 | 1, 2, 3, 6 | syl3anc 1271 | . . 3 ⊢ (𝜑 → (𝑌(+g‘𝐺)𝑍) = (𝑍(+g‘𝐺)𝑌)) |
| 8 | 7 | oveq2d 6027 | . 2 ⊢ (𝜑 → (𝑋 − (𝑌(+g‘𝐺)𝑍)) = (𝑋 − (𝑍(+g‘𝐺)𝑌))) |
| 9 | ablnncan.m | . . 3 ⊢ − = (-g‘𝐺) | |
| 10 | ablnncan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 11 | 4, 5, 9, 1, 10, 2, 3 | ablsubsub4 13893 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = (𝑋 − (𝑌(+g‘𝐺)𝑍))) |
| 12 | 4, 5, 9, 1, 10, 3, 2 | ablsubsub4 13893 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑍) − 𝑌) = (𝑋 − (𝑍(+g‘𝐺)𝑌))) |
| 13 | 8, 11, 12 | 3eqtr4d 2272 | 1 ⊢ (𝜑 → ((𝑋 − 𝑌) − 𝑍) = ((𝑋 − 𝑍) − 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ‘cfv 5322 (class class class)co 6011 Basecbs 13069 +gcplusg 13147 -gcsg 13572 Abelcabl 13859 |
| 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 4200 ax-sep 4203 ax-pow 4260 ax-pr 4295 ax-un 4526 ax-setind 4631 ax-cnex 8111 ax-resscn 8112 ax-1re 8114 ax-addrcl 8117 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3890 df-int 3925 df-iun 3968 df-br 4085 df-opab 4147 df-mpt 4148 df-id 4386 df-xp 4727 df-rel 4728 df-cnv 4729 df-co 4730 df-dm 4731 df-rn 4732 df-res 4733 df-ima 4734 df-iota 5282 df-fun 5324 df-fn 5325 df-f 5326 df-f1 5327 df-fo 5328 df-f1o 5329 df-fv 5330 df-riota 5964 df-ov 6014 df-oprab 6015 df-mpo 6016 df-1st 6296 df-2nd 6297 df-inn 9132 df-2 9190 df-ndx 13072 df-slot 13073 df-base 13075 df-plusg 13160 df-0g 13328 df-mgm 13426 df-sgrp 13472 df-mnd 13487 df-grp 13573 df-minusg 13574 df-sbg 13575 df-cmn 13860 df-abl 13861 |
| This theorem is referenced by: ablnnncan1 13898 |
| Copyright terms: Public domain | W3C validator |