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 30935

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 30933	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍))
5	4	necon3bid 2991	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 𝑇 ≠ 𝑍))
6		eqid 2752	. . . 4 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
7		eqid 2752	. . . 4 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
8	6, 7, 3	lnof 30893	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
9	6, 7, 1	nmoxr 30904	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → (𝑁‘𝑇) ∈ ℝ^*)
10	6, 7, 1	nmooge0 30905	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → 0 ≤ (𝑁‘𝑇))
11		0xr 11215	. . . . . . 7 ⊢ 0 ∈ ℝ^*
12		xrlttri2 13130	. . . . . . 7 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
13	11, 12	mpan2 699	. . . . . 6 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
14	13	adantr 483	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
15		xrlenlt 11233	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝑁‘𝑇) ∈ ℝ^*) → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
16	11, 15	mpan 698	. . . . . . 7 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
17	16	biimpa 479	. . . . . 6 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ¬ (𝑁‘𝑇) < 0)
18		biorf 945	. . . . . 6 ⊢ (¬ (𝑁‘𝑇) < 0 → (0 < (𝑁‘𝑇) ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
19	17, 18	syl 17	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → (0 < (𝑁‘𝑇) ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
20	14, 19	bitr4d 284	. . . 4 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
21	9, 10, 20	syl2anc 592	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
22	8, 21	syld3an3 1420	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
23	5, 22	bitr3d 283	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 ≠ 𝑍 ↔ 0 < (𝑁‘𝑇)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 856 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 class class class wbr 5090 ⟶wf 6502 ‘cfv 6506 (class class class)co 7381 0cc0 11059 ℝ^*cxr 11201 < clt 11202 ≤ cle 11203 NrmCVeccnv 30722 BaseSetcba 30724 LnOp clno 30878 normOp_OLD cnmoo 30879 0_op c0o 30881

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137 ax-addf 11138 ax-mulf 11139

This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-er 8662 df-map 8794 df-en 8913 df-dom 8914 df-sdom 8915 df-sup 9374 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-div 11831 df-nn 12197 df-2 12266 df-3 12267 df-n0 12468 df-z 12555 df-uz 12826 df-rp 12980 df-seq 14001 df-exp 14061 df-cj 15098 df-re 15099 df-im 15100 df-sqrt 15234 df-abs 15235 df-grpo 30631 df-gid 30632 df-ginv 30633 df-ablo 30683 df-vc 30697 df-nv 30730 df-va 30733 df-ba 30734 df-sm 30735 df-0v 30736 df-nmcv 30738 df-lno 30882 df-nmoo 30883 df-0o 30885

This theorem is referenced by: blocni 30943

W3C validator