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 31179

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 31177	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍))
5	4	necon3bid 3005	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 𝑇 ≠ 𝑍))
6		eqid 2766	. . . 4 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
7		eqid 2766	. . . 4 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
8	6, 7, 3	lnof 31137	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
9	6, 7, 1	nmoxr 31148	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → (𝑁‘𝑇) ∈ ℝ^*)
10	6, 7, 1	nmooge0 31149	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → 0 ≤ (𝑁‘𝑇))
11		0xr 11274	. . . . . . 7 ⊢ 0 ∈ ℝ^*
12		xrlttri2 13185	. . . . . . 7 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
13	11, 12	mpan2 704	. . . . . 6 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
14	13	adantr 486	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
15		xrlenlt 11292	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝑁‘𝑇) ∈ ℝ^*) → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
16	11, 15	mpan 703	. . . . . . 7 ⊢ ((𝑁‘𝑇) ∈ ℝ^* → (0 ≤ (𝑁‘𝑇) ↔ ¬ (𝑁‘𝑇) < 0))
17	16	biimpa 482	. . . . . 6 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ¬ (𝑁‘𝑇) < 0)
18		biorf 950	. . . . . 6 ⊢ (¬ (𝑁‘𝑇) < 0 → (0 < (𝑁‘𝑇) ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
19	17, 18	syl 18	. . . . 5 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → (0 < (𝑁‘𝑇) ↔ ((𝑁‘𝑇) < 0 ∨ 0 < (𝑁‘𝑇))))
20	14, 19	bitr4d 285	. . . 4 ⊢ (((𝑁‘𝑇) ∈ ℝ^* ∧ 0 ≤ (𝑁‘𝑇)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
21	9, 10, 20	syl2anc 596	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:(BaseSet‘𝑈)⟶(BaseSet‘𝑊)) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
22	8, 21	syld3an3 1436	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ((𝑁‘𝑇) ≠ 0 ↔ 0 < (𝑁‘𝑇)))
23	5, 22	bitr3d 284	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 ≠ 𝑍 ↔ 0 < (𝑁‘𝑇)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 class class class wbr 5114 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 0cc0 11118 ℝ^*cxr 11260 < clt 11261 ≤ cle 11262 NrmCVeccnv 30966 BaseSetcba 30968 LnOp clno 31122 normOp_OLD cnmoo 31123 0_op c0o 31125

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 ax-addf 11197 ax-mulf 11198

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-map 8835 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-rp 13035 df-seq 14058 df-exp 14118 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-grpo 30875 df-gid 30876 df-ginv 30877 df-ablo 30927 df-vc 30941 df-nv 30974 df-va 30977 df-ba 30978 df-sm 30979 df-0v 30980 df-nmcv 30982 df-lno 31126 df-nmoo 31127 df-0o 31129

This theorem is used by: blocni 31187

W3C validator