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 24458

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 13435	. . . . . 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 11265	. . 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 24453	. . 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 5148 ‘cfv 6543 (class class class)co 7411 ℝcr 11111 0cc0 11112 · cmul 11117 +∞cpnf 11249 ℝ^*cxr 11251 ≤ cle 11253 [,)cico 13330 Basecbs 17148 GrpHom cghm 19127 normcnm 24305 NrmGrpcngp 24306 normOp cnmo 24442

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 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

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 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-po 5588 df-so 5589 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7977 df-2nd 7978 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-ico 13334 df-nmo 24445

This theorem is referenced by: isnghm3 24462 bddnghm 24463 nmoi 24465 nmoix 24466 nmo0 24472 nmoco 24474 nmotri 24476 nmoid 24479 nghmcn 24482 nmoleub2lem 24854

W3C validator