| 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 13132 | . . 3 ⊢ 2 ∈ ℝ+ | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 2 ∈ ℝ+) |
| 3 | nvge0.1 | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 4 | nvge0.6 | . . 3 ⊢ 𝑁 = (normCV‘𝑈) | |
| 5 | 3, 4 | nvcl 31272 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℝ) |
| 6 | eqid 2760 | . . . . . . 7 ⊢ (0vec‘𝑈) = (0vec‘𝑈) | |
| 7 | 6, 4 | nvz0 31279 | . . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑁‘(0vec‘𝑈)) = 0) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(0vec‘𝑈)) = 0) |
| 9 | 1pneg1e0 12467 | . . . . . . . . 9 ⊢ (1 + -1) = 0 | |
| 10 | 9 | oveq1i 7434 | . . . . . . . 8 ⊢ ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = (0( ·𝑠OLD ‘𝑈)𝐴) |
| 11 | eqid 2760 | . . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 12 | 3, 11, 6 | nv0 31248 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0( ·𝑠OLD ‘𝑈)𝐴) = (0vec‘𝑈)) |
| 13 | 10, 12 | eqtr2id 2808 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0vec‘𝑈) = ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴)) |
| 14 | neg1cn 12312 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
| 15 | ax-1cn 11265 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 16 | eqid 2760 | . . . . . . . . . 10 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 17 | 3, 16, 11 | nvdir 31242 | . . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 ∈ ℂ ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 18 | 15, 17 | mp3anr1 1487 | . . . . . . . 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 31238 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (1( ·𝑠OLD ‘𝑈)𝐴) = 𝐴) |
| 21 | 20 | oveq1d 7439 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴)) = (𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 22 | 13, 19, 21 | 3eqtrd 2799 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0vec‘𝑈) = (𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) |
| 23 | 22 | fveq2d 6894 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(0vec‘𝑈)) = (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 24 | 8, 23 | eqtr3d 2797 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 = (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 25 | 3, 11 | nvscl 31237 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 26 | 14, 25 | mp3an2 1478 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ( -1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 27 | 3, 16, 4 | nvtri 31281 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ ( -1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) → (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) ≤ ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 28 | 26, 27 | mpd3an3 1491 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝐴( +𝑣 ‘𝑈)( -1( ·𝑠OLD ‘𝑈)𝐴))) ≤ ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 29 | 24, 28 | eqbrtrd 5126 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 30 | 3, 11, 4 | nvm1 31276 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴)) = (𝑁‘𝐴)) |
| 31 | 30 | oveq2d 7440 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴))) = ((𝑁‘𝐴) + (𝑁‘𝐴))) |
| 32 | 5 | recnd 11344 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℂ) |
| 33 | 32 | 2timesd 12596 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (2 · (𝑁‘𝐴)) = ((𝑁‘𝐴) + (𝑁‘𝐴))) |
| 34 | 31, 33 | eqtr4d 2798 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) + (𝑁‘( -1( ·𝑠OLD ‘𝑈)𝐴))) = (2 · (𝑁‘𝐴))) |
| 35 | 29, 34 | breqtrd 5130 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (2 · (𝑁‘𝐴))) |
| 36 | 2, 5, 35 | prodge0rd 13236 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝑁‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 ℂcc 11205 0cc0 11207 1c1 11208 + caddc 11210 · cmul 11212 ≤ cle 11351 -cneg 11549 2c2 12404 ℝ+crp 13127 NrmCVeccnv 31195 +𝑣 cpv 31196 BaseSetcba 31197 ·𝑠OLD cns 31198 0veccn0v 31199 normCVcnmcv 31201 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-sup 9441 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-n0 12614 df-z 12701 df-uz 12973 df-rp 13128 df-seq 14152 df-exp 14212 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 df-grpo 31104 df-gid 31105 df-ginv 31106 df-ablo 31156 df-vc 31170 df-nv 31203 df-va 31206 df-ba 31207 df-sm 31208 df-0v 31209 df-nmcv 31211 |
| This theorem is used by: nvgt0 31285 smcnlem 31308 ipnm 31322 nmooge0 31378 nmoub3i 31384 siilem1 31462 siii 31464 ubthlem3 31483 minvecolem1 31485 minvecolem5 31492 minvecolem6 31493 htthlem 31528 |
| Copyright terms: Public domain | W3C validator |