| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvgt0 | Structured version Visualization version GIF version | ||
| Description: A nonzero norm is positive. (Contributed by NM, 20-Nov-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvgt0.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvgt0.5 | ⊢ 𝑍 = (0vec‘𝑈) |
| nvgt0.6 | ⊢ 𝑁 = (normCV‘𝑈) |
| Ref | Expression |
|---|---|
| nvgt0 | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝐴 ≠ 𝑍 ↔ 0 < (𝑁‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nvgt0.1 | . . . 4 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 2 | nvgt0.5 | . . . 4 ⊢ 𝑍 = (0vec‘𝑈) | |
| 3 | nvgt0.6 | . . . 4 ⊢ 𝑁 = (normCV‘𝑈) | |
| 4 | 1, 2, 3 | nvz 31032 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) = 0 ↔ 𝐴 = 𝑍)) |
| 5 | 4 | necon3bid 3001 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) ≠ 0 ↔ 𝐴 ≠ 𝑍)) |
| 6 | 1, 3 | nvcl 31024 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ ℝ) |
| 7 | 1, 3 | nvge0 31036 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝑁‘𝐴)) |
| 8 | ne0gt0 11321 | . . 3 ⊢ (((𝑁‘𝐴) ∈ ℝ ∧ 0 ≤ (𝑁‘𝐴)) → ((𝑁‘𝐴) ≠ 0 ↔ 0 < (𝑁‘𝐴))) | |
| 9 | 6, 7, 8 | syl2anc 595 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((𝑁‘𝐴) ≠ 0 ↔ 0 < (𝑁‘𝐴))) |
| 10 | 5, 9 | bitr3d 284 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝐴 ≠ 𝑍 ↔ 0 < (𝑁‘𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 class class class wbr 5108 ‘cfv 6536 ℝcr 11105 0cc0 11106 < clt 11249 ≤ cle 11250 NrmCVeccnv 30947 BaseSetcba 30949 0veccn0v 30951 normCVcnmcv 30953 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-seq 14045 df-exp 14105 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-grpo 30856 df-gid 30857 df-ginv 30858 df-ablo 30908 df-vc 30922 df-nv 30955 df-va 30958 df-ba 30959 df-sm 30960 df-0v 30961 df-nmcv 30963 |
| This theorem is used by: nv1 31038 nmlno0lem 31156 nmblolbii 31162 blocnilem 31167 |
| Copyright terms: Public domain | W3C validator |