elovolm - Metamath Proof Explorer

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

Theorem elovolm 25665

Description: Elementhood in the set 𝑀 of approximations to the outer measure. (Contributed by Mario Carneiro, 16-Mar-2014.)

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

**Assertion**
Ref	Expression
elovolm	⊢ (𝐵 ∈ 𝑀 ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < )))

Distinct variable groups: 𝐵,𝑓,𝑦 𝑦,𝐴 Allowed substitution hints: 𝐴(𝑓) 𝑀(𝑦, 𝑓)

**Proof of Theorem elovolm**
Step	Hyp	Ref	Expression
1		eqeq1 2769	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ) ↔ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )))
2	1	anbi2d 642	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))))
3	2	rexbidv 3191	. . 3 ⊢ (𝑦 = 𝐵 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))))
4		elovolm.1	. . 3 ⊢ 𝑀 = {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))}
5	3, 4	elrab2 3656	. 2 ⊢ (𝐵 ∈ 𝑀 ↔ (𝐵 ∈ ℝ^* ∧ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))))
6		elovolmlem 25664	. . . . . . . . . 10 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ↔ 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
7		eqid 2765	. . . . . . . . . . 11 ⊢ ((abs ∘ − ) ∘ 𝑓) = ((abs ∘ − ) ∘ 𝑓)
8		eqid 2765	. . . . . . . . . . 11 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))
9	7, 8	ovolsf 25662	. . . . . . . . . 10 ⊢ (𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶(0[,)+∞))
10	6, 9	sylbi 220	. . . . . . . . 9 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶(0[,)+∞))
11		icossxr 13471	. . . . . . . . 9 ⊢ (0[,)+∞) ⊆ ℝ^*
12		fss 6726	. . . . . . . . 9 ⊢ ((seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶(0[,)+∞) ∧ (0[,)+∞) ⊆ ℝ^) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶ℝ^)
13	10, 11, 12	sylancl 598	. . . . . . . 8 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) → seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶ℝ^*)
14		frn 6717	. . . . . . . 8 ⊢ (seq1( + , ((abs ∘ − ) ∘ 𝑓)):ℕ⟶ℝ^* → ran seq1( + , ((abs ∘ − ) ∘ 𝑓)) ⊆ ℝ^*)
15		supxrcl 13353	. . . . . . . 8 ⊢ (ran seq1( + , ((abs ∘ − ) ∘ 𝑓)) ⊆ ℝ^* → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ) ∈ ℝ^)
16	13, 14, 15	3syl 19	. . . . . . 7 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) → sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ) ∈ ℝ^)
17		eleq1 2853	. . . . . . 7 ⊢ (𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ) → (𝐵 ∈ ℝ^ ↔ sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ) ∈ ℝ^))
18	16, 17	syl5ibrcom 250	. . . . . 6 ⊢ (𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) → (𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ) → 𝐵 ∈ ℝ^))
19	18	imp 412	. . . . 5 ⊢ ((𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) → 𝐵 ∈ ℝ^)
20	19	adantrl 729	. . . 4 ⊢ ((𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))) → 𝐵 ∈ ℝ^)
21	20	rexlimiva 3160	. . 3 ⊢ (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) → 𝐵 ∈ ℝ^)
22	21	pm4.71ri 570	. 2 ⊢ (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) ↔ (𝐵 ∈ ℝ^ ∧ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))))
23	5, 22	bitr4i 281	1 ⊢ (𝐵 ∈ 𝑀 ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝐵 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < )))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 {crab 3418 ∩ cin 3905 ⊆ wss 3906 ∪ cuni 4874 × cxp 5661 ran crn 5664 ∘ ccom 5667 ⟶wf 6536 (class class class)co 7416 ↑_m cmap 8826 supcsup 9403 ℝcr 11110 0cc0 11111 1c1 11112 + caddc 11114 +∞cpnf 11251 ℝ^*cxr 11253 < clt 11254 ≤ cle 11255 − cmin 11452 ℕcn 12244 (,)cioo 13384 [,)cico 13386 seqcseq 14051 abscabs 15305

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-sup 9405 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-n0 12516 df-z 12603 df-uz 12875 df-rp 13029 df-ico 13390 df-fz 13548 df-seq 14052 df-exp 14112 df-cj 15170 df-re 15171 df-im 15172 df-sqrt 15306 df-abs 15307

This theorem is used by: elovolmr 25666 ovolmge0 25667 ovolicc2 25712

W3C validator