| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvge0 | Structured version Visualization version GIF version | ||
| Description: The norm of a normed complex vector space is nonnegative. Second part of Problem 2 of [Kreyszig] p. 64. (Contributed by NM, 28-Nov-2006.) (Proof shortened by AV, 10-Jul-2022.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvge0.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvge0.6 | ⊢ 𝑁 = (normCV‘𝑈) |
| Ref | Expression |
|---|---|
| nvge0 | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝑁‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2rp 13165 | . . 3 ⊢ 2 ∈ ℝ+ | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 2 ∈ ℝ+) |
| 3 | nvge0.1 | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 4 | nvge0.6 | . . 3 ⊢ 𝑁 = (normCV‘𝑈) | |
| 5 | 3, 4 | nvcl 31320 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℝ) |
| 6 | eqid 2763 | . . . . . . 7 ⊢ (0vec‘𝑈) = (0vec‘𝑈) | |
| 7 | 6, 4 | nvz0 31327 | . . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑁‘(0vec‘𝑈)) = 0) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(0vec‘𝑈)) = 0) |
| 9 | 1pneg1e0 12500 | . . . . . . . . 9 ⊢ (1 + -1) = 0 | |
| 10 | 9 | oveq1i 7461 | . . . . . . . 8 ⊢ ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = (0( ·𝑠OLD ‘𝑈)𝐴) |
| 11 | eqid 2763 | . . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 12 | 3, 11, 6 | nv0 31296 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0( ·𝑠OLD ‘𝑈)𝐴) = (0vec‘𝑈)) |
| 13 | 10, 12 | eqtr2id 2811 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0vec‘𝑈) = ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴)) |
| 14 | neg1cn 12345 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
| 15 | ax-1cn 11297 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 16 | eqid 2763 | . . . . . . . . . 10 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 17 | 3, 16, 11 | nvdir 31290 | . . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 ∈ ℂ ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 18 | 15, 17 | mp3anr1 1488 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ ( -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 19 | 14, 18 | mpanr1 716 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 20 | 3, 11 | nvsid 31286 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (1( ·𝑠OLD ‘𝑈)𝐴) = 𝐴) |
| 21 | 20 | oveq1d 7466 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴)) = (𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 22 | 13, 19, 21 | 3eqtrd 2802 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0vec‘𝑈) = (𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 23 | 22 | fveq2d 6920 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(0vec‘𝑈)) = (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 24 | 8, 23 | eqtr3d 2800 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 = (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 25 | 3, 11 | nvscl 31285 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 26 | 14, 25 | mp3an2 1479 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 27 | 3, 16, 4 | nvtri 31329 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ ( -1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) → (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) ≤ ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 28 | 26, 27 | mpd3an3 1492 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) ≤ ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 29 | 24, 28 | eqbrtrd 5133 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 30 | 3, 11, 4 | nvm1 31324 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)) = (𝑁‘𝐴)) |
| 31 | 30 | oveq2d 7467 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴))) = ((𝑁‘𝐴) + (𝑁‘𝐴))) |
| 32 | 5 | recnd 11376 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℂ) |
| 33 | 32 | 2timesd 12629 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (2 · (𝑁‘𝐴)) = ((𝑁‘𝐴) + (𝑁‘𝐴))) |
| 34 | 31, 33 | eqtr4d 2801 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴))) = (2 · (𝑁‘𝐴))) |
| 35 | 29, 34 | breqtrd 5137 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (2 · (𝑁‘𝐴))) |
| 36 | 2, 5, 35 | prodge0rd 13269 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝑁‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 0cc0 11239 1c1 11240 + caddc 11242 · cmul 11244 ≤ cle 11383 -cneg 11581 2c2 12437 ℝ+crp 13160 NrmCVeccnv 31243 +𝑣 cpv 31244 BaseSetcba 31245 ·𝑠OLD cns 31246 0veccn0v 31247 normCVcnmcv 31249 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-grpo 31152 df-gid 31153 df-ginv 31154 df-ablo 31204 df-vc 31218 df-nv 31251 df-va 31254 df-ba 31255 df-sm 31256 df-0v 31257 df-nmcv 31259 |
| This theorem is used by: nvgt0 31333 smcnlem 31356 ipnm 31370 nmooge0 31426 nmoub3i 31432 siilem1 31510 siii 31512 ubthlem3 31531 minvecolem1 31533 minvecolem5 31540 minvecolem6 31541 htthlem 31576 |
| Copyright terms: Public domain | W3C validator |