| 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 13136 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ V) |
| 5 | grpsubval.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 6 | grpsubval.i | . . . 4 ⊢ 𝐼 = (invg‘𝐺) | |
| 7 | grpsubval.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 1, 5, 6, 7 | grpsubfvalg 13621 | . . 3 ⊢ (𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))) |
| 9 | 4, 8 | syl 14 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))) |
| 10 | oveq1 6020 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑦))) | |
| 11 | fveq2 5635 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝐼‘𝑦) = (𝐼‘𝑌)) | |
| 12 | 11 | oveq2d 6029 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑋 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 13 | 10, 12 | sylan9eq 2282 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 14 | 13 | adantl 277 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 15 | simpr 110 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 16 | plusgslid 13188 | . . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 17 | 16 | slotex 13102 | . . . . 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 13618 | . . . . . 6 ⊢ (𝐺 ∈ V → 𝐼 = (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺)))) |
| 22 | 4, 21 | syl 14 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐼 = (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺)))) |
| 23 | basfn 13134 | . . . . . . . 8 ⊢ Base Fn V | |
| 24 | funfvex 5652 | . . . . . . . . 9 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V) | |
| 25 | 24 | funfni 5429 | . . . . . . . 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 5876 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺))) ∈ V) |
| 29 | 22, 28 | eqeltrd 2306 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐼 ∈ V) |
| 30 | fvexg 5654 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑌 ∈ 𝐵) → (𝐼‘𝑌) ∈ V) | |
| 31 | 29, 30 | sylancom 420 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐼‘𝑌) ∈ V) |
| 32 | ovexg 6047 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ + ∈ V ∧ (𝐼‘𝑌) ∈ V) → (𝑋 + (𝐼‘𝑌)) ∈ V) | |
| 33 | 3, 19, 31, 32 | syl3anc 1271 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (𝐼‘𝑌)) ∈ V) |
| 34 | 9, 14, 3, 15, 33 | ovmpod 6144 | 1 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + (𝐼‘𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 Vcvv 2800 ↦ cmpt 4148 Fn wfn 5319 ‘cfv 5324 ℩crio 5965 (class class class)co 6013 ∈ cmpo 6015 Basecbs 13075 +gcplusg 13153 0gc0g 13332 invgcminusg 13577 -gcsg 13578 |
| 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 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1re 8119 ax-addrcl 8122 |
| 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 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 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-inn 9137 df-2 9195 df-ndx 13078 df-slot 13079 df-base 13081 df-plusg 13166 df-minusg 13580 df-sbg 13581 |
| This theorem is referenced by: grpsubinv 13649 grpsubrcan 13657 grpinvsub 13658 grpinvval2 13659 grpsubid 13660 grpsubid1 13661 grpsubeq0 13662 grpsubadd0sub 13663 grpsubadd 13664 grpsubsub 13665 grpaddsubass 13666 grpnpcan 13668 pwssub 13689 mulgsubdir 13742 subgsubcl 13765 subgsub 13766 issubg4m 13773 qussub 13817 ghmsub 13831 ablsub2inv 13891 ablsub4 13893 ablsubsub4 13899 eqgabl 13910 rngsubdi 13957 rngsubdir 13958 ringsubdi 14062 ringsubdir 14063 lmodvsubval2 14349 lmodsubdir 14352 cnfldsub 14582 |
| Copyright terms: Public domain | W3C validator |