ovolval4lem2 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ovolval4lem2		Structured version Visualization version GIF version

Theorem ovolval4lem2 47384

Description: The value of the Lebesgue outer measure for subsets of the reals. Similar to ovolval3 47381, but here 𝑓 is may represent unordered interval bounds. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

**Hypotheses**
Ref	Expression
ovolval4lem2.a	⊢ (𝜑 → 𝐴 ⊆ ℝ)
ovolval4lem2.m	⊢ 𝑀 = {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))}
ovolval4lem2.g	⊢ 𝐺 = (𝑛 ∈ ℕ ↦ ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩)

**Assertion**
Ref	Expression
ovolval4lem2	⊢ (𝜑 → (vol‘𝐴) = inf(𝑀, ℝ^, < ))

Distinct variable groups: 𝐴,𝑓,𝑦 𝑛,𝐺 𝑓,𝑛 𝜑,𝑦 Allowed substitution hints: 𝜑(𝑓,𝑛) 𝐴(𝑛) 𝐺(𝑦,𝑓) 𝑀(𝑦,𝑓,𝑛)

Proof of Theorem ovolval4lem2 Dummy variables 𝑔 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovolval4lem2.a	. 2 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
2		ovolval4lem2.m	. . 3 ⊢ 𝑀 = {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))}
3		iftrue 4493	. . . . . . . . . . . . . . 15 ⊢ ((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)) → if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))) = (2^nd ‘(𝑓‘𝑛)))
4	3	opeq2d 4845	. . . . . . . . . . . . . 14 ⊢ ((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ = ⟨(1^st ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛))⟩)
5	4	adantl 486	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) ∧ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ = ⟨(1^st ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛))⟩)
6		df-br 5110	. . . . . . . . . . . . . 14 ⊢ ((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)) ↔ ⟨(1^st ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛))⟩ ∈ ≤ )
7	6	bilani 509	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) ∧ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))) → ⟨(1^st ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛))⟩ ∈ ≤ )
8	5, 7	eqeltrd 2863	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) ∧ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ ∈ ≤ )
9		iffalse 4496	. . . . . . . . . . . . . . 15 ⊢ (¬ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)) → if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))) = (1^st ‘(𝑓‘𝑛)))
10	9	opeq2d 4845	. . . . . . . . . . . . . 14 ⊢ (¬ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ = ⟨(1^st ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))⟩)
11	10	adantl 486	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) ∧ ¬ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ = ⟨(1^st ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))⟩)
12		elmapi 8842	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → 𝑓:ℕ⟶(ℝ × ℝ))
13	12	ffvelcdmda 7079	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → (𝑓‘𝑛) ∈ (ℝ × ℝ))
14		xp1st 8014	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓‘𝑛) ∈ (ℝ × ℝ) → (1^st ‘(𝑓‘𝑛)) ∈ ℝ)
15	13, 14	syl 18	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝑓‘𝑛)) ∈ ℝ)
16	15	leidd 11775	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝑓‘𝑛)) ≤ (1^st ‘(𝑓‘𝑛)))
17		df-br 5110	. . . . . . . . . . . . . . 15 ⊢ ((1^st ‘(𝑓‘𝑛)) ≤ (1^st ‘(𝑓‘𝑛)) ↔ ⟨(1^st ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))⟩ ∈ ≤ )
18	16, 17	sylib 221	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → ⟨(1^st ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))⟩ ∈ ≤ )
19	18	adantr 485	. . . . . . . . . . . . 13 ⊢ (((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) ∧ ¬ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))) → ⟨(1^st ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))⟩ ∈ ≤ )
20	11, 19	eqeltrd 2863	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) ∧ ¬ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ ∈ ≤ )
21	8, 20	pm2.61dan 824	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ ∈ ≤ )
22		xp2nd 8015	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑛) ∈ (ℝ × ℝ) → (2^nd ‘(𝑓‘𝑛)) ∈ ℝ)
23	13, 22	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → (2^nd ‘(𝑓‘𝑛)) ∈ ℝ)
24	23, 15	ifcld 4534	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))) ∈ ℝ)
25		opelxpi 5698	. . . . . . . . . . . 12 ⊢ (((1^st ‘(𝑓‘𝑛)) ∈ ℝ ∧ if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛))) ∈ ℝ) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ ∈ (ℝ × ℝ))
26	15, 24, 25	syl2anc 595	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ ∈ (ℝ × ℝ))
27	21, 26	elind 4153	. . . . . . . . . 10 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑛 ∈ ℕ) → ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
28		ovolval4lem2.g	. . . . . . . . . 10 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ ⟨(1^st ‘(𝑓‘𝑛)), if((1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛)), (2^nd ‘(𝑓‘𝑛)), (1^st ‘(𝑓‘𝑛)))⟩)
29	27, 28	fmptd 7109	. . . . . . . . 9 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
30		reex 11186	. . . . . . . . . . . . 13 ⊢ ℝ ∈ V
31	30, 30	xpex 7748	. . . . . . . . . . . 12 ⊢ (ℝ × ℝ) ∈ V
32	31	inex2 5287	. . . . . . . . . . 11 ⊢ ( ≤ ∩ (ℝ × ℝ)) ∈ V
33	32	a1i 11	. . . . . . . . . 10 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → ( ≤ ∩ (ℝ × ℝ)) ∈ V)
34		nnex 12234	. . . . . . . . . . 11 ⊢ ℕ ∈ V
35	34	a1i 11	. . . . . . . . . 10 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → ℕ ∈ V)
36	33, 35	elmapd 8833	. . . . . . . . 9 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → (𝐺 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ↔ 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ))))
37	29, 36	mpbird 260	. . . . . . . 8 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → 𝐺 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ))
38	37	adantr 485	. . . . . . 7 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))) → 𝐺 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ))
39		simpr 489	. . . . . . . . . 10 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝑓)) → 𝐴 ⊆ ∪ ran ((,) ∘ 𝑓))
40		rexpssxrxp 11249	. . . . . . . . . . . . . . 15 ⊢ (ℝ × ℝ) ⊆ (ℝ^* × ℝ^*)
41	40	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → (ℝ × ℝ) ⊆ (ℝ^* × ℝ^*))
42	12, 41	fssd 6723	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → 𝑓:ℕ⟶(ℝ^* × ℝ^*))
43		2fveq3 6886	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑛 → (1^st ‘(𝑓‘𝑘)) = (1^st ‘(𝑓‘𝑛)))
44		2fveq3 6886	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑛 → (2^nd ‘(𝑓‘𝑘)) = (2^nd ‘(𝑓‘𝑛)))
45	43, 44	breq12d 5122	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑛 → ((1^st ‘(𝑓‘𝑘)) ≤ (2^nd ‘(𝑓‘𝑘)) ↔ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))))
46	45	cbvrabv 3426	. . . . . . . . . . . . 13 ⊢ {𝑘 ∈ ℕ ∣ (1^st ‘(𝑓‘𝑘)) ≤ (2^nd ‘(𝑓‘𝑘))} = {𝑛 ∈ ℕ ∣ (1^st ‘(𝑓‘𝑛)) ≤ (2^nd ‘(𝑓‘𝑛))}
47	42, 28, 46	ovolval4lem1 47383	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → (∪ ran ((,) ∘ 𝑓) = ∪ ran ((,) ∘ 𝐺) ∧ (vol ∘ ((,) ∘ 𝑓)) = (vol ∘ ((,) ∘ 𝐺))))
48	47	simpld 499	. . . . . . . . . . 11 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → ∪ ran ((,) ∘ 𝑓) = ∪ ran ((,) ∘ 𝐺))
49	48	adantr 485	. . . . . . . . . 10 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝑓)) → ∪ ran ((,) ∘ 𝑓) = ∪ ran ((,) ∘ 𝐺))
50	39, 49	sseqtrd 3973	. . . . . . . . 9 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝑓)) → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐺))
51	50	adantrr 729	. . . . . . . 8 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))) → 𝐴 ⊆ ∪ ran ((,) ∘ 𝐺))
52		simpr 489	. . . . . . . . . 10 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))) → 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))
53	47	simprd 500	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → (vol ∘ ((,) ∘ 𝑓)) = (vol ∘ ((,) ∘ 𝐺)))
54		coass 6267	. . . . . . . . . . . . . 14 ⊢ ((vol ∘ (,)) ∘ 𝑓) = (vol ∘ ((,) ∘ 𝑓))
55	54	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → ((vol ∘ (,)) ∘ 𝑓) = (vol ∘ ((,) ∘ 𝑓)))
56		coass 6267	. . . . . . . . . . . . . 14 ⊢ ((vol ∘ (,)) ∘ 𝐺) = (vol ∘ ((,) ∘ 𝐺))
57	56	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → ((vol ∘ (,)) ∘ 𝐺) = (vol ∘ ((,) ∘ 𝐺)))
58	53, 55, 57	3eqtr4d 2808	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → ((vol ∘ (,)) ∘ 𝑓) = ((vol ∘ (,)) ∘ 𝐺))
59	58	fveq2d 6885	. . . . . . . . . . 11 ⊢ (𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) → (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)) = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))
60	59	adantr 485	. . . . . . . . . 10 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))) → (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)) = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))
61	52, 60	eqtrd 2798	. . . . . . . . 9 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))) → 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))
62	61	adantrl 728	. . . . . . . 8 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))) → 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))
63	51, 62	jca 520	. . . . . . 7 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝐺) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺))))
64		coeq2 5844	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → ((,) ∘ 𝑔) = ((,) ∘ 𝐺))
65	64	rneqd 5928	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → ran ((,) ∘ 𝑔) = ran ((,) ∘ 𝐺))
66	65	unieqd 4885	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → ∪ ran ((,) ∘ 𝑔) = ∪ ran ((,) ∘ 𝐺))
67	66	sseq2d 3969	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ↔ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐺)))
68		coeq2 5844	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → ((vol ∘ (,)) ∘ 𝑔) = ((vol ∘ (,)) ∘ 𝐺))
69	68	fveq2d 6885	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)) = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))
70	69	eqeq2d 2774	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)) ↔ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺))))
71	67, 70	anbi12d 643	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝐺) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))))
72	71	rspcev 3581	. . . . . . 7 ⊢ ((𝐺 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝐺) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝐺)))) → ∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))))
73	38, 63, 72	syl2anc 595	. . . . . 6 ⊢ ((𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))) → ∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))))
74	73	rexlimiva 3158	. . . . 5 ⊢ (∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))) → ∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))))
75		inss2 4190	. . . . . . . . . 10 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
76		mapss 8883	. . . . . . . . . 10 ⊢ (((ℝ × ℝ) ∈ V ∧ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)) → (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ⊆ ((ℝ × ℝ) ↑_m ℕ))
77	31, 75, 76	mp2an 704	. . . . . . . . 9 ⊢ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ⊆ ((ℝ × ℝ) ↑_m ℕ)
78	77	sseli 3933	. . . . . . . 8 ⊢ (𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) → 𝑔 ∈ ((ℝ × ℝ) ↑_m ℕ))
79	78	adantr 485	. . . . . . 7 ⊢ ((𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))) → 𝑔 ∈ ((ℝ × ℝ) ↑_m ℕ))
80		simpr 489	. . . . . . 7 ⊢ ((𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))) → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))))
81		coeq2 5844	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((,) ∘ 𝑓) = ((,) ∘ 𝑔))
82	81	rneqd 5928	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ran ((,) ∘ 𝑓) = ran ((,) ∘ 𝑔))
83	82	unieqd 4885	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → ∪ ran ((,) ∘ 𝑓) = ∪ ran ((,) ∘ 𝑔))
84	83	sseq2d 3969	. . . . . . . . 9 ⊢ (𝑓 = 𝑔 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ↔ 𝐴 ⊆ ∪ ran ((,) ∘ 𝑔)))
85		coeq2 5844	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((vol ∘ (,)) ∘ 𝑓) = ((vol ∘ (,)) ∘ 𝑔))
86	85	fveq2d 6885	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)) = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))
87	86	eqeq2d 2774	. . . . . . . . 9 ⊢ (𝑓 = 𝑔 → (𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)) ↔ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))))
88	84, 87	anbi12d 643	. . . . . . . 8 ⊢ (𝑓 = 𝑔 → ((𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))))
89	88	rspcev 3581	. . . . . . 7 ⊢ ((𝑔 ∈ ((ℝ × ℝ) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))) → ∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))))
90	79, 80, 89	syl2anc 595	. . . . . 6 ⊢ ((𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ) ∧ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))) → ∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))))
91	90	rexlimiva 3158	. . . . 5 ⊢ (∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))) → ∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))))
92	74, 91	impbii 212	. . . 4 ⊢ (∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓))) ↔ ∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔))))
93	92	rabbii 3421	. . 3 ⊢ {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ ((ℝ × ℝ) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑓)))} = {𝑦 ∈ ℝ^* ∣ ∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))}
94	2, 93	eqtri 2786	. 2 ⊢ 𝑀 = {𝑦 ∈ ℝ^* ∣ ∃𝑔 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑔) ∧ 𝑦 = (Σ^{^}‘((vol ∘ (,)) ∘ 𝑔)))}
95	1, 94	ovolval3 47381	1 ⊢ (𝜑 → (vol‘𝐴) = inf(𝑀, ℝ^, < ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 {crab 3416 Vcvv 3455 ∩ cin 3904 ⊆ wss 3905 ifcif 4487 ⟨cop 4595 ∪ cuni 4872 class class class wbr 5109 ↦ cmpt 5192 × cxp 5659 ran crn 5662 ∘ ccom 5665 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 1^st c1st 7980 2^nd c2nd 7981 ↑_m cmap 8820 infcinf 9397 ℝcr 11094 ℝ^*cxr 11237 < clt 11238 ≤ cle 11239 ℕcn 12228 (,)cioo 13367 vol*covol 25621 volcvol 25622 Σ^{^}csumge0 47096

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9606 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fi 9367 df-sup 9398 df-inf 9399 df-oi 9468 df-dju 9883 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-z 12587 df-uz 12858 df-q 12968 df-rp 13012 df-xneg 13132 df-xadd 13133 df-xmul 13134 df-ioo 13371 df-ico 13373 df-icc 13374 df-fz 13531 df-fzo 13679 df-fl 13821 df-seq 14034 df-exp 14094 df-hash 14363 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-clim 15535 df-rlim 15536 df-sum 15734 df-rest 17470 df-topgen 17491 df-psmet 21514 df-xmet 21515 df-met 21516 df-bl 21517 df-mopn 21518 df-top 23051 df-topon 23068 df-bases 23103 df-cmp 23544 df-ovol 25623 df-vol 25624 df-sumge0 47097

This theorem is referenced by: ovolval4 47385

W3C validator