| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpsubpropdg | GIF version | ||
| Description: Weak property deduction for the group subtraction operation. (Contributed by Mario Carneiro, 27-Mar-2015.) |
| Ref | Expression |
|---|---|
| grpsubpropd.b | ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻)) |
| grpsubpropd.p | ⊢ (𝜑 → (+g‘𝐺) = (+g‘𝐻)) |
| grpsubpropdg.g | ⊢ (𝜑 → 𝐺 ∈ 𝑉) |
| grpsubpropdg.h | ⊢ (𝜑 → 𝐻 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| grpsubpropdg | ⊢ (𝜑 → (-g‘𝐺) = (-g‘𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubpropd.b | . . 3 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻)) | |
| 2 | grpsubpropd.p | . . . 4 ⊢ (𝜑 → (+g‘𝐺) = (+g‘𝐻)) | |
| 3 | eqidd 2239 | . . . 4 ⊢ (𝜑 → 𝑎 = 𝑎) | |
| 4 | eqidd 2239 | . . . . . 6 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐺)) | |
| 5 | grpsubpropdg.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
| 6 | grpsubpropdg.h | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ 𝑊) | |
| 7 | 2 | oveqdr 6107 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝐻)𝑦)) |
| 8 | 4, 1, 5, 6, 7 | grpinvpropdg 13863 | . . . . 5 ⊢ (𝜑 → (invg‘𝐺) = (invg‘𝐻)) |
| 9 | 8 | fveq1d 5695 | . . . 4 ⊢ (𝜑 → ((invg‘𝐺)‘𝑏) = ((invg‘𝐻)‘𝑏)) |
| 10 | 2, 3, 9 | oveq123d 6100 | . . 3 ⊢ (𝜑 → (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))) |
| 11 | 1, 1, 10 | mpoeq123dv 6144 | . 2 ⊢ (𝜑 → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏))) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))) |
| 12 | eqid 2238 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 13 | eqid 2238 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 14 | eqid 2238 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 15 | eqid 2238 | . . . 4 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
| 16 | 12, 13, 14, 15 | grpsubfvalg 13833 | . . 3 ⊢ (𝐺 ∈ 𝑉 → (-g‘𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)))) |
| 17 | 5, 16 | syl 14 | . 2 ⊢ (𝜑 → (-g‘𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)))) |
| 18 | eqid 2238 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 19 | eqid 2238 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 20 | eqid 2238 | . . . 4 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
| 21 | eqid 2238 | . . . 4 ⊢ (-g‘𝐻) = (-g‘𝐻) | |
| 22 | 18, 19, 20, 21 | grpsubfvalg 13833 | . . 3 ⊢ (𝐻 ∈ 𝑊 → (-g‘𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))) |
| 23 | 6, 22 | syl 14 | . 2 ⊢ (𝜑 → (-g‘𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))) |
| 24 | 11, 17, 23 | 3eqtr4d 2281 | 1 ⊢ (𝜑 → (-g‘𝐺) = (-g‘𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5375 (class class class)co 6079 ∈ cmpo 6081 Basecbs 13335 +gcplusg 13414 invgcminusg 13789 -gcsg 13790 |
| 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-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-inn 9288 df-ndx 13338 df-slot 13339 df-base 13341 df-0g 13595 df-minusg 13792 df-sbg 13793 |
| This theorem is referenced by: aprprop 14584 rlmsubg 14778 |
| Copyright terms: Public domain | W3C validator |