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 24677

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 13382	. . . . . 6 ⊢ (𝑟 ∈ (0[,)+∞) ↔ (𝑟 ∈ ℝ ∧ 0 ≤ 𝑟))
2	1	simprbi 497	. . . . 5 ⊢ (𝑟 ∈ (0[,)+∞) → 0 ≤ 𝑟)
3	2	adantl 481	. . . 4 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) ∧ 𝑟 ∈ (0[,)+∞)) → 0 ≤ 𝑟)
4	3	a1d 25	. . 3 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) ∧ 𝑟 ∈ (0[,)+∞)) → (∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟))
5	4	ralrimiva 3130	. 2 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → ∀𝑟 ∈ (0[,)+∞)(∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟))
6		0xr 11191	. . 3 ⊢ 0 ∈ ℝ^*
7		nmofval.1	. . . 4 ⊢ 𝑁 = (𝑆 normOp 𝑇)
8		eqid 2737	. . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆)
9		eqid 2737	. . . 4 ⊢ (norm‘𝑆) = (norm‘𝑆)
10		eqid 2737	. . . 4 ⊢ (norm‘𝑇) = (norm‘𝑇)
11	7, 8, 9, 10	nmogelb 24672	. . 3 ⊢ (((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) ∧ 0 ∈ ℝ^*) → (0 ≤ (𝑁‘𝐹) ↔ ∀𝑟 ∈ (0[,)+∞)(∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟)))
12	6, 11	mpan2 692	. 2 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → (0 ≤ (𝑁‘𝐹) ↔ ∀𝑟 ∈ (0[,)+∞)(∀𝑥 ∈ (Base‘𝑆)((norm‘𝑇)‘(𝐹‘𝑥)) ≤ (𝑟 · ((norm‘𝑆)‘𝑥)) → 0 ≤ 𝑟)))
13	5, 12	mpbird 257	1 ⊢ ((𝑆 ∈ NrmGrp ∧ 𝑇 ∈ NrmGrp ∧ 𝐹 ∈ (𝑆 GrpHom 𝑇)) → 0 ≤ (𝑁‘𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 0cc0 11038 · cmul 11043 +∞cpnf 11175 ℝ^*cxr 11177 ≤ cle 11179 [,)cico 13275 Basecbs 17148 GrpHom cghm 19153 normcnm 24532 NrmGrpcngp 24533 normOp cnmo 24661

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9357 df-inf 9358 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-ico 13279 df-nmo 24664

This theorem is referenced by: isnghm3 24681 bddnghm 24682 nmoi 24684 nmoix 24685 nmo0 24691 nmoco 24693 nmotri 24695 nmoid 24698 nghmcn 24701 nmoleub2lem 25082

W3C validator