Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isnvi | Structured version Visualization version GIF version |
Description: Properties that determine a normed complex vector space. (Contributed by NM, 15-Apr-2007.) (New usage is discouraged.) |
Ref | Expression |
---|---|
isnvi.5 | ⊢ 𝑋 = ran 𝐺 |
isnvi.6 | ⊢ 𝑍 = (GId‘𝐺) |
isnvi.7 | ⊢ 〈𝐺, 𝑆〉 ∈ CVecOLD |
isnvi.8 | ⊢ 𝑁:𝑋⟶ℝ |
isnvi.9 | ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑁‘𝑥) = 0) → 𝑥 = 𝑍) |
isnvi.10 | ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥))) |
isnvi.11 | ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) |
isnvi.12 | ⊢ 𝑈 = 〈〈𝐺, 𝑆〉, 𝑁〉 |
Ref | Expression |
---|---|
isnvi | ⊢ 𝑈 ∈ NrmCVec |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isnvi.12 | . 2 ⊢ 𝑈 = 〈〈𝐺, 𝑆〉, 𝑁〉 | |
2 | isnvi.7 | . . 3 ⊢ 〈𝐺, 𝑆〉 ∈ CVecOLD | |
3 | isnvi.8 | . . 3 ⊢ 𝑁:𝑋⟶ℝ | |
4 | isnvi.9 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑁‘𝑥) = 0) → 𝑥 = 𝑍) | |
5 | 4 | ex 415 | . . . . 5 ⊢ (𝑥 ∈ 𝑋 → ((𝑁‘𝑥) = 0 → 𝑥 = 𝑍)) |
6 | isnvi.10 | . . . . . . 7 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥))) | |
7 | 6 | ancoms 461 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ ℂ) → (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥))) |
8 | 7 | ralrimiva 3184 | . . . . 5 ⊢ (𝑥 ∈ 𝑋 → ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥))) |
9 | isnvi.11 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) | |
10 | 9 | ralrimiva 3184 | . . . . 5 ⊢ (𝑥 ∈ 𝑋 → ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) |
11 | 5, 8, 10 | 3jca 1124 | . . . 4 ⊢ (𝑥 ∈ 𝑋 → (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) |
12 | 11 | rgen 3150 | . . 3 ⊢ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) |
13 | isnvi.5 | . . . 4 ⊢ 𝑋 = ran 𝐺 | |
14 | isnvi.6 | . . . 4 ⊢ 𝑍 = (GId‘𝐺) | |
15 | 13, 14 | isnv 28391 | . . 3 ⊢ (〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec ↔ (〈𝐺, 𝑆〉 ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦𝑆𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥𝐺𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) |
16 | 2, 3, 12, 15 | mpbir3an 1337 | . 2 ⊢ 〈〈𝐺, 𝑆〉, 𝑁〉 ∈ NrmCVec |
17 | 1, 16 | eqeltri 2911 | 1 ⊢ 𝑈 ∈ NrmCVec |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∀wral 3140 〈cop 4575 class class class wbr 5068 ran crn 5558 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ℂcc 10537 ℝcr 10538 0cc0 10539 + caddc 10542 · cmul 10544 ≤ cle 10678 abscabs 14595 GIdcgi 28269 CVecOLDcvc 28337 NrmCVeccnv 28363 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-vc 28338 df-nv 28371 |
This theorem is referenced by: cnnv 28456 hhnv 28944 hhssnv 29043 |
Copyright terms: Public domain | W3C validator |