| 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 2232 | . . . 4 ⊢ (𝜑 → 𝑎 = 𝑎) | |
| 4 | eqidd 2232 | . . . . . 6 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐺)) | |
| 5 | grpsubpropdg.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
| 6 | grpsubpropdg.h | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ 𝑊) | |
| 7 | 2 | oveqdr 6046 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝐻)𝑦)) |
| 8 | 4, 1, 5, 6, 7 | grpinvpropdg 13663 | . . . . 5 ⊢ (𝜑 → (invg‘𝐺) = (invg‘𝐻)) |
| 9 | 8 | fveq1d 5641 | . . . 4 ⊢ (𝜑 → ((invg‘𝐺)‘𝑏) = ((invg‘𝐻)‘𝑏)) |
| 10 | 2, 3, 9 | oveq123d 6039 | . . 3 ⊢ (𝜑 → (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))) |
| 11 | 1, 1, 10 | mpoeq123dv 6083 | . 2 ⊢ (𝜑 → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏))) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))) |
| 12 | eqid 2231 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 13 | eqid 2231 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 14 | eqid 2231 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 15 | eqid 2231 | . . . 4 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
| 16 | 12, 13, 14, 15 | grpsubfvalg 13633 | . . 3 ⊢ (𝐺 ∈ 𝑉 → (-g‘𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)))) |
| 17 | 5, 16 | syl 14 | . 2 ⊢ (𝜑 → (-g‘𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)))) |
| 18 | eqid 2231 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 19 | eqid 2231 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 20 | eqid 2231 | . . . 4 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
| 21 | eqid 2231 | . . . 4 ⊢ (-g‘𝐻) = (-g‘𝐻) | |
| 22 | 18, 19, 20, 21 | grpsubfvalg 13633 | . . 3 ⊢ (𝐻 ∈ 𝑊 → (-g‘𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))) |
| 23 | 6, 22 | syl 14 | . 2 ⊢ (𝜑 → (-g‘𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))) |
| 24 | 11, 17, 23 | 3eqtr4d 2274 | 1 ⊢ (𝜑 → (-g‘𝐺) = (-g‘𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 ∈ cmpo 6020 Basecbs 13087 +gcplusg 13165 invgcminusg 13589 -gcsg 13590 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-inn 9144 df-ndx 13090 df-slot 13091 df-base 13093 df-0g 13346 df-minusg 13592 df-sbg 13593 |
| This theorem is referenced by: rlmsubg 14478 |
| Copyright terms: Public domain | W3C validator |