ovolge0 - Metamath Proof Explorer

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

Theorem ovolge0 25456

Description: The volume of a set is always nonnegative. (Contributed by Mario Carneiro, 16-Mar-2014.)

**Assertion**
Ref	Expression
ovolge0	⊢ (𝐴 ⊆ ℝ → 0 ≤ (vol*‘𝐴))

Proof of Theorem ovolge0 Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4021	. . . 4 ⊢ {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))} ⊆ ℝ^
2		0xr 11181	. . . 4 ⊢ 0 ∈ ℝ^*
3		infxrgelb 13277	. . . 4 ⊢ (({𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))} ⊆ ℝ^ ∧ 0 ∈ ℝ^) → (0 ≤ inf({𝑦 ∈ ℝ^ ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))}, ℝ^, < ) ↔ ∀𝑥 ∈ {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))}0 ≤ 𝑥))
4	1, 2, 3	mp2an 693	. . 3 ⊢ (0 ≤ inf({𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))}, ℝ^, < ) ↔ ∀𝑥 ∈ {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))}0 ≤ 𝑥)
5		eqid 2737	. . . 4 ⊢ {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))} = {𝑦 ∈ ℝ^ ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))}
6	5	ovolmge0 25452	. . 3 ⊢ (𝑥 ∈ {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))} → 0 ≤ 𝑥)
7	4, 6	mprgbir 3059	. 2 ⊢ 0 ≤ inf({𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))}, ℝ^, < )
8	5	ovolval 25448	. 2 ⊢ (𝐴 ⊆ ℝ → (vol‘𝐴) = inf({𝑦 ∈ ℝ^ ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))}, ℝ^, < ))
9	7, 8	breqtrrid 5124	1 ⊢ (𝐴 ⊆ ℝ → 0 ≤ (vol*‘𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 {crab 3390 ∩ cin 3889 ⊆ wss 3890 ∪ cuni 4851 class class class wbr 5086 × cxp 5620 ran crn 5623 ∘ ccom 5626 ‘cfv 6490 (class class class)co 7358 ↑_m cmap 8764 supcsup 9344 infcinf 9345 ℝcr 11026 0cc0 11027 1c1 11028 + caddc 11030 ℝ^*cxr 11167 < clt 11168 ≤ cle 11169 − cmin 11366 ℕcn 12163 (,)cioo 13287 seqcseq 13952 abscabs 15185 vol*covol 25437

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 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-pre-sup 11105

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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-er 8634 df-map 8766 df-en 8885 df-dom 8886 df-sdom 8887 df-sup 9346 df-inf 9347 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12164 df-2 12233 df-3 12234 df-n0 12427 df-z 12514 df-uz 12778 df-rp 12932 df-ico 13293 df-fz 13451 df-seq 13953 df-exp 14013 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-ovol 25439

This theorem is referenced by: ovolf 25457 ovollecl 25458 ovolssnul 25462 ovolctb 25465 ovolunnul 25475 ovoliun2 25481 ovoliunnul 25482 ovolicopnf 25499 voliunlem3 25527 volsup 25531 ioorcl2 25547 vitalilem4 25586 vitalilem5 25587 itg1ge0 25661 itg1ge0a 25686 itgulm 26384 areaf 26936 mblfinlem3 37984 mblfinlem4 37985 ismblfin 37986 ovoliunnfl 37987 volsupnfl 37990 itg2addnclem 37996 volge0 46397

W3C validator