| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ressmulgnn0 | Structured version Visualization version GIF version | ||
| Description: Values for the group multiple function in a restricted structure. (Contributed by Thierry Arnoux, 14-Jun-2017.) |
| Ref | Expression |
|---|---|
| ressmulgnn.1 | ⊢ 𝐻 = (𝐺 ↾s 𝐴) |
| ressmulgnn.2 | ⊢ 𝐴 ⊆ (Base‘𝐺) |
| ressmulgnn.3 | ⊢ ∗ = (.g‘𝐺) |
| ressmulgnn.4 | ⊢ 𝐼 = (invg‘𝐺) |
| ressmulgnn0.4 | ⊢ (0g‘𝐺) = (0g‘𝐻) |
| Ref | Expression |
|---|---|
| ressmulgnn0 | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) → (𝑁(.g‘𝐻)𝑋) = (𝑁 ∗ 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
| 2 | simplr 781 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 ∈ ℕ) → 𝑋 ∈ 𝐴) | |
| 3 | ressmulgnn.1 | . . . 4 ⊢ 𝐻 = (𝐺 ↾s 𝐴) | |
| 4 | ressmulgnn.2 | . . . 4 ⊢ 𝐴 ⊆ (Base‘𝐺) | |
| 5 | ressmulgnn.3 | . . . 4 ⊢ ∗ = (.g‘𝐺) | |
| 6 | ressmulgnn.4 | . . . 4 ⊢ 𝐼 = (invg‘𝐺) | |
| 7 | 3, 4, 5, 6 | ressmulgnn 19338 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ 𝐴) → (𝑁(.g‘𝐻)𝑋) = (𝑁 ∗ 𝑋)) |
| 8 | 1, 2, 7 | syl2anc 596 | . 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 ∈ ℕ) → (𝑁(.g‘𝐻)𝑋) = (𝑁 ∗ 𝑋)) |
| 9 | simplr 781 | . . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → 𝑋 ∈ 𝐴) | |
| 10 | eqid 2766 | . . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 3, 10 | ressbas2 17462 | . . . . . . 7 ⊢ (𝐴 ⊆ (Base‘𝐺) → 𝐴 = (Base‘𝐻)) |
| 12 | 4, 11 | ax-mp 5 | . . . . . 6 ⊢ 𝐴 = (Base‘𝐻) |
| 13 | ressmulgnn0.4 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐻) | |
| 14 | eqid 2766 | . . . . . 6 ⊢ (.g‘𝐻) = (.g‘𝐻) | |
| 15 | 12, 13, 14 | mulg0 19336 | . . . . 5 ⊢ (𝑋 ∈ 𝐴 → (0(.g‘𝐻)𝑋) = (0g‘𝐺)) |
| 16 | 9, 15 | syl 18 | . . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → (0(.g‘𝐻)𝑋) = (0g‘𝐺)) |
| 17 | simpr 490 | . . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → 𝑁 = 0) | |
| 18 | 17 | oveq1d 7465 | . . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → (𝑁(.g‘𝐻)𝑋) = (0(.g‘𝐻)𝑋)) |
| 19 | 4, 9 | sselid 3910 | . . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → 𝑋 ∈ (Base‘𝐺)) |
| 20 | eqid 2766 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 21 | 10, 20, 5 | mulg0 19336 | . . . . 5 ⊢ (𝑋 ∈ (Base‘𝐺) → (0 ∗ 𝑋) = (0g‘𝐺)) |
| 22 | 19, 21 | syl 18 | . . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → (0 ∗ 𝑋) = (0g‘𝐺)) |
| 23 | 16, 18, 22 | 3eqtr4d 2811 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → (𝑁(.g‘𝐻)𝑋) = (0 ∗ 𝑋)) |
| 24 | 17 | oveq1d 7465 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → (𝑁 ∗ 𝑋) = (0 ∗ 𝑋)) |
| 25 | 23, 24 | eqtr4d 2804 | . 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) ∧ 𝑁 = 0) → (𝑁(.g‘𝐻)𝑋) = (𝑁 ∗ 𝑋)) |
| 26 | elnn0 12647 | . . 3 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 27 | 26 | birani 509 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) → (𝑁 ∈ ℕ ∨ 𝑁 = 0)) |
| 28 | 8, 25, 27 | mpjaodan 973 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐴) → (𝑁(.g‘𝐻)𝑋) = (𝑁 ∗ 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1572 ∈ wcel 2150 ⊆ wss 3899 ‘cfv 6565 (class class class)co 7450 0cc0 11238 ℕcn 12374 ℕ0cn0 12645 Basecbs 17433 ↾s cress 17454 0gc0g 17662 invgcminusg 19197 .gcmg 19329 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-n0 12646 df-z 12733 df-uz 13005 df-seq 14184 df-sets 17388 df-slot 17406 df-ndx 17418 df-base 17434 df-ress 17455 df-plusg 17488 df-mulg 19330 |
| This theorem is used by: fermltlchr 21892 xrge0mulgnn0 33676 znfermltl 34027 |
| Copyright terms: Public domain | W3C validator |