Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nvz | Structured version Visualization version GIF version |
Description: The norm of a vector is zero iff the vector is zero. First part of Problem 2 of [Kreyszig] p. 64. (Contributed by NM, 24-Nov-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nvz.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
nvz.5 | ⊢ 𝑍 = (0vec‘𝑈) |
nvz.6 | ⊢ 𝑁 = (normCV‘𝑈) |
Ref | Expression |
---|---|
nvz | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) = 0 ↔ 𝐴 = 𝑍)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nvz.1 | . . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈) | |
2 | eqid 2821 | . . . . . 6 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
3 | eqid 2821 | . . . . . 6 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
4 | nvz.5 | . . . . . 6 ⊢ 𝑍 = (0vec‘𝑈) | |
5 | nvz.6 | . . . . . 6 ⊢ 𝑁 = (normCV‘𝑈) | |
6 | 1, 2, 3, 4, 5 | nvi 28385 | . . . . 5 ⊢ (𝑈 ∈ NrmCVec → (〈( +𝑣 ‘𝑈), ( ·𝑠OLD ‘𝑈)〉 ∈ CVecOLD ∧ 𝑁:𝑋⟶ℝ ∧ ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦( ·𝑠OLD ‘𝑈)𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥( +𝑣 ‘𝑈)𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))))) |
7 | 6 | simp3d 1140 | . . . 4 ⊢ (𝑈 ∈ NrmCVec → ∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦( ·𝑠OLD ‘𝑈)𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥( +𝑣 ‘𝑈)𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦)))) |
8 | simp1 1132 | . . . . 5 ⊢ ((((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦( ·𝑠OLD ‘𝑈)𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥( +𝑣 ‘𝑈)𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ((𝑁‘𝑥) = 0 → 𝑥 = 𝑍)) | |
9 | 8 | ralimi 3160 | . . . 4 ⊢ (∀𝑥 ∈ 𝑋 (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ∧ ∀𝑦 ∈ ℂ (𝑁‘(𝑦( ·𝑠OLD ‘𝑈)𝑥)) = ((abs‘𝑦) · (𝑁‘𝑥)) ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑥( +𝑣 ‘𝑈)𝑦)) ≤ ((𝑁‘𝑥) + (𝑁‘𝑦))) → ∀𝑥 ∈ 𝑋 ((𝑁‘𝑥) = 0 → 𝑥 = 𝑍)) |
10 | fveqeq2 6674 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑁‘𝑥) = 0 ↔ (𝑁‘𝐴) = 0)) | |
11 | eqeq1 2825 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑍 ↔ 𝐴 = 𝑍)) | |
12 | 10, 11 | imbi12d 347 | . . . . 5 ⊢ (𝑥 = 𝐴 → (((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) ↔ ((𝑁‘𝐴) = 0 → 𝐴 = 𝑍))) |
13 | 12 | rspccv 3620 | . . . 4 ⊢ (∀𝑥 ∈ 𝑋 ((𝑁‘𝑥) = 0 → 𝑥 = 𝑍) → (𝐴 ∈ 𝑋 → ((𝑁‘𝐴) = 0 → 𝐴 = 𝑍))) |
14 | 7, 9, 13 | 3syl 18 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (𝐴 ∈ 𝑋 → ((𝑁‘𝐴) = 0 → 𝐴 = 𝑍))) |
15 | 14 | imp 409 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) = 0 → 𝐴 = 𝑍)) |
16 | fveq2 6665 | . . . . 5 ⊢ (𝐴 = 𝑍 → (𝑁‘𝐴) = (𝑁‘𝑍)) | |
17 | 4, 5 | nvz0 28439 | . . . . 5 ⊢ (𝑈 ∈ NrmCVec → (𝑁‘𝑍) = 0) |
18 | 16, 17 | sylan9eqr 2878 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 = 𝑍) → (𝑁‘𝐴) = 0) |
19 | 18 | ex 415 | . . 3 ⊢ (𝑈 ∈ NrmCVec → (𝐴 = 𝑍 → (𝑁‘𝐴) = 0)) |
20 | 19 | adantr 483 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝐴 = 𝑍 → (𝑁‘𝐴) = 0)) |
21 | 15, 20 | impbid 214 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) = 0 ↔ 𝐴 = 𝑍)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∀wral 3138 〈cop 4567 class class class wbr 5059 ⟶wf 6346 ‘cfv 6350 (class class class)co 7150 ℂcc 10529 ℝcr 10530 0cc0 10531 + caddc 10534 · cmul 10536 ≤ cle 10670 abscabs 14587 CVecOLDcvc 28329 NrmCVeccnv 28355 +𝑣 cpv 28356 BaseSetcba 28357 ·𝑠OLD cns 28358 0veccn0v 28359 normCVcnmcv 28361 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-sup 8900 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-seq 13364 df-exp 13424 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-grpo 28264 df-gid 28265 df-ginv 28266 df-ablo 28316 df-vc 28330 df-nv 28363 df-va 28366 df-ba 28367 df-sm 28368 df-0v 28369 df-nmcv 28371 |
This theorem is referenced by: nvgt0 28445 nv1 28446 imsmetlem 28461 ipz 28490 nmlno0lem 28564 nmblolbii 28570 blocnilem 28575 siii 28624 hlipgt0 28685 |
Copyright terms: Public domain | W3C validator |