nmlnogt0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > nmlnogt0		Structured version Visualization version GIF version

Theorem nmlnogt0 29060

Description: The norm of a nonzero linear operator is positive. (Contributed by NM, 10-Dec-2007.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nmlnogt0.3	⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
nmlnogt0.0	⊢ 𝑍 = (𝑈 0_op 𝑊)
nmlnogt0.7	⊢ 𝐿 = (𝑈 LnOp 𝑊)

**Assertion**
Ref	Expression
nmlnogt0	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 ≠ 𝑍 ↔ 0 < (𝑁‘𝑇)))

**Proof of Theorem nmlnogt0**
Step	Hyp	Ref	Expression
1		nmlnogt0.3	. . . 4 ⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
2		nmlnogt0.0	. . . 4 ⊢ 𝑍 = (𝑈 0_op 𝑊)
3		nmlnogt0.7	. . . 4 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
4	1, 2, 3	nmlno0 29058	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍))
5	4	necon3bid 2987	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 𝑇 ≠ 𝑍))
6		eqid 2738	. . . 4 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
7		eqid 2738	. . . 4 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
8	6, 7, 3	lnof 29018	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
9	6, 7, 1	nmoxr 29029	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → (𝑁‘𝑇) ∈ ℝ^*)
10	6, 7, 1	nmooge0 29030	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → 0 ≤ (𝑁‘𝑇))
11		0xr 10953	. . . . . . 7 ⊢ 0 ∈ ℝ^*
12		xrlttri2 12805	. . . . . . 7 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
13	11, 12	mpan2 687	. . . . . 6 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
14	13	adantr 480	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
15		xrlenlt 10971	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝑁‘𝑇) ∈ ℝ^*) → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
16	11, 15	mpan 686	. . . . . . 7 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
17	16	biimpa 476	. . . . . 6 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ¬ (𝑁‘𝑇) < 0)
18		biorf 933	. . . . . 6 ⊢ (¬ (𝑁‘𝑇) < 0 → (0 < (𝑁‘𝑇) ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
19	17, 18	syl 17	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → (0 < (𝑁‘𝑇) ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
20	14, 19	bitr4d 281	. . . 4 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
21	9, 10, 20	syl2anc 583	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
22	8, 21	syld3an3 1407	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
23	5, 22	bitr3d 280	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 ≠ 𝑍 ↔ 0 < (𝑁‘𝑇)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 class class class wbr 5070 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 0cc0 10802 ℝ^*cxr 10939 < clt 10940 ≤ cle 10941 NrmCVeccnv 28847 BaseSetcba 28849 LnOp clno 29003 normOp_OLD cnmoo 29004 0_op c0o 29006

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-grpo 28756 df-gid 28757 df-ginv 28758 df-ablo 28808 df-vc 28822 df-nv 28855 df-va 28858 df-ba 28859 df-sm 28860 df-0v 28861 df-nmcv 28863 df-lno 29007 df-nmoo 29008 df-0o 29010

This theorem is referenced by: blocni 29068

W3C validator