| 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 13118 | . . 3 ⊢ 2 ∈ ℝ+ | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 2 ∈ ℝ+) |
| 3 | nvge0.1 | . . 3 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 4 | nvge0.6 | . . 3 ⊢ 𝑁 = (normCV‘𝑈) | |
| 5 | 3, 4 | nvcl 31256 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℝ) |
| 6 | eqid 2761 | . . . . . . 7 ⊢ (0vec‘𝑈) = (0vec‘𝑈) | |
| 7 | 6, 4 | nvz0 31263 | . . . . . 6 ⊢ (𝑈 ∈ NrmCVec → (𝑁‘(0vec‘𝑈)) = 0) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(0vec‘𝑈)) = 0) |
| 9 | 1pneg1e0 12453 | . . . . . . . . 9 ⊢ (1 + -1) = 0 | |
| 10 | 9 | oveq1i 7428 | . . . . . . . 8 ⊢ ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴) = (0( ·𝑠OLD ‘𝑈)𝐴) |
| 11 | eqid 2761 | . . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 12 | 3, 11, 6 | nv0 31232 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0( ·𝑠OLD ‘𝑈)𝐴) = (0vec‘𝑈)) |
| 13 | 10, 12 | eqtr2id 2809 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0vec‘𝑈) = ((1 + -1)( ·𝑠OLD ‘𝑈)𝐴)) |
| 14 | neg1cn 12298 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
| 15 | ax-1cn 11251 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 16 | eqid 2761 | . . . . . . . . . 10 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 17 | 3, 16, 11 | nvdir 31226 | . . . . . . . . 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 31222 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (1( ·𝑠OLD ‘𝑈)𝐴) = 𝐴) |
| 21 | 20 | oveq1d 7433 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((1( ·𝑠OLD ‘𝑈)𝐴)( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴)) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴))) |
| 22 | 13, 19, 21 | 3eqtrd 2800 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0vec‘𝑈) = (𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴))) |
| 23 | 22 | fveq2d 6887 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(0vec‘𝑈)) = (𝑁‘(𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 24 | 8, 23 | eqtr3d 2798 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 = (𝑁‘(𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 25 | 3, 11 | nvscl 31221 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 26 | 14, 25 | mp3an2 1478 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 27 | 3, 16, 4 | nvtri 31265 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) → (𝑁‘(𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴))) ≤ ((𝑁‘𝐴) + (𝑁‘(-1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 28 | 26, 27 | mpd3an3 1491 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(𝐴( +𝑣 ‘𝑈)(-1( ·𝑠OLD ‘𝑈)𝐴))) ≤ ((𝑁‘𝐴) + (𝑁‘(-1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 29 | 24, 28 | eqbrtrd 5127 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ ((𝑁‘𝐴) + (𝑁‘(-1( ·𝑠OLD ‘𝑈)𝐴)))) |
| 30 | 3, 11, 4 | nvm1 31260 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘(-1( ·𝑠OLD ‘𝑈)𝐴)) = (𝑁‘𝐴)) |
| 31 | 30 | oveq2d 7434 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) + (𝑁‘(-1( ·𝑠OLD ‘𝑈)𝐴))) = ((𝑁‘𝐴) + (𝑁‘𝐴))) |
| 32 | 5 | recnd 11330 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℂ) |
| 33 | 32 | 2timesd 12582 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (2 · (𝑁‘𝐴)) = ((𝑁‘𝐴) + (𝑁‘𝐴))) |
| 34 | 31, 33 | eqtr4d 2799 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) + (𝑁‘(-1( ·𝑠OLD ‘𝑈)𝐴))) = (2 · (𝑁‘𝐴))) |
| 35 | 29, 34 | breqtrd 5131 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (2 · (𝑁‘𝐴))) |
| 36 | 2, 5, 35 | prodge0rd 13222 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝑁‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6537 (class class class)co 7418 ℂcc 11191 0cc0 11193 1c1 11194 + caddc 11196 · cmul 11198 ≤ cle 11337 -cneg 11535 2c2 12390 ℝ+crp 13113 NrmCVeccnv 31179 +𝑣 cpv 31180 BaseSetcba 31181 ·𝑠OLD cns 31182 0veccn0v 31183 normCVcnmcv 31185 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 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 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-sup 9427 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-grpo 31088 df-gid 31089 df-ginv 31090 df-ablo 31140 df-vc 31154 df-nv 31187 df-va 31190 df-ba 31191 df-sm 31192 df-0v 31193 df-nmcv 31195 |
| This theorem is used by: nvgt0 31269 smcnlem 31292 ipnm 31306 nmooge0 31362 nmoub3i 31368 siilem1 31446 siii 31448 ubthlem3 31467 minvecolem1 31469 minvecolem5 31476 minvecolem6 31477 htthlem 31512 |
| Copyright terms: Public domain | W3C validator |