nmoge0 - Metamath Proof Explorer

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

Theorem nmoge0 24229

Description: The operator norm of an operator is nonnegative. (Contributed by Mario Carneiro, 18-Oct-2015.)

**Hypothesis**
Ref	Expression
nmofval.1	⊢ 𝑁 = (𝑆 normOp 𝑇)

**Assertion**
Ref	Expression
nmoge0	⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → 0 ≤ (𝑁‘𝐹))

Proof of Theorem nmoge0 Dummy variables 𝑟 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elrege0 13427	. . . . . 6 ⊢ (𝑟 ∈ (0[,)+∞) ↔ (𝑟 ∈ ℝ ∧ 0 ≤ 𝑟))
2	1	simprbi 497	. . . . 5 ⊢ (𝑟 ∈ (0[,)+∞) → 0 ≤ 𝑟)
3	2	adantl 482	. . . 4 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) ∧ 𝑟 ∈ (0[,)+∞)) → 0 ≤ 𝑟)
4	3	a1d 25	. . 3 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) ∧ 𝑟 ∈ (0[,)+∞)) → (∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟))
5	4	ralrimiva 3146	. 2 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → ∀𝑟 ∈ (0[,)+∞)(∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟))
6		0xr 11257	. . 3 ⊢ 0 ∈ ℝ^*
7		nmofval.1	. . . 4 ⊢ 𝑁 = (𝑆 normOp 𝑇)
8		eqid 2732	. . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆)
9		eqid 2732	. . . 4 ⊢ (norm‘𝑆) = (norm‘𝑆)
10		eqid 2732	. . . 4 ⊢ (norm‘𝑇) = (norm‘𝑇)
11	7, 8, 9, 10	nmogelb 24224	. . 3 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) ∧ 0 ∈ ℝ^*) → (0 ≤ (𝑁‘𝐹) ↔ ∀𝑟 ∈ (0[,)+∞)(∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟)))
12	6, 11	mpan2 689	. 2 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → (0 ≤ (𝑁‘𝐹) ↔ ∀𝑟 ∈ (0[,)+∞)(∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟)))
13	5, 12	mpbird 256	1 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → 0 ≤ (𝑁‘𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3061 class class class wbr 5147 ‘cfv 6540 (class class class)co 7405 ℝcr 11105 0cc0 11106 · cmul 11111 +∞cpnf 11241 ℝ^*cxr 11243 ≤ cle 11245 [,)cico 13322 Basecbs 17140 GrpHom cghm 19083 normcnm 24076 NrmGrpcngp 24077 normOp cnmo 24213

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 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 theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-1st 7971 df-2nd 7972 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-ico 13326 df-nmo 24216

This theorem is referenced by: isnghm3 24233 bddnghm 24234 nmoi 24236 nmoix 24237 nmo0 24243 nmoco 24245 nmotri 24247 nmoid 24250 nghmcn 24253 nmoleub2lem 24621

W3C validator