Theorem stoweidlem39 46489

Description: This lemma is used to prove that there exists a function x as in the proof of Lemma 2 in [BrosowskiDeutsh] p. 91: assuming that 𝑟 is a finite subset of 𝑊, 𝑥 indexes a finite set of functions in the subalgebra (of the Stone Weierstrass theorem), such that for all i ranging in the finite indexing set, 0 ≤ x_i ≤ 1, x_i < ε / m on V(t_i), and x_i > 1 - ε / m on 𝐵. Here 𝐷 is used to represent A in the paper's Lemma 2 (because 𝐴 is used for the subalgebra), 𝑀 is used to represent m in the paper, 𝐸 is used to represent ε, and v_i is used to represent V(t_i). 𝑊 is just a local definition, used to shorten statements. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem39.1	⊢ Ⅎℎ𝜑
stoweidlem39.2	⊢ Ⅎ𝑡𝜑
stoweidlem39.3	⊢ Ⅎ𝑤𝜑
stoweidlem39.4	⊢ 𝑈 = (𝑇 ∖ 𝐵)
stoweidlem39.5	⊢ 𝑌 = {ℎ ∈ 𝐴 ∣ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)}
stoweidlem39.6	⊢ 𝑊 = {𝑤 ∈ 𝐽 ∣ ∀𝑒 ∈ ℝ+ ∃ℎ ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (ℎ‘𝑡))}
stoweidlem39.7	⊢ (𝜑 → 𝑟 ∈ (𝒫 𝑊 ∩ Fin))
stoweidlem39.8	⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑟)
stoweidlem39.9	⊢ (𝜑 → 𝐷 ≠ ∅)
stoweidlem39.10	⊢ (𝜑 → 𝐸 ∈ ℝ+)
stoweidlem39.11	⊢ (𝜑 → 𝐵 ⊆ 𝑇)
stoweidlem39.12	⊢ (𝜑 → 𝑊 ∈ V)
stoweidlem39.13	⊢ (𝜑 → 𝐴 ∈ V)

Assertion

Ref	Expression
stoweidlem39	⊢ (𝜑 → ∃𝑚 ∈ ℕ ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡)))))

Distinct variable groups:   𝑒,ℎ,𝑚,𝑡,𝑤   𝐴,𝑒,ℎ,𝑡,𝑤   𝑒,𝐸,ℎ,𝑡,𝑤   𝑇,𝑒,ℎ,𝑤   𝑈,𝑒,ℎ,𝑤   ℎ,𝑖,𝑟,𝑣,𝑥,𝑚,𝑡,𝑤   𝐴,𝑖,𝑥   𝑖,𝐸,𝑥   𝑇,𝑖,𝑥   𝑈,𝑖,𝑥   𝜑,𝑖,𝑚,𝑣   𝑤,𝑌,𝑥   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥,𝑤,𝑡,𝑒,ℎ,𝑟)   𝐴(𝑣,𝑚,𝑟)   𝐵(𝑤,𝑣,𝑡,𝑒,ℎ,𝑖,𝑚,𝑟)   𝐷(𝑥,𝑤,𝑣,𝑡,𝑒,ℎ,𝑖,𝑚,𝑟)   𝑇(𝑣,𝑡,𝑚,𝑟)   𝑈(𝑣,𝑡,𝑚,𝑟)   𝐸(𝑣,𝑚,𝑟)   𝐽(𝑥,𝑤,𝑣,𝑡,𝑒,ℎ,𝑖,𝑚,𝑟)   𝑊(𝑥,𝑤,𝑣,𝑡,𝑒,ℎ,𝑖,𝑚,𝑟)   𝑌(𝑣,𝑡,𝑒,ℎ,𝑖,𝑚,𝑟)

Proof of Theorem stoweidlem39

Dummy variable 𝑏 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		stoweidlem39.8	. . . . . . 7 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑟)
2		stoweidlem39.9	. . . . . . 7 ⊢ (𝜑 → 𝐷 ≠ ∅)
3	1, 2	jca 511	. . . . . 6 ⊢ (𝜑 → (𝐷 ⊆ ∪ 𝑟 ∧ 𝐷 ≠ ∅))
4		ssn0 4345	. . . . . 6 ⊢ ((𝐷 ⊆ ∪ 𝑟 ∧ 𝐷 ≠ ∅) → ∪ 𝑟 ≠ ∅)
5		unieq 4862	. . . . . . . 8 ⊢ (𝑟 = ∅ → ∪ 𝑟 = ∪ ∅)
6		uni0 4879	. . . . . . . 8 ⊢ ∪ ∅ = ∅
7	5, 6	eqtrdi 2788	. . . . . . 7 ⊢ (𝑟 = ∅ → ∪ 𝑟 = ∅)
8	7	necon3i 2965	. . . . . 6 ⊢ (∪ 𝑟 ≠ ∅ → 𝑟 ≠ ∅)
9	3, 4, 8	3syl 18	. . . . 5 ⊢ (𝜑 → 𝑟 ≠ ∅)
10	9	neneqd 2938	. . . 4 ⊢ (𝜑 → ¬ 𝑟 = ∅)
11		stoweidlem39.7	. . . . . 6 ⊢ (𝜑 → 𝑟 ∈ (𝒫 𝑊 ∩ Fin))
12		elinel2 4143	. . . . . 6 ⊢ (𝑟 ∈ (𝒫 𝑊 ∩ Fin) → 𝑟 ∈ Fin)
13	11, 12	syl 17	. . . . 5 ⊢ (𝜑 → 𝑟 ∈ Fin)
14		fz1f1o 15667	. . . . 5 ⊢ (𝑟 ∈ Fin → (𝑟 = ∅ ∨ ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟)))
15		pm2.53 852	. . . . 5 ⊢ ((𝑟 = ∅ ∨ ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟)) → (¬ 𝑟 = ∅ → ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟)))
16	13, 14, 15	3syl 18	. . . 4 ⊢ (𝜑 → (¬ 𝑟 = ∅ → ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟)))
17	10, 16	mpd 15	. . 3 ⊢ (𝜑 → ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟))
18		oveq2 7370	. . . . . 6 ⊢ (𝑚 = (♯‘𝑟) → (1...𝑚) = (1...(♯‘𝑟)))
19	18	f1oeq2d 6772	. . . . 5 ⊢ (𝑚 = (♯‘𝑟) → (𝑣:(1...𝑚)–1-1-onto→𝑟 ↔ 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟))
20	19	exbidv 1923	. . . 4 ⊢ (𝑚 = (♯‘𝑟) → (∃𝑣 𝑣:(1...𝑚)–1-1-onto→𝑟 ↔ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟))
21	20	rspcev 3565	. . 3 ⊢ (((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))–1-1-onto→𝑟) → ∃𝑚 ∈ ℕ ∃𝑣 𝑣:(1...𝑚)–1-1-onto→𝑟)
22	17, 21	syl 17	. 2 ⊢ (𝜑 → ∃𝑚 ∈ ℕ ∃𝑣 𝑣:(1...𝑚)–1-1-onto→𝑟)
23		f1of 6776	. . . . . . . 8 ⊢ (𝑣:(1...𝑚)–1-1-onto→𝑟 → 𝑣:(1...𝑚)⟶𝑟)
24	23	adantl 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑣:(1...𝑚)⟶𝑟)
25		simpll 767	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝜑)
26		elinel1 4142	. . . . . . . . 9 ⊢ (𝑟 ∈ (𝒫 𝑊 ∩ Fin) → 𝑟 ∈ 𝒫 𝑊)
27	26	elpwid 4551	. . . . . . . 8 ⊢ (𝑟 ∈ (𝒫 𝑊 ∩ Fin) → 𝑟 ⊆ 𝑊)
28	25, 11, 27	3syl 18	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑟 ⊆ 𝑊)
29	24, 28	fssd 6681	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑣:(1...𝑚)⟶𝑊)
30	1	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝐷 ⊆ ∪ 𝑟)
31		dff1o2 6781	. . . . . . . . . 10 ⊢ (𝑣:(1...𝑚)–1-1-onto→𝑟 ↔ (𝑣 Fn (1...𝑚) ∧ Fun ◡𝑣 ∧ ran 𝑣 = 𝑟))
32	31	simp3bi 1148	. . . . . . . . 9 ⊢ (𝑣:(1...𝑚)–1-1-onto→𝑟 → ran 𝑣 = 𝑟)
33	32	unieqd 4864	. . . . . . . 8 ⊢ (𝑣:(1...𝑚)–1-1-onto→𝑟 → ∪ ran 𝑣 = ∪ 𝑟)
34	33	adantl 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → ∪ ran 𝑣 = ∪ 𝑟)
35	30, 34	sseqtrrd 3960	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝐷 ⊆ ∪ ran 𝑣)
36		stoweidlem39.1	. . . . . . . . 9 ⊢ Ⅎℎ𝜑
37		nfv 1916	. . . . . . . . 9 ⊢ Ⅎℎ 𝑚 ∈ ℕ
38	36, 37	nfan 1901	. . . . . . . 8 ⊢ Ⅎℎ(𝜑 ∧ 𝑚 ∈ ℕ)
39		nfv 1916	. . . . . . . 8 ⊢ Ⅎℎ 𝑣:(1...𝑚)–1-1-onto→𝑟
40	38, 39	nfan 1901	. . . . . . 7 ⊢ Ⅎℎ((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟)
41		stoweidlem39.2	. . . . . . . . 9 ⊢ Ⅎ𝑡𝜑
42		nfv 1916	. . . . . . . . 9 ⊢ Ⅎ𝑡 𝑚 ∈ ℕ
43	41, 42	nfan 1901	. . . . . . . 8 ⊢ Ⅎ𝑡(𝜑 ∧ 𝑚 ∈ ℕ)
44		nfv 1916	. . . . . . . 8 ⊢ Ⅎ𝑡 𝑣:(1...𝑚)–1-1-onto→𝑟
45	43, 44	nfan 1901	. . . . . . 7 ⊢ Ⅎ𝑡((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟)
46		stoweidlem39.3	. . . . . . . . 9 ⊢ Ⅎ𝑤𝜑
47		nfv 1916	. . . . . . . . 9 ⊢ Ⅎ𝑤 𝑚 ∈ ℕ
48	46, 47	nfan 1901	. . . . . . . 8 ⊢ Ⅎ𝑤(𝜑 ∧ 𝑚 ∈ ℕ)
49		nfv 1916	. . . . . . . 8 ⊢ Ⅎ𝑤 𝑣:(1...𝑚)–1-1-onto→𝑟
50	48, 49	nfan 1901	. . . . . . 7 ⊢ Ⅎ𝑤((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟)
51		stoweidlem39.5	. . . . . . 7 ⊢ 𝑌 = {ℎ ∈ 𝐴 ∣ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)}
52		stoweidlem39.6	. . . . . . 7 ⊢ 𝑊 = {𝑤 ∈ 𝐽 ∣ ∀𝑒 ∈ ℝ+ ∃ℎ ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (ℎ‘𝑡))}
53		eqid 2737	. . . . . . 7 ⊢ (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) = (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))})
54		simplr 769	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑚 ∈ ℕ)
55		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑣:(1...𝑚)–1-1-onto→𝑟)
56		stoweidlem39.10	. . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ ℝ+)
57	56	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝐸 ∈ ℝ+)
58		stoweidlem39.11	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ⊆ 𝑇)
59	58	sselda 3922	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝑇)
60		notnot 142	. . . . . . . . . . . . . . 15 ⊢ (𝑏 ∈ 𝐵 → ¬ ¬ 𝑏 ∈ 𝐵)
61	60	intnand 488	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ 𝐵 → ¬ (𝑏 ∈ 𝑇 ∧ ¬ 𝑏 ∈ 𝐵))
62	61	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ (𝑏 ∈ 𝑇 ∧ ¬ 𝑏 ∈ 𝐵))
63		eldif 3900	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ (𝑇 ∖ 𝐵) ↔ (𝑏 ∈ 𝑇 ∧ ¬ 𝑏 ∈ 𝐵))
64	62, 63	sylnibr 329	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ 𝑏 ∈ (𝑇 ∖ 𝐵))
65		stoweidlem39.4	. . . . . . . . . . . . 13 ⊢ 𝑈 = (𝑇 ∖ 𝐵)
66	65	eleq2i 2829	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ 𝑈 ↔ 𝑏 ∈ (𝑇 ∖ 𝐵))
67	64, 66	sylnibr 329	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ 𝑏 ∈ 𝑈)
68	59, 67	eldifd 3901	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ (𝑇 ∖ 𝑈))
69	68	ralrimiva 3130	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑏 ∈ 𝐵 𝑏 ∈ (𝑇 ∖ 𝑈))
70		dfss3 3911	. . . . . . . . 9 ⊢ (𝐵 ⊆ (𝑇 ∖ 𝑈) ↔ ∀𝑏 ∈ 𝐵 𝑏 ∈ (𝑇 ∖ 𝑈))
71	69, 70	sylibr 234	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ⊆ (𝑇 ∖ 𝑈))
72	71	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝐵 ⊆ (𝑇 ∖ 𝑈))
73		stoweidlem39.12	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ∈ V)
74	73	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑊 ∈ V)
75		stoweidlem39.13	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ V)
76	75	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝐴 ∈ V)
77	13	ad2antrr 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → 𝑟 ∈ Fin)
78		mptfi 9256	. . . . . . . 8 ⊢ (𝑟 ∈ Fin → (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin)
79		rnfi 9245	. . . . . . . 8 ⊢ ((𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin → ran (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin)
80	77, 78, 79	3syl 18	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → ran (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin)
81	40, 45, 50, 51, 52, 53, 28, 54, 55, 57, 72, 74, 76, 80	stoweidlem31 46481	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))
82	29, 35, 81	3jca 1129	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)–1-1-onto→𝑟) → (𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡)))))
83	82	ex 412	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑣:(1...𝑚)–1-1-onto→𝑟 → (𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))))
84	83	eximdv 1919	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (∃𝑣 𝑣:(1...𝑚)–1-1-onto→𝑟 → ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))))
85	84	reximdva 3151	. 2 ⊢ (𝜑 → (∃𝑚 ∈ ℕ ∃𝑣 𝑣:(1...𝑚)–1-1-onto→𝑟 → ∃𝑚 ∈ ℕ ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))))
86	22, 85	mpd 15	1 ⊢ (𝜑 → ∃𝑚 ∈ ℕ ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡)))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542  ∃wex 1781  Ⅎwnf 1785   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3390  Vcvv 3430   ∖ cdif 3887   ∩ cin 3889   ⊆ wss 3890  ∅c0 4274  𝒫 cpw 4542  ∪ cuni 4851   class class class wbr 5086   ↦ cmpt 5167  ^◡ccnv 5625  ran crn 5627  Fun wfun 6488   Fn wfn 6489  ⟶wf 6490  –1-1-onto→wf1o 6493  ‘cfv 6494  (class class class)co 7362  Fincfn 8888  0cc0 11033  1c1 11034   < clt 11174   ≤ cle 11175   − cmin 11372   / cdiv 11802  ℕcn 12169  ℝ⁺crp 12937  ...cfz 13456  ♯chash 14287

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684  ax-cnex 11089  ax-resscn 11090  ax-1cn 11091  ax-icn 11092  ax-addcl 11093  ax-addrcl 11094  ax-mulcl 11095  ax-mulrcl 11096  ax-mulcom 11097  ax-addass 11098  ax-mulass 11099  ax-distr 11100  ax-i2m1 11101  ax-1ne0 11102  ax-1rid 11103  ax-rnegex 11104  ax-rrecex 11105  ax-cnre 11106  ax-pre-lttri 11107  ax-pre-lttrn 11108  ax-pre-ltadd 11109  ax-pre-mulgt0 11110

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5521  df-eprel 5526  df-po 5534  df-so 5535  df-fr 5579  df-we 5581  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-ord 6322  df-on 6323  df-lim 6324  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-riota 7319  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7813  df-1st 7937  df-2nd 7938  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-rdg 8344  df-1o 8400  df-er 8638  df-en 8889  df-dom 8890  df-sdom 8891  df-fin 8892  df-card 9858  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-sub 11374  df-neg 11375  df-div 11803  df-nn 12170  df-n0 12433  df-z 12520  df-uz 12784  df-rp 12938  df-fz 13457  df-hash 14288

This theorem is referenced by:  stoweidlem57  46507