Theorem ovolsslem 25469

Description: Lemma for ovolss 25470. (Contributed by Mario Carneiro, 16-Mar-2014.) (Proof shortened by AV, 17-Sep-2020.)

Hypotheses

Ref	Expression
ovolss.1	⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
ovolss.2	⊢ 𝑁 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}

Assertion

Ref	Expression
ovolsslem	⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → (vol*‘𝐴) ≤ (vol*‘𝐵))

Distinct variable groups:   𝑦,𝑓,𝐴   𝐵,𝑓,𝑦

Allowed substitution hints:   𝑀(𝑦,𝑓)   𝑁(𝑦,𝑓)

Proof of Theorem ovolsslem

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sstr2 3922	. . . . . . . . 9 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) → 𝐴 ⊆ ∪ ran ((,) ∘ 𝑓)))
2	1	ad2antrr 732	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) ∧ 𝑦 ∈ ℝ*) → (𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) → 𝐴 ⊆ ∪ ran ((,) ∘ 𝑓)))
3	2	anim1d 617	. . . . . . 7 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) ∧ 𝑦 ∈ ℝ*) → ((𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
4	3	reximdv 3154	. . . . . 6 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) ∧ 𝑦 ∈ ℝ*) → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) → ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
5	4	ss2rabdv 4006	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} ⊆ {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))})
6		ovolss.2	. . . . 5 ⊢ 𝑁 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
7		ovolss.1	. . . . 5 ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
8	5, 6, 7	3sstr4g 3968	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → 𝑁 ⊆ 𝑀)
9		sstr 3923	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → 𝐴 ⊆ ℝ)
10	7	ovolval 25458	. . . . . . . 8 ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
11	10	adantr 481	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝑀) → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
12	7	ssrab3 4013	. . . . . . . . 9 ⊢ 𝑀 ⊆ ℝ*
13		infxrlb 13278	. . . . . . . . 9 ⊢ ((𝑀 ⊆ ℝ* ∧ 𝑥 ∈ 𝑀) → inf(𝑀, ℝ*, < ) ≤ 𝑥)
14	12, 13	mpan 696	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑀 → inf(𝑀, ℝ*, < ) ≤ 𝑥)
15	14	adantl 482	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝑀) → inf(𝑀, ℝ*, < ) ≤ 𝑥)
16	11, 15	eqbrtrd 5094	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝑀) → (vol*‘𝐴) ≤ 𝑥)
17	16	ralrimiva 3131	. . . . 5 ⊢ (𝐴 ⊆ ℝ → ∀𝑥 ∈ 𝑀 (vol*‘𝐴) ≤ 𝑥)
18	9, 17	syl 17	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → ∀𝑥 ∈ 𝑀 (vol*‘𝐴) ≤ 𝑥)
19		ssralv 3983	. . . 4 ⊢ (𝑁 ⊆ 𝑀 → (∀𝑥 ∈ 𝑀 (vol*‘𝐴) ≤ 𝑥 → ∀𝑥 ∈ 𝑁 (vol*‘𝐴) ≤ 𝑥))
20	8, 18, 19	sylc 65	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → ∀𝑥 ∈ 𝑁 (vol*‘𝐴) ≤ 𝑥)
21	6	ssrab3 4013	. . . 4 ⊢ 𝑁 ⊆ ℝ*
22		ovolcl 25463	. . . . 5 ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) ∈ ℝ*)
23	9, 22	syl 17	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → (vol*‘𝐴) ∈ ℝ*)
24		infxrgelb 13279	. . . 4 ⊢ ((𝑁 ⊆ ℝ* ∧ (vol*‘𝐴) ∈ ℝ*) → ((vol*‘𝐴) ≤ inf(𝑁, ℝ*, < ) ↔ ∀𝑥 ∈ 𝑁 (vol*‘𝐴) ≤ 𝑥))
25	21, 23, 24	sylancr 593	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → ((vol*‘𝐴) ≤ inf(𝑁, ℝ*, < ) ↔ ∀𝑥 ∈ 𝑁 (vol*‘𝐴) ≤ 𝑥))
26	20, 25	mpbird 258	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → (vol*‘𝐴) ≤ inf(𝑁, ℝ*, < ))
27	6	ovolval 25458	. . 3 ⊢ (𝐵 ⊆ ℝ → (vol*‘𝐵) = inf(𝑁, ℝ*, < ))
28	27	adantl 482	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → (vol*‘𝐵) = inf(𝑁, ℝ*, < ))
29	26, 28	breqtrrd 5100	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ) → (vol*‘𝐴) ≤ (vol*‘𝐵))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  ∀wral 3053  ∃wrex 3063  {crab 3391   ∩ cin 3882   ⊆ wss 3883  ∪ cuni 4838   class class class wbr 5072   × cxp 5616  ran crn 5619   ∘ ccom 5622  ‘cfv 6485  (class class class)co 7356   ↑_m cmap 8763  supcsup 9343  infcinf 9344  ℝcr 11028  1c1 11030   + caddc 11032  ℝ^*cxr 11169   < clt 11170   ≤ cle 11171   − cmin 11368  ℕcn 12165  (,)cioo 13289  seqcseq 13954  abscabs 15187  vol*covol 25447

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-pre-sup 11107

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-po 5526  df-so 5527  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-sup 9345  df-inf 9346  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-ovol 25449

This theorem is referenced by:  ovolss  25470