| 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 13294 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ V) |
| 5 | grpsubval.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 6 | grpsubval.i | . . . 4 ⊢ 𝐼 = (invg‘𝐺) | |
| 7 | grpsubval.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 1, 5, 6, 7 | grpsubfvalg 13779 | . . 3 ⊢ (𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))) |
| 9 | 4, 8 | syl 14 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))) |
| 10 | oveq1 6059 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑦))) | |
| 11 | fveq2 5672 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝐼‘𝑦) = (𝐼‘𝑌)) | |
| 12 | 11 | oveq2d 6068 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑋 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 13 | 10, 12 | sylan9eq 2287 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 14 | 13 | adantl 277 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑥 + (𝐼‘𝑦)) = (𝑋 + (𝐼‘𝑌))) |
| 15 | simpr 110 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 16 | plusgslid 13346 | . . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 17 | 16 | slotex 13260 | . . . . 5 ⊢ (𝐺 ∈ V → (+g‘𝐺) ∈ V) |
| 18 | 4, 17 | syl 14 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (+g‘𝐺) ∈ V) |
| 19 | 5, 18 | eqeltrid 2321 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → + ∈ V) |
| 20 | eqid 2234 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 21 | 1, 5, 20, 6 | grpinvfvalg 13776 | . . . . . 6 ⊢ (𝐺 ∈ V → 𝐼 = (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺)))) |
| 22 | 4, 21 | syl 14 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐼 = (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺)))) |
| 23 | basfn 13292 | . . . . . . . 8 ⊢ Base Fn V | |
| 24 | funfvex 5689 | . . . . . . . . 9 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V) | |
| 25 | 24 | funfni 5460 | . . . . . . . 8 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V) |
| 26 | 23, 4, 25 | sylancr 414 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (Base‘𝐺) ∈ V) |
| 27 | 1, 26 | eqeltrid 2321 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐵 ∈ V) |
| 28 | 27 | mptexd 5915 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑧 ∈ 𝐵 ↦ (℩𝑤 ∈ 𝐵 (𝑤 + 𝑧) = (0g‘𝐺))) ∈ V) |
| 29 | 22, 28 | eqeltrd 2311 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐼 ∈ V) |
| 30 | fvexg 5691 | . . . 4 ⊢ ((𝐼 ∈ V ∧ 𝑌 ∈ 𝐵) → (𝐼‘𝑌) ∈ V) | |
| 31 | 29, 30 | sylancom 420 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐼‘𝑌) ∈ V) |
| 32 | ovexg 6086 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ + ∈ V ∧ (𝐼‘𝑌) ∈ V) → (𝑋 + (𝐼‘𝑌)) ∈ V) | |
| 33 | 3, 19, 31, 32 | syl3anc 1274 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (𝐼‘𝑌)) ∈ V) |
| 34 | 9, 14, 3, 15, 33 | ovmpod 6183 | 1 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + (𝐼‘𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ↦ cmpt 4173 Fn wfn 5349 ‘cfv 5354 ℩crio 6004 (class class class)co 6052 ∈ cmpo 6054 Basecbs 13233 +gcplusg 13311 0gc0g 13490 invgcminusg 13735 -gcsg 13736 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8223 ax-resscn 8224 ax-1re 8226 ax-addrcl 8229 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-inn 9243 df-2 9301 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-minusg 13738 df-sbg 13739 |
| This theorem is referenced by: grpsubinv 13807 grpsubrcan 13815 grpinvsub 13816 grpinvval2 13817 grpsubid 13818 grpsubid1 13819 grpsubeq0 13820 grpsubadd0sub 13821 grpsubadd 13822 grpsubsub 13823 grpaddsubass 13824 grpnpcan 13826 pwssub 13847 mulgsubdir 13900 subgsubcl 13923 subgsub 13924 issubg4m 13931 qussub 13975 ghmsub 13989 ablsub2inv 14049 ablsub4 14051 ablsubsub4 14057 eqgabl 14068 rngsubdi 14116 rngsubdir 14117 ringsubdi 14221 ringsubdir 14222 opprdrng 14480 lmodvsubval2 14539 lmodsubdir 14542 cnfldsub 14772 |
| Copyright terms: Public domain | W3C validator |