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

Theorem stoweidlem39 47383
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 ≤ xi ≤ 1, xi < ε / m on V(ti), and xi > 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 vi is used to represent V(ti). 𝑊 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.
StepHypRef Expression
1 stoweidlem39.8 . . . . . . 7 (𝜑 → 𝐷 ⊆ ∪ 𝑟)
2 stoweidlem39.9 . . . . . . 7 (𝜑 → 𝐷 ≠ ∅)
31, 2jca 521 . . . . . 6 (𝜑 → (𝐷 ⊆ ∪ 𝑟 ∧ 𝐷 ≠ ∅))
4 ssn0 4358 . . . . . 6 ((𝐷 ⊆ ∪ 𝑟 ∧ 𝐷 ≠ ∅) → ∪ 𝑟 ≠ ∅)
5 unieq 4883 . . . . . . . 8 (𝑟 = ∅ → ∪ 𝑟 = ∪ ∅)
6 uni0 4901 . . . . . . . 8 ∪ ∅ = ∅
75, 6eqtrdi 2814 . . . . . . 7 (𝑟 = ∅ → ∪ 𝑟 = ∅)
87necon3i 2991 . . . . . 6 (∪ 𝑟 ≠ ∅ → 𝑟 ≠ ∅)
93, 4, 83syl 19 . . . . 5 (𝜑 → 𝑟 ≠ ∅)
109neneqd 2964 . . . 4 (𝜑 → ¬ 𝑟 = ∅)
11 stoweidlem39.7 . . . . . 6 (𝜑 → 𝑟 ∈ (𝒫 𝑊 ∩ Fin))
12 elinel2 4102 . . . . . 6 (𝑟 ∈ (𝒫 𝑊 ∩ Fin) → 𝑟 ∈ Fin)
1311, 12syl 18 . . . . 5 (𝜑 → 𝑟 ∈ Fin)
14 fz1f1o 15920 . . . . 5 (𝑟 ∈ Fin → (𝑟 = ∅ ∨ ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟)))
15 pm2.53 865 . . . . 5 ((𝑟 = ∅ ∨ ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟)) → (¬ 𝑟 = ∅ → ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟)))
1613, 14, 153syl 19 . . . 4 (𝜑 → (¬ 𝑟 = ∅ → ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟)))
1710, 16mpd 16 . . 3 (𝜑 → ((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟))
18 oveq2 7459 . . . . . 6 (𝑚 = (♯‘𝑟) → (1...𝑚) = (1...(♯‘𝑟)))
1918f1oeq2d 6850 . . . . 5 (𝑚 = (♯‘𝑟) → (𝑣:(1...𝑚)⟶1-1onto𝑟 ↔ 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟))
2019exbidv 1956 . . . 4 (𝑚 = (♯‘𝑟) → (∃𝑣 𝑣:(1...𝑚)⟶1-1onto𝑟 ↔ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟))
2120rspcev 3580 . . 3 (((♯‘𝑟) ∈ ℕ ∧ ∃𝑣 𝑣:(1...(♯‘𝑟))⟶1-1onto𝑟) → ∃𝑚 ∈ ℕ ∃𝑣 𝑣:(1...𝑚)⟶1-1onto𝑟)
2217, 21syl 18 . 2 (𝜑 → ∃𝑚 ∈ ℕ ∃𝑣 𝑣:(1...𝑚)⟶1-1onto𝑟)
23 f1of 6854 . . . . . . . 8 (𝑣:(1...𝑚)⟶1-1onto𝑟 → 𝑣:(1...𝑚)⟶𝑟)
2423adantl 487 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑣:(1...𝑚)⟶𝑟)
25 simpll 779 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝜑)
26 elinel1 4101 . . . . . . . . 9 (𝑟 ∈ (𝒫 𝑊 ∩ Fin) → 𝑟 ∈ 𝒫 𝑊)
2726elpwid 4569 . . . . . . . 8 (𝑟 ∈ (𝒫 𝑊 ∩ Fin) → 𝑟 ⊆ 𝑊)
2825, 11, 273syl 19 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑟 ⊆ 𝑊)
2924, 28fssd 6757 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑣:(1...𝑚)⟶𝑊)
301ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝐷 ⊆ ∪ 𝑟)
31 dff1o2 6860 . . . . . . . . . 10 (𝑣:(1...𝑚)⟶1-1onto𝑟 ↔ (𝑣 Fn (1...𝑚) ∧ Fun ◡𝑣 ∧ ran 𝑣 = 𝑟))
3231simp3bi 1165 . . . . . . . . 9 (𝑣:(1...𝑚)⟶1-1onto𝑟 → ran 𝑣 = 𝑟)
3332unieqd 4885 . . . . . . . 8 (𝑣:(1...𝑚)⟶1-1onto𝑟 → ∪ ran 𝑣 = ∪ 𝑟)
3433adantl 487 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → ∪ ran 𝑣 = ∪ 𝑟)
3530, 34sseqtrrd 3950 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝐷 ⊆ ∪ ran 𝑣)
36 stoweidlem39.1 . . . . . . . . 9 Ⅎℎ𝜑
37 nfv 1949 . . . . . . . . 9 Ⅎℎ 𝑚 ∈ ℕ
3836, 37nfan 1934 . . . . . . . 8 Ⅎℎ(𝜑 ∧ 𝑚 ∈ ℕ)
39 nfv 1949 . . . . . . . 8 Ⅎℎ 𝑣:(1...𝑚)⟶1-1onto𝑟
4038, 39nfan 1934 . . . . . . 7 Ⅎℎ((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟)
41 stoweidlem39.2 . . . . . . . . 9 Ⅎ𝑡𝜑
42 nfv 1949 . . . . . . . . 9 Ⅎ𝑡 𝑚 ∈ ℕ
4341, 42nfan 1934 . . . . . . . 8 Ⅎ𝑡(𝜑 ∧ 𝑚 ∈ ℕ)
44 nfv 1949 . . . . . . . 8 Ⅎ𝑡 𝑣:(1...𝑚)⟶1-1onto𝑟
4543, 44nfan 1934 . . . . . . 7 Ⅎ𝑡((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟)
46 stoweidlem39.3 . . . . . . . . 9 Ⅎ𝑤𝜑
47 nfv 1949 . . . . . . . . 9 Ⅎ𝑤 𝑚 ∈ ℕ
4846, 47nfan 1934 . . . . . . . 8 Ⅎ𝑤(𝜑 ∧ 𝑚 ∈ ℕ)
49 nfv 1949 . . . . . . . 8 Ⅎ𝑤 𝑣:(1...𝑚)⟶1-1onto𝑟
5048, 49nfan 1934 . . . . . . 7 Ⅎ𝑤((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟)
51 stoweidlem39.5 . . . . . . 7 𝑌 = {ℎ ∈ 𝐴 ∣ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)}
52 stoweidlem39.6 . . . . . . 7 𝑊 = {𝑤 ∈ 𝐽 ∣ ∀𝑒 ∈ ℝ+ ∃ℎ ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (ℎ‘𝑡))}
53 eqid 2763 . . . . . . 7 (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) = (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))})
54 simplr 781 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑚 ∈ ℕ)
55 simpr 490 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑣:(1...𝑚)⟶1-1onto𝑟)
56 stoweidlem39.10 . . . . . . . 8 (𝜑 → 𝐸 ∈ ℝ+)
5756ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝐸 ∈ ℝ+)
58 stoweidlem39.11 . . . . . . . . . . . 12 (𝜑 → 𝐵 ⊆ 𝑇)
5958sselda 3913 . . . . . . . . . . 11 ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝑇)
60 notnot 143 . . . . . . . . . . . . . . 15 (𝑏 ∈ 𝐵 → ¬ ¬ 𝑏 ∈ 𝐵)
6160intnand 494 . . . . . . . . . . . . . 14 (𝑏 ∈ 𝐵 → ¬ (𝑏 ∈ 𝑇 ∧ ¬ 𝑏 ∈ 𝐵))
6261adantl 487 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ (𝑏 ∈ 𝑇 ∧ ¬ 𝑏 ∈ 𝐵))
63 eldif 4052 . . . . . . . . . . . . 13 (𝑏 ∈ (𝑇 ∖ 𝐵) ↔ (𝑏 ∈ 𝑇 ∧ ¬ 𝑏 ∈ 𝐵))
6462, 63sylnibr 332 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ 𝑏 ∈ (𝑇 ∖ 𝐵))
65 stoweidlem39.4 . . . . . . . . . . . . 13 𝑈 = (𝑇 ∖ 𝐵)
6665eleq2i 2856 . . . . . . . . . . . 12 (𝑏 ∈ 𝑈 ↔ 𝑏 ∈ (𝑇 ∖ 𝐵))
6764, 66sylnibr 332 . . . . . . . . . . 11 ((𝜑 ∧ 𝑏 ∈ 𝐵) → ¬ 𝑏 ∈ 𝑈)
6859, 67eldifd 4053 . . . . . . . . . 10 ((𝜑 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ (𝑇 ∖ 𝑈))
6968ralrimiva 3158 . . . . . . . . 9 (𝜑 → ∀𝑏 ∈ 𝐵 𝑏 ∈ (𝑇 ∖ 𝑈))
70 dfss3 3902 . . . . . . . . 9 (𝐵 ⊆ (𝑇 ∖ 𝑈) ↔ ∀𝑏 ∈ 𝐵 𝑏 ∈ (𝑇 ∖ 𝑈))
7169, 70sylibr 237 . . . . . . . 8 (𝜑 → 𝐵 ⊆ (𝑇 ∖ 𝑈))
7271ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝐵 ⊆ (𝑇 ∖ 𝑈))
73 stoweidlem39.12 . . . . . . . 8 (𝜑 → 𝑊 ∈ V)
7473ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑊 ∈ V)
75 stoweidlem39.13 . . . . . . . 8 (𝜑 → 𝐴 ∈ V)
7675ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝐴 ∈ V)
7713ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → 𝑟 ∈ Fin)
78 mptfi 9378 . . . . . . . 8 (𝑟 ∈ Fin → (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin)
79 rnfi 9367 . . . . . . . 8 ((𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin → ran (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin)
8077, 78, 793syl 19 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → ran (𝑤 ∈ 𝑟 ↦ {ℎ ∈ 𝐴 ∣ (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑤 (ℎ‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − (𝐸 / 𝑚)) < (ℎ‘𝑡))}) ∈ Fin)
8140, 45, 50, 51, 52, 53, 28, 54, 55, 57, 72, 74, 76, 80stoweidlem31 47375 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))
8229, 35, 813jca 1146 . . . . 5 (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑣:(1...𝑚)⟶1-1onto𝑟) → (𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡)))))
8382ex 418 . . . 4 ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑣:(1...𝑚)⟶1-1onto𝑟 → (𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))))
8483eximdv 1952 . . 3 ((𝜑 ∧ 𝑚 ∈ ℕ) → (∃𝑣 𝑣:(1...𝑚)⟶1-1onto𝑟 → ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))))
8584reximdva 3179 . 2 (𝜑 → (∃𝑚 ∈ ℕ ∃𝑣 𝑣:(1...𝑚)⟶1-1onto𝑟 → ∃𝑚 ∈ ℕ ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡))))))
8622, 85mpd 16 1 (𝜑 → ∃𝑚 ∈ ℕ ∃𝑣(𝑣:(1...𝑚)⟶𝑊 ∧ 𝐷 ⊆ ∪ ran 𝑣 ∧ ∃𝑥(𝑥:(1...𝑚)⟶𝑌 ∧ ∀𝑖 ∈ (1...𝑚)(∀𝑡 ∈ (𝑣‘𝑖)((𝑥‘𝑖)‘𝑡) < (𝐸 / 𝑚) ∧ ∀𝑡 ∈ 𝐵 (1 − (𝐸 / 𝑚)) < ((𝑥‘𝑖)‘𝑡)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872   class class class wbr 5108   ↦ cmpt 5192  ◡ccnv 5657  ran crn 5659  Fun wfun 6560   Fn wfn 6561  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  Fincfn 9011  0cc0 11239  1c1 11240   < clt 11382   ≤ cle 11383   − cmin 11580   / cdiv 12013  ℕcn 12375  ℝ+crp 13160  ...cfz 13679  ♯chash 14515
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-rp 13161  df-fz 13680  df-hash 14516
This theorem is used by:  stoweidlem57  47401
  Copyright terms: Public domain W3C validator