| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpsubval | GIF version | ||
| Description: Group subtraction (division) operation. (Contributed by NM, 31-Mar-2014.) (Revised by Mario Carneiro, 13-Dec-2014.) |
| Ref | Expression |
|---|---|
| grpsubval.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubval.p | ⊢ + = (+g‘𝐺) |
| grpsubval.i | ⊢ 𝐼 = (invg‘𝐺) |
| grpsubval.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| grpsubval | ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + (𝐼‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubval.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | 1 | a1i 9 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐵 = (Base‘𝐺)) |
| 3 | simpl 109 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 4 | 2, 3 | basmexd 13114 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ V) |
| 5 | grpsubval.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 6 | grpsubval.i | . . . 4 ⊢ 𝐼 = (invg‘𝐺) | |
| 7 | grpsubval.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 1, 5, 6, 7 | grpsubfvalg 13599 | . . 3 ⊢ (𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))) |
| 9 | 4, 8 | syl 14 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))) |
| 10 | oveq1 6017 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑦))) | |
| 11 | fveq2 5632 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝐼‘𝑦) = (𝐼‘𝑌)) | |
| 12 | 11 | oveq2d 6026 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑋 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 13 | 10, 12 | sylan9eq 2282 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 14 | 13 | adantl 277 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 15 | simpr 110 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 16 | plusgslid 13166 | . . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 17 | 16 | slotex 13080 | . . . . 5 ⊢ (𝐺 ∈ V → (+g‘𝐺) ∈ V) |
| 18 | 4, 17 | syl 14 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (+g‘𝐺) ∈ V) |
| 19 | 5, 18 | eqeltrid 2316 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → + ∈ V) |
| 20 | eqid 2229 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 21 | 1, 5, 20, 6 | grpinvfvalg 13596 | . . . . . 6 ⊢ (𝐺 ∈ V → 𝐼 = (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺)))) |
| 22 | 4, 21 | syl 14 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐼 = (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺)))) |
| 23 | basfn 13112 | . . . . . . . 8 ⊢ Base Fn V | |
| 24 | funfvex 5649 | . . . . . . . . 9 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V) | |
| 25 | 24 | funfni 5426 | . . . . . . . 8 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V) |
| 26 | 23, 4, 25 | sylancr 414 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (Base‘𝐺) ∈ V) |
| 27 | 1, 26 | eqeltrid 2316 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐵 ∈ V) |
| 28 | 27 | mptexd 5873 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺))) ∈ V) |
| 29 | 22, 28 | eqeltrd 2306 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐼 ∈ V) |
| 30 | fvexg 5651 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑌 ∈ 𝐵) → (𝐼‘𝑌) ∈ V) | |
| 31 | 29, 30 | sylancom 420 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐼‘𝑌) ∈ V) |
| 32 | ovexg 6044 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ + ∈ V ∧ (𝐼‘𝑌) ∈ V) → (𝑋 + (𝐼‘𝑌)) ∈ V) | |
| 33 | 3, 19, 31, 32 | syl3anc 1271 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (𝐼‘𝑌)) ∈ V) |
| 34 | 9, 14, 3, 15, 33 | ovmpod 6141 | 1 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + (𝐼‘𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 Vcvv 2799 ↦ cmpt 4145 Fn wfn 5316 ‘cfv 5321 ℩crio 5962 (class class class)co 6010 ∈ cmpo 6012 Basecbs 13053 +gcplusg 13131 0gc0g 13310 invgcminusg 13555 -gcsg 13556 |
| 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 4199 ax-sep 4202 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-cnex 8106 ax-resscn 8107 ax-1re 8109 ax-addrcl 8112 |
| 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-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 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4385 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-inn 9127 df-2 9185 df-ndx 13056 df-slot 13057 df-base 13059 df-plusg 13144 df-minusg 13558 df-sbg 13559 |
| This theorem is referenced by: grpsubinv 13627 grpsubrcan 13635 grpinvsub 13636 grpinvval2 13637 grpsubid 13638 grpsubid1 13639 grpsubeq0 13640 grpsubadd0sub 13641 grpsubadd 13642 grpsubsub 13643 grpaddsubass 13644 grpnpcan 13646 pwssub 13667 mulgsubdir 13720 subgsubcl 13743 subgsub 13744 issubg4m 13751 qussub 13795 ghmsub 13809 ablsub2inv 13869 ablsub4 13871 ablsubsub4 13877 eqgabl 13888 rngsubdi 13935 rngsubdir 13936 ringsubdi 14040 ringsubdir 14041 lmodvsubval2 14327 lmodsubdir 14330 cnfldsub 14560 |
| Copyright terms: Public domain | W3C validator |