ovolficcss - Metamath Proof Explorer

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

Theorem ovolficcss 23045

Description: Any (closed) interval covering is a subset of the reals. (Contributed by Mario Carneiro, 24-Mar-2015.)

**Assertion**
Ref	Expression
ovolficcss	⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ∪ ran ([,] ∘ 𝐹) ⊆ ℝ)

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

Step	Hyp	Ref	Expression
1		rnco2 5559	. . 3 ⊢ ran ([,] ∘ 𝐹) = ([,] “ ran 𝐹)
2		inss2 3796	. . . . . . . . . . . 12 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
3		ffvelrn 6265	. . . . . . . . . . . 12 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → (𝐹‘𝑦) ∈ ( ≤ ∩ (ℝ × ℝ)))
4	2, 3	sseldi 3566	. . . . . . . . . . 11 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → (𝐹‘𝑦) ∈ (ℝ × ℝ))
5		1st2nd2 7096	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑦) ∈ (ℝ × ℝ) → (𝐹‘𝑦) = ⟨(1^st ‘(𝐹‘𝑦)), (2^nd ‘(𝐹‘𝑦))⟩)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → (𝐹‘𝑦) = ⟨(1^st ‘(𝐹‘𝑦)), (2^nd ‘(𝐹‘𝑦))⟩)
7	6	fveq2d 6107	. . . . . . . . 9 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → ([,]‘(𝐹‘𝑦)) = ([,]‘⟨(1^st ‘(𝐹‘𝑦)), (2^nd ‘(𝐹‘𝑦))⟩))
8		df-ov 6552	. . . . . . . . 9 ⊢ ((1^st ‘(𝐹‘𝑦))[,](2^nd ‘(𝐹‘𝑦))) = ([,]‘⟨(1^st ‘(𝐹‘𝑦)), (2^nd ‘(𝐹‘𝑦))⟩)
9	7, 8	syl6eqr 2662	. . . . . . . 8 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → ([,]‘(𝐹‘𝑦)) = ((1^st ‘(𝐹‘𝑦))[,](2^nd ‘(𝐹‘𝑦))))
10		xp1st 7089	. . . . . . . . . 10 ⊢ ((𝐹‘𝑦) ∈ (ℝ × ℝ) → (1^st ‘(𝐹‘𝑦)) ∈ ℝ)
11	4, 10	syl 17	. . . . . . . . 9 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → (1^st ‘(𝐹‘𝑦)) ∈ ℝ)
12		xp2nd 7090	. . . . . . . . . 10 ⊢ ((𝐹‘𝑦) ∈ (ℝ × ℝ) → (2^nd ‘(𝐹‘𝑦)) ∈ ℝ)
13	4, 12	syl 17	. . . . . . . . 9 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → (2^nd ‘(𝐹‘𝑦)) ∈ ℝ)
14		iccssre 12126	. . . . . . . . 9 ⊢ (((1^st ‘(𝐹‘𝑦)) ∈ ℝ ∧ (2^nd ‘(𝐹‘𝑦)) ∈ ℝ) → ((1^st ‘(𝐹‘𝑦))[,](2^nd ‘(𝐹‘𝑦))) ⊆ ℝ)
15	11, 13, 14	syl2anc 691	. . . . . . . 8 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → ((1^st ‘(𝐹‘𝑦))[,](2^nd ‘(𝐹‘𝑦))) ⊆ ℝ)
16	9, 15	eqsstrd 3602	. . . . . . 7 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → ([,]‘(𝐹‘𝑦)) ⊆ ℝ)
17		reex 9906	. . . . . . . 8 ⊢ ℝ ∈ V
18	17	elpw2 4755	. . . . . . 7 ⊢ (([,]‘(𝐹‘𝑦)) ∈ 𝒫 ℝ ↔ ([,]‘(𝐹‘𝑦)) ⊆ ℝ)
19	16, 18	sylibr 223	. . . . . 6 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑦 ∈ ℕ) → ([,]‘(𝐹‘𝑦)) ∈ 𝒫 ℝ)
20	19	ralrimiva 2949	. . . . 5 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ∀𝑦 ∈ ℕ ([,]‘(𝐹‘𝑦)) ∈ 𝒫 ℝ)
21		ffn 5958	. . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹 Fn ℕ)
22		fveq2 6103	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑦) → ([,]‘𝑥) = ([,]‘(𝐹‘𝑦)))
23	22	eleq1d 2672	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑦) → (([,]‘𝑥) ∈ 𝒫 ℝ ↔ ([,]‘(𝐹‘𝑦)) ∈ 𝒫 ℝ))
24	23	ralrn 6270	. . . . . 6 ⊢ (𝐹 Fn ℕ → (∀𝑥 ∈ ran 𝐹([,]‘𝑥) ∈ 𝒫 ℝ ↔ ∀𝑦 ∈ ℕ ([,]‘(𝐹‘𝑦)) ∈ 𝒫 ℝ))
25	21, 24	syl 17	. . . . 5 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → (∀𝑥 ∈ ran 𝐹([,]‘𝑥) ∈ 𝒫 ℝ ↔ ∀𝑦 ∈ ℕ ([,]‘(𝐹‘𝑦)) ∈ 𝒫 ℝ))
26	20, 25	mpbird 246	. . . 4 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ∀𝑥 ∈ ran 𝐹([,]‘𝑥) ∈ 𝒫 ℝ)
27		iccf 12143	. . . . . 6 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
28		ffun 5961	. . . . . 6 ⊢ ([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ → Fun [,])
29	27, 28	ax-mp 5	. . . . 5 ⊢ Fun [,]
30		frn 5966	. . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ)))
31		rexpssxrxp 9963	. . . . . . . 8 ⊢ (ℝ × ℝ) ⊆ (ℝ^* × ℝ^*)
32	2, 31	sstri 3577	. . . . . . 7 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ^* × ℝ^*)
33	27	fdmi 5965	. . . . . . 7 ⊢ dom [,] = (ℝ^* × ℝ^*)
34	32, 33	sseqtr4i 3601	. . . . . 6 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ dom [,]
35	30, 34	syl6ss 3580	. . . . 5 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ran 𝐹 ⊆ dom [,])
36		funimass4 6157	. . . . 5 ⊢ ((Fun [,] ∧ ran 𝐹 ⊆ dom [,]) → (([,] “ ran 𝐹) ⊆ 𝒫 ℝ ↔ ∀𝑥 ∈ ran 𝐹([,]‘𝑥) ∈ 𝒫 ℝ))
37	29, 35, 36	sylancr 694	. . . 4 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → (([,] “ ran 𝐹) ⊆ 𝒫 ℝ ↔ ∀𝑥 ∈ ran 𝐹([,]‘𝑥) ∈ 𝒫 ℝ))
38	26, 37	mpbird 246	. . 3 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ([,] “ ran 𝐹) ⊆ 𝒫 ℝ)
39	1, 38	syl5eqss 3612	. 2 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ran ([,] ∘ 𝐹) ⊆ 𝒫 ℝ)
40		sspwuni 4547	. 2 ⊢ (ran ([,] ∘ 𝐹) ⊆ 𝒫 ℝ ↔ ∪ ran ([,] ∘ 𝐹) ⊆ ℝ)
41	39, 40	sylib 207	1 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ∪ ran ([,] ∘ 𝐹) ⊆ ℝ)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ∩ cin 3539 ⊆ wss 3540 𝒫 cpw 4108 ⟨cop 4131 ∪ cuni 4372 × cxp 5036 dom cdm 5038 ran crn 5039 “ cima 5041 ∘ ccom 5042 Fun wfun 5798 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 1^st c1st 7057 2^nd c2nd 7058 ℝcr 9814 ℝ^*cxr 9952 ≤ cle 9954 ℕcn 10897 [,]cicc 12049

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-pre-lttri 9889 ax-pre-lttrn 9890

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-icc 12053

This theorem is referenced by: ovollb2lem 23063 ovollb2 23064 uniiccdif 23152 uniiccvol 23154 uniioombllem3 23159 uniioombllem4 23160 uniioombllem5 23161 uniiccmbl 23164

W3C validator