| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nmvs | Structured version Visualization version GIF version | ||
| Description: Defining property of a normed module. (Contributed by Mario Carneiro, 4-Oct-2015.) |
| Ref | Expression |
|---|---|
| isnlm.v | ⊢ 𝑉 = (Base‘𝑊) |
| isnlm.n | ⊢ 𝑁 = (norm‘𝑊) |
| isnlm.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| isnlm.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| isnlm.k | ⊢ 𝐾 = (Base‘𝐹) |
| isnlm.a | ⊢ 𝐴 = (norm‘𝐹) |
| Ref | Expression |
|---|---|
| nmvs | ⊢ ((𝑊 ∈ NrmMod ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝑁‘(𝑋 · 𝑌)) = ((𝐴‘𝑋) · (𝑁‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isnlm.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | isnlm.n | . . . . 5 ⊢ 𝑁 = (norm‘𝑊) | |
| 3 | isnlm.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 4 | isnlm.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 5 | isnlm.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
| 6 | isnlm.a | . . . . 5 ⊢ 𝐴 = (norm‘𝐹) | |
| 7 | 1, 2, 3, 4, 5, 6 | isnlm 25051 | . . . 4 ⊢ (𝑊 ∈ NrmMod ↔ ((𝑊 ∈ NrmGrp ∧ 𝑊 ∈ LMod ∧ 𝐹 ∈ NrmRing) ∧ ∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴‘𝑥) · (𝑁‘𝑦)))) |
| 8 | 7 | simprbi 503 | . . 3 ⊢ (𝑊 ∈ NrmMod → ∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴‘𝑥) · (𝑁‘𝑦))) |
| 9 | fvoveq1 7473 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑁‘(𝑥 · 𝑦)) = (𝑁‘(𝑋 · 𝑦))) | |
| 10 | fveq2 6915 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐴‘𝑋)) | |
| 11 | 10 | oveq1d 7465 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐴‘𝑥) · (𝑁‘𝑦)) = ((𝐴‘𝑋) · (𝑁‘𝑦))) |
| 12 | 9, 11 | eqeq12d 2782 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑁‘(𝑥 · 𝑦)) = ((𝐴‘𝑥) · (𝑁‘𝑦)) ↔ (𝑁‘(𝑋 · 𝑦)) = ((𝐴‘𝑋) · (𝑁‘𝑦)))) |
| 13 | oveq2 7458 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 · 𝑦) = (𝑋 · 𝑌)) | |
| 14 | 13 | fveq2d 6919 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝑁‘(𝑋 · 𝑦)) = (𝑁‘(𝑋 · 𝑌))) |
| 15 | fveq2 6915 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑁‘𝑦) = (𝑁‘𝑌)) | |
| 16 | 15 | oveq2d 7466 | . . . . 5 ⊢ (𝑦 = 𝑌 → ((𝐴‘𝑋) · (𝑁‘𝑦)) = ((𝐴‘𝑋) · (𝑁‘𝑌))) |
| 17 | 14, 16 | eqeq12d 2782 | . . . 4 ⊢ (𝑦 = 𝑌 → ((𝑁‘(𝑋 · 𝑦)) = ((𝐴‘𝑋) · (𝑁‘𝑦)) ↔ (𝑁‘(𝑋 · 𝑌)) = ((𝐴‘𝑋) · (𝑁‘𝑌)))) |
| 18 | 12, 17 | rspc2v 3589 | . . 3 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝑉 (𝑁‘(𝑥 · 𝑦)) = ((𝐴‘𝑥) · (𝑁‘𝑦)) → (𝑁‘(𝑋 · 𝑌)) = ((𝐴‘𝑋) · (𝑁‘𝑌)))) |
| 19 | 8, 18 | syl5com 32 | . 2 ⊢ (𝑊 ∈ NrmMod → ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝑁‘(𝑋 · 𝑌)) = ((𝐴‘𝑋) · (𝑁‘𝑌)))) |
| 20 | 19 | 3impib 1135 | 1 ⊢ ((𝑊 ∈ NrmMod ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝑁‘(𝑋 · 𝑌)) = ((𝐴‘𝑋) · (𝑁‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ‘cfv 6565 (class class class)co 7450 · cmul 11243 Basecbs 17433 Scalarcsca 17477 ·𝑠 cvsca 17478 LModclmod 21188 normcnm 24952 NrmGrpcngp 24953 NrmRingcnrg 24955 NrmModcnlm 24956 |
| 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-ext 2738 ax-nul 5265 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-ral 3084 df-rab 3416 df-v 3455 df-sbc 3742 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-iota 6519 df-fv 6573 df-ov 7453 df-nlm 24962 |
| This theorem is used by: nlmdsdi 25057 nlmdsdir 25058 nlmmul0or 25059 lssnlm 25077 nmoleub2lem3 25493 nmoleub3 25497 ncvsprp 25530 cphnmvs 25568 nmmulg 34710 |
| Copyright terms: Public domain | W3C validator |