ovolficc - Metamath Proof Explorer

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

Theorem ovolficc 25696

Description: Unpack the interval covering property using closed intervals. (Contributed by Mario Carneiro, 16-Mar-2014.)

**Assertion**
Ref	Expression
ovolficc	⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ ran ([,] ∘ 𝐹) ↔ ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))

Distinct variable groups: 𝑧,𝑛,𝐴 𝑛,𝐹,𝑧

**Proof of Theorem ovolficc**
Step	Hyp	Ref	Expression
1		iccf 13501	. . . . . 6 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
2		inss2 4183	. . . . . . . 8 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
3		rexpssxrxp 11278	. . . . . . . 8 ⊢ (ℝ × ℝ) ⊆ (ℝ^* × ℝ^*)
4	2, 3	sstri 3940	. . . . . . 7 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ^* × ℝ^*)
5		fss 6719	. . . . . . 7 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ^* × ℝ^)) → 𝐹:ℕ⟶(ℝ^ × ℝ^*))
6	4, 5	mpan2 704	. . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹:ℕ⟶(ℝ^* × ℝ^*))
7		fco 6727	. . . . . 6 ⊢ (([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ ∧ 𝐹:ℕ⟶(ℝ^* × ℝ^)) → ([,] ∘ 𝐹):ℕ⟶𝒫 ℝ^)
8	1, 6, 7	sylancr 599	. . . . 5 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ([,] ∘ 𝐹):ℕ⟶𝒫 ℝ^*)
9		ffn 6702	. . . . 5 ⊢ (([,] ∘ 𝐹):ℕ⟶𝒫 ℝ^* → ([,] ∘ 𝐹) Fn ℕ)
10		fniunfv 7244	. . . . 5 ⊢ (([,] ∘ 𝐹) Fn ℕ → ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) = ∪ ran ([,] ∘ 𝐹))
11	8, 9, 10	3syl 19	. . . 4 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) = ∪ ran ([,] ∘ 𝐹))
12	11	sseq2d 3963	. . 3 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → (𝐴 ⊆ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ 𝐴 ⊆ ∪ ran ([,] ∘ 𝐹)))
13	12	adantl 487	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ 𝐴 ⊆ ∪ ran ([,] ∘ 𝐹)))
14		dfss3 3920	. . 3 ⊢ (𝐴 ⊆ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∀𝑧 ∈ 𝐴 𝑧 ∈ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛))
15		ssel2 3926	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ ℝ)
16		eliun 4955	. . . . . . 7 ⊢ (𝑧 ∈ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ 𝑧 ∈ (([,] ∘ 𝐹)‘𝑛))
17		simpll 779	. . . . . . . . 9 ⊢ (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → 𝑧 ∈ ℝ)
18		fvco3 6978	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (([,] ∘ 𝐹)‘𝑛) = ([,]‘(𝐹‘𝑛)))
19		ffvelcdm 7074	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ∈ ( ≤ ∩ (ℝ × ℝ)))
20	19	elin2d 4151	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ∈ (ℝ × ℝ))
21		1st2nd2 8025	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹‘𝑛) ∈ (ℝ × ℝ) → (𝐹‘𝑛) = ⟨(1^st ‘(𝐹‘𝑛)), (2^nd ‘(𝐹‘𝑛))⟩)
22	20, 21	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) = ⟨(1^st ‘(𝐹‘𝑛)), (2^nd ‘(𝐹‘𝑛))⟩)
23	22	fveq2d 6882	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ([,]‘(𝐹‘𝑛)) = ([,]‘⟨(1^st ‘(𝐹‘𝑛)), (2^nd ‘(𝐹‘𝑛))⟩))
24		df-ov 7416	. . . . . . . . . . . . . 14 ⊢ ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))) = ([,]‘⟨(1^st ‘(𝐹‘𝑛)), (2^nd ‘(𝐹‘𝑛))⟩)
25	23, 24	eqtr4di 2813	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ([,]‘(𝐹‘𝑛)) = ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))))
26	18, 25	eqtrd 2795	. . . . . . . . . . . 12 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (([,] ∘ 𝐹)‘𝑛) = ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))))
27	26	eleq2d 2846	. . . . . . . . . . 11 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (([,] ∘ 𝐹)‘𝑛) ↔ 𝑧 ∈ ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛)))))
28		ovolfcl 25694	. . . . . . . . . . . 12 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1^st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2^nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1^st ‘(𝐹‘𝑛)) ≤ (2^nd ‘(𝐹‘𝑛))))
29		elicc2 13464	. . . . . . . . . . . . . 14 ⊢ (((1^st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2^nd ‘(𝐹‘𝑛)) ∈ ℝ) → (𝑧 ∈ ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))) ↔ (𝑧 ∈ ℝ ∧ (1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
30		3anass 1111	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ ℝ ∧ (1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛))) ↔ (𝑧 ∈ ℝ ∧ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
31	29, 30	bitrdi 290	. . . . . . . . . . . . 13 ⊢ (((1^st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2^nd ‘(𝐹‘𝑛)) ∈ ℝ) → (𝑧 ∈ ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))) ↔ (𝑧 ∈ ℝ ∧ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛))))))
32	31	3adant3 1150	. . . . . . . . . . . 12 ⊢ (((1^st ‘(𝐹‘𝑛)) ∈ ℝ ∧ (2^nd ‘(𝐹‘𝑛)) ∈ ℝ ∧ (1^st ‘(𝐹‘𝑛)) ≤ (2^nd ‘(𝐹‘𝑛))) → (𝑧 ∈ ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))) ↔ (𝑧 ∈ ℝ ∧ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛))))))
33	28, 32	syl 18	. . . . . . . . . . 11 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ ((1^st ‘(𝐹‘𝑛))[,](2^nd ‘(𝐹‘𝑛))) ↔ (𝑧 ∈ ℝ ∧ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛))))))
34	27, 33	bitrd 282	. . . . . . . . . 10 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (([,] ∘ 𝐹)‘𝑛) ↔ (𝑧 ∈ ℝ ∧ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛))))))
35	34	adantll 727	. . . . . . . . 9 ⊢ (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (([,] ∘ 𝐹)‘𝑛) ↔ (𝑧 ∈ ℝ ∧ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛))))))
36	17, 35	mpbirand 720	. . . . . . . 8 ⊢ (((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑛 ∈ ℕ) → (𝑧 ∈ (([,] ∘ 𝐹)‘𝑛) ↔ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
37	36	rexbidva 3184	. . . . . . 7 ⊢ ((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (∃𝑛 ∈ ℕ 𝑧 ∈ (([,] ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
38	16, 37	bitrid 286	. . . . . 6 ⊢ ((𝑧 ∈ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝑧 ∈ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
39	15, 38	sylan 592	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑧 ∈ 𝐴) ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝑧 ∈ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
40	39	an32s 665	. . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) ∧ 𝑧 ∈ 𝐴) → (𝑧 ∈ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
41	40	ralbidva 3183	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (∀𝑧 ∈ 𝐴 𝑧 ∈ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
42	14, 41	bitrid 286	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ 𝑛 ∈ ℕ (([,] ∘ 𝐹)‘𝑛) ↔ ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))
43	13, 42	bitr3d 284	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ ran ([,] ∘ 𝐹) ↔ ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ ((1^st ‘(𝐹‘𝑛)) ≤ 𝑧 ∧ 𝑧 ≤ (2^nd ‘(𝐹‘𝑛)))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 ⟨cop 4590 ∪ cuni 4867 ∪ ciun 4951 class class class wbr 5103 × cxp 5653 ran crn 5656 ∘ ccom 5659 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 1^st c1st 7984 2^nd c2nd 7985 ℝcr 11123 ℝ^*cxr 11266 ≤ cle 11268 ℕcn 12257 [,]cicc 13401

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-pre-lttri 11198 ax-pre-lttrn 11199

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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-icc 13405

This theorem is used by: ovollb2lem 25716 ovolctb 25718 ovolicc1 25744 ioombl1lem4 25789

W3C validator