Theorem stoweidlem56 46847

Description: This theorem proves Lemma 1 in [BrosowskiDeutsh] p. 90. Here 𝑍 is used to represent t₀ in the paper, 𝑣 is used to represent 𝑉 in the paper, and 𝑒 is used to represent ε. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem56.1	⊢ Ⅎ𝑡𝑈
stoweidlem56.2	⊢ Ⅎ𝑡𝜑
stoweidlem56.3	⊢ 𝐾 = (topGen‘ran (,))
stoweidlem56.4	⊢ (𝜑 → 𝐽 ∈ Comp)
stoweidlem56.5	⊢ 𝑇 = ∪ 𝐽
stoweidlem56.6	⊢ 𝐶 = (𝐽 Cn 𝐾)
stoweidlem56.7	⊢ (𝜑 → 𝐴 ⊆ 𝐶)
stoweidlem56.8	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem56.9	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem56.10	⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑦) ∈ 𝐴)
stoweidlem56.11	⊢ ((𝜑 ∧ (𝑟 ∈ 𝑇 ∧ 𝑡 ∈ 𝑇 ∧ 𝑟 ≠ 𝑡)) → ∃𝑞 ∈ 𝐴 (𝑞‘𝑟) ≠ (𝑞‘𝑡))
stoweidlem56.12	⊢ (𝜑 → 𝑈 ∈ 𝐽)
stoweidlem56.13	⊢ (𝜑 → 𝑍 ∈ 𝑈)

Assertion

Ref	Expression
stoweidlem56	⊢ (𝜑 → ∃𝑣 ∈ 𝐽 ((𝑍 ∈ 𝑣 ∧ 𝑣 ⊆ 𝑈) ∧ ∀𝑒 ∈ ℝ+ ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑣 (𝑥‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (𝑥‘𝑡))))

Distinct variable groups:   𝐴,𝑒,𝑡,𝑣,𝑥   𝜑,𝑞,𝑟,𝑔   𝑒,𝑓,𝜑,𝑦   𝑈,𝑓,𝑞,𝑟,𝑦   𝑈,𝑔,𝑒   𝑣,𝑈,𝑥   𝑡,𝑍,𝑦   𝑡,𝐾   𝑔,𝐽,𝑡   𝑇,𝑓,𝑔,𝑞,𝑟,𝑡   𝑦,𝑇   𝐴,𝑔   𝑒,𝑍,𝑣   𝑇,𝑒,𝑣,𝑥   𝑓,𝑍,𝑔,𝑞   𝑣,𝐽   𝐴,𝑓,𝑞,𝑟,𝑦   𝑒,𝑔

Allowed substitution hints:   𝜑(𝑥, 𝑣, 𝑡)   𝐶(𝑥, 𝑦, 𝑣, 𝑡, 𝑒, 𝑓, 𝑔, 𝑟, 𝑞)   𝑈(𝑡)   𝐽(𝑥, 𝑦, 𝑒, 𝑓, 𝑟, 𝑞)   𝐾(𝑥, 𝑦, 𝑣, 𝑒, 𝑓, 𝑔, 𝑟, 𝑞)   𝑍(𝑥, 𝑟)

Proof of Theorem stoweidlem56

Dummy variables 𝑑 𝑝 ℎ 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		stoweidlem56.1	. . . . 5 ⊢ Ⅎ𝑡𝑈
2		stoweidlem56.2	. . . . 5 ⊢ Ⅎ𝑡𝜑
3		stoweidlem56.3	. . . . 5 ⊢ 𝐾 = (topGen‘ran (,))
4		stoweidlem56.4	. . . . 5 ⊢ (𝜑 → 𝐽 ∈ Comp)
5		stoweidlem56.5	. . . . 5 ⊢ 𝑇 = ∪ 𝐽
6		stoweidlem56.6	. . . . 5 ⊢ 𝐶 = (𝐽 Cn 𝐾)
7		stoweidlem56.7	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ 𝐶)
8		stoweidlem56.8	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
9		stoweidlem56.9	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
10		stoweidlem56.10	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑦) ∈ 𝐴)
11		stoweidlem56.11	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑇 ∧ 𝑡 ∈ 𝑇 ∧ 𝑟 ≠ 𝑡)) → ∃𝑞 ∈ 𝐴 (𝑞‘𝑟) ≠ (𝑞‘𝑡))
12		stoweidlem56.12	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐽)
13		stoweidlem56.13	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑈)
14		eqid 2765	. . . . 5 ⊢ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
15		eqid 2765	. . . . 5 ⊢ {𝑤 ∈ 𝐽 ∣ ∃ℎ ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} = {𝑤 ∈ 𝐽 ∣ ∃ℎ ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15	stoweidlem55 46846	. . . 4 ⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))
17		df-rex 3092	. . . 4 ⊢ (∃𝑝 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) ↔ ∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))))
18	16, 17	sylib 221	. . 3 ⊢ (𝜑 → ∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))))
19		simpl 488	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → 𝜑)
20		simprl 783	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → 𝑝 ∈ 𝐴)
21		simprr3 1242	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))
22		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑡 𝑝 ∈ 𝐴
23		nfra1 3291	. . . . . . . . 9 ⊢ Ⅎ𝑡∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)
24	2, 22, 23	nf3an 1934	. . . . . . . 8 ⊢ Ⅎ𝑡(𝜑 ∧ 𝑝 ∈ 𝐴 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))
25	4	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) → 𝐽 ∈ Comp)
26	7	sselda 3938	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ 𝐶)
27	26, 6	eleqtrdi 2875	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ (𝐽 Cn 𝐾))
28	27	3adant3 1150	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) → 𝑝 ∈ (𝐽 Cn 𝐾))
29		simp3 1156	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) → ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))
30	12	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) → 𝑈 ∈ 𝐽)
31	1, 24, 3, 5, 25, 28, 29, 30	stoweidlem28 46819	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐴 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))
32	19, 20, 21, 31	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))
33		simpr1 1213	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → 𝑑 ∈ ℝ+)
34		simpr2 1214	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → 𝑑 < 1)
35		simplrl 789	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → 𝑝 ∈ 𝐴)
36		simprr1 1240	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1))
37	36	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1))
38		simprr2 1241	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → (𝑝‘𝑍) = 0)
39	38	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → (𝑝‘𝑍) = 0)
40		simpr3 1215	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))
41	37, 39, 40	3jca 1146	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))
42	35, 41	jca 521	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))
43	33, 34, 42	3jca 1146	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))) → (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))))
44	43	ex 418	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → ((𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)) → (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))))
45	44	eximdv 1950	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → (∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))))
46	32, 45	mpd 16	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))))
47	46	ex 418	. . . 4 ⊢ (𝜑 → ((𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))) → ∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))))
48	47	eximdv 1950	. . 3 ⊢ (𝜑 → (∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))) → ∃𝑝∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))))
49	18, 48	mpd 16	. 2 ⊢ (𝜑 → ∃𝑝∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))))
50		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑡 𝑑 ∈ ℝ+
51		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑡 𝑑 < 1
52		nfra1 3291	. . . . . . . . 9 ⊢ Ⅎ𝑡∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1)
53		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑡(𝑝‘𝑍) = 0
54		nfra1 3291	. . . . . . . . 9 ⊢ Ⅎ𝑡∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)
55	52, 53, 54	nf3an 1934	. . . . . . . 8 ⊢ Ⅎ𝑡(∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))
56	22, 55	nfan 1932	. . . . . . 7 ⊢ Ⅎ𝑡(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))
57	50, 51, 56	nf3an 1934	. . . . . 6 ⊢ Ⅎ𝑡(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))
58	2, 57	nfan 1932	. . . . 5 ⊢ Ⅎ𝑡(𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))))
59		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑡𝑝
60		eqid 2765	. . . . 5 ⊢ {𝑡 ∈ 𝑇 ∣ (𝑝‘𝑡) < (𝑑 / 2)} = {𝑡 ∈ 𝑇 ∣ (𝑝‘𝑡) < (𝑑 / 2)}
61	7	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → 𝐴 ⊆ 𝐶)
62	8	3adant1r 1196	. . . . 5 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
63	9	3adant1r 1196	. . . . 5 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
64	10	adantlr 728	. . . . 5 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) ∧ 𝑦 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑦) ∈ 𝐴)
65		simpr1 1213	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → 𝑑 ∈ ℝ+)
66		simpr2 1214	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → 𝑑 < 1)
67	12	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → 𝑈 ∈ 𝐽)
68	13	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → 𝑍 ∈ 𝑈)
69		simpr3l 1253	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → 𝑝 ∈ 𝐴)
70		simp3r1 1300	. . . . . 6 ⊢ ((𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))) → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1))
71	70	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1))
72		simp3r2 1301	. . . . . 6 ⊢ ((𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))) → (𝑝‘𝑍) = 0)
73	72	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → (𝑝‘𝑍) = 0)
74		simp3r3 1302	. . . . . 6 ⊢ ((𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))) → ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))
75	74	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))
76	1, 58, 59, 3, 60, 5, 6, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 73, 75	stoweidlem52 46843	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡))))) → ∃𝑣 ∈ 𝐽 ((𝑍 ∈ 𝑣 ∧ 𝑣 ⊆ 𝑈) ∧ ∀𝑒 ∈ ℝ+ ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑣 (𝑥‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (𝑥‘𝑡))))
77	76	ex 418	. . 3 ⊢ (𝜑 → ((𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))) → ∃𝑣 ∈ 𝐽 ((𝑍 ∈ 𝑣 ∧ 𝑣 ⊆ 𝑈) ∧ ∀𝑒 ∈ ℝ+ ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑣 (𝑥‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (𝑥‘𝑡)))))
78	77	exlimdvv 1967	. 2 ⊢ (𝜑 → (∃𝑝∃𝑑(𝑑 ∈ ℝ+ ∧ 𝑑 < 1 ∧ (𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝑑 ≤ (𝑝‘𝑡)))) → ∃𝑣 ∈ 𝐽 ((𝑍 ∈ 𝑣 ∧ 𝑣 ⊆ 𝑈) ∧ ∀𝑒 ∈ ℝ+ ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑣 (𝑥‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (𝑥‘𝑡)))))
79	49, 78	mpd 16	1 ⊢ (𝜑 → ∃𝑣 ∈ 𝐽 ((𝑍 ∈ 𝑣 ∧ 𝑣 ⊆ 𝑈) ∧ ∀𝑒 ∈ ℝ+ ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑣 (𝑥‘𝑡) < 𝑒 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝑒) < (𝑥‘𝑡))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2146  Ⅎwnfc 2912   ≠ wne 2960  ∀wral 3081  ∃wrex 3091  {crab 3418   ∖ cdif 3903   ⊆ wss 3906  ∪ cuni 4874   class class class wbr 5111   ↦ cmpt 5194  ran crn 5664  ‘cfv 6540  (class class class)co 7419  ℝcr 11118  0cc0 11119  1c1 11120   + caddc 11122   · cmul 11124   < clt 11262   ≤ cle 11263   − cmin 11460   / cdiv 11890  2c2 12314  ℝ⁺crp 13036  (,)cioo 13392  topGenctg 17516   Cn ccn 23435  Compccmp 23597

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-inf2 9617  ax-cnex 11175  ax-resscn 11176  ax-1cn 11177  ax-icn 11178  ax-addcl 11179  ax-addrcl 11180  ax-mulcl 11181  ax-mulrcl 11182  ax-mulcom 11183  ax-addass 11184  ax-mulass 11185  ax-distr 11186  ax-i2m1 11187  ax-1ne0 11188  ax-1rid 11189  ax-rnegex 11190  ax-rrecex 11191  ax-cnre 11192  ax-pre-lttri 11193  ax-pre-lttrn 11194  ax-pre-ltadd 11195  ax-pre-mulgt0 11196  ax-pre-sup 11197

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-of 7684  df-om 7869  df-1st 7992  df-2nd 7993  df-supp 8163  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-map 8832  df-pm 8833  df-ixp 8902  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-fsupp 9329  df-fi 9378  df-sup 9409  df-inf 9410  df-oi 9479  df-card 9941  df-pnf 11264  df-mnf 11265  df-xr 11266  df-ltxr 11267  df-le 11268  df-sub 11462  df-neg 11463  df-div 11891  df-nn 12253  df-2 12322  df-3 12323  df-4 12324  df-5 12325  df-6 12326  df-7 12327  df-8 12328  df-9 12329  df-n0 12524  df-z 12611  df-dec 12732  df-uz 12883  df-q 12993  df-rp 13037  df-xneg 13157  df-xadd 13158  df-xmul 13159  df-ioo 13396  df-ico 13398  df-icc 13399  df-fz 13556  df-fzo 13704  df-fl 13847  df-seq 14060  df-exp 14120  df-hash 14389  df-cj 15178  df-re 15179  df-im 15180  df-sqrt 15314  df-abs 15315  df-clim 15567  df-rlim 15568  df-sum 15766  df-struct 17233  df-sets 17250  df-slot 17268  df-ndx 17280  df-base 17296  df-ress 17317  df-plusg 17349  df-mulr 17350  df-starv 17351  df-sca 17352  df-vsca 17353  df-ip 17354  df-tset 17355  df-ple 17356  df-ds 17358  df-unif 17359  df-hom 17360  df-cco 17361  df-rest 17501  df-topn 17502  df-0g 17520  df-gsum 17521  df-topgen 17522  df-pt 17523  df-prds 17526  df-xrs 17582  df-qtop 17587  df-imas 17588  df-xps 17590  df-mre 17664  df-mrc 17665  df-acs 17667  df-mgm 18724  df-sgrp 18813  df-mnd 18829  df-submnd 18883  df-mulg 19182  df-cntz 19435  df-cmn 19900  df-psmet 21568  df-xmet 21569  df-met 21570  df-bl 21571  df-mopn 21572  df-cnfld 21577  df-top 23105  df-topon 23122  df-topsp 23144  df-bases 23157  df-cld 23230  df-cn 23438  df-cnp 23439  df-cmp 23598  df-tx 23774  df-hmeo 23967  df-xms 24532  df-ms 24533  df-tms 24534

This theorem is used by:  stoweidlem57  46848