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 31007

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 31005	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍))
5	4	necon3bid 3002	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 𝑇 ≠ 𝑍))
6		eqid 2763	. . . 4 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
7		eqid 2763	. . . 4 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
8	6, 7, 3	lnof 30965	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
9	6, 7, 1	nmoxr 30976	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → (𝑁‘𝑇) ∈ ℝ^*)
10	6, 7, 1	nmooge0 30977	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → 0 ≤ (𝑁‘𝑇))
11		0xr 11240	. . . . . . 7 ⊢ 0 ∈ ℝ^*
12		xrlttri2 13154	. . . . . . 7 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
13	11, 12	mpan2 701	. . . . . 6 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
14	13	adantr 484	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
15		xrlenlt 11258	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝑁‘𝑇) ∈ ℝ^*) → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
16	11, 15	mpan 700	. . . . . . 7 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
17	16	biimpa 480	. . . . . 6 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ¬ (𝑁‘𝑇) < 0)
18		biorf 947	. . . . . 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 593	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
22	8, 21	syld3an3 1430	. 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 399 ∨ wo 858 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ≠ wne 2958 class class class wbr 5101 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 0cc0 11084 ℝ^*cxr 11226 < clt 11227 ≤ cle 11228 NrmCVeccnv 30794 BaseSetcba 30796 LnOp clno 30950 normOp_OLD cnmoo 30951 0_op c0o 30953

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 ax-pre-sup 11162 ax-addf 11163 ax-mulf 11164

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-map 8810 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9386 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-div 11856 df-nn 12221 df-2 12290 df-3 12291 df-n0 12492 df-z 12579 df-uz 12850 df-rp 13004 df-seq 14025 df-exp 14085 df-cj 15136 df-re 15137 df-im 15138 df-sqrt 15272 df-abs 15273 df-grpo 30703 df-gid 30704 df-ginv 30705 df-ablo 30755 df-vc 30769 df-nv 30802 df-va 30805 df-ba 30806 df-sm 30807 df-0v 30808 df-nmcv 30810 df-lno 30954 df-nmoo 30955 df-0o 30957

This theorem is referenced by: blocni 31015

W3C validator