stoweidlem36 - Mathbox for Glauco Siliprandi

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

Theorem stoweidlem36 46849

Description: This lemma is used to prove the existence of a function p_t as in Lemma 1 of [BrosowskiDeutsh] p. 90 (at the beginning of Lemma 1): for all t in T - U, there exists a function p in the subalgebra, such that p_t ( t₀ ) = 0 , p_t ( t ) > 0, and 0 <= p_t <= 1. Z is used for t₀ , S is used for t e. T - U , h is used for p_t . G is used for (h_t)^2 and the final h is a normalized version of G ( divided by its norm, see the variable N ). (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
stoweidlem36.1	⊢ Ⅎℎ𝑄
stoweidlem36.2	⊢ Ⅎ𝑡𝐻
stoweidlem36.3	⊢ Ⅎ𝑡𝐹
stoweidlem36.4	⊢ Ⅎ𝑡𝐺
stoweidlem36.5	⊢ Ⅎ𝑡𝜑
stoweidlem36.6	⊢ 𝐾 = (topGen‘ran (,))
stoweidlem36.7	⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
stoweidlem36.8	⊢ 𝑇 = ∪ 𝐽
stoweidlem36.9	⊢ 𝐺 = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐹‘𝑡)))
stoweidlem36.10	⊢ 𝑁 = sup(ran 𝐺, ℝ, < )
stoweidlem36.11	⊢ 𝐻 = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) / 𝑁))
stoweidlem36.12	⊢ (𝜑 → 𝐽 ∈ Comp)
stoweidlem36.13	⊢ (𝜑 → 𝐴 ⊆ (𝐽 Cn 𝐾))
stoweidlem36.14	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem36.15	⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
stoweidlem36.16	⊢ (𝜑 → 𝑆 ∈ 𝑇)
stoweidlem36.17	⊢ (𝜑 → 𝑍 ∈ 𝑇)
stoweidlem36.18	⊢ (𝜑 → 𝐹 ∈ 𝐴)
stoweidlem36.19	⊢ (𝜑 → (𝐹‘𝑆) ≠ (𝐹‘𝑍))
stoweidlem36.20	⊢ (𝜑 → (𝐹‘𝑍) = 0)

**Assertion**
Ref	Expression
stoweidlem36	⊢ (𝜑 → ∃ℎ(ℎ ∈ 𝑄 ∧ 0 < (ℎ‘𝑆)))

Distinct variable groups: 𝑓,𝑔,𝑡,𝑇 𝐴,𝑓,𝑔 𝑓,𝐹,𝑔 𝑓,𝐺,𝑔 𝜑,𝑓,𝑔 𝑔,𝑁,𝑡 𝑡,ℎ,𝑆 𝐴,ℎ ℎ,𝐻 𝑇,ℎ ℎ,𝑍,𝑡 𝑥,𝑡,𝑁 𝑥,𝐴 𝑥,𝑇 𝜑,𝑥 Allowed substitution hints: 𝜑(𝑡, ℎ) 𝐴(𝑡) 𝑄(𝑥, 𝑡, 𝑓, 𝑔, ℎ) 𝑆(𝑥, 𝑓, 𝑔) 𝐹(𝑥, 𝑡, ℎ) 𝐺(𝑥, 𝑡, ℎ) 𝐻(𝑥, 𝑡, 𝑓, 𝑔) 𝐽(𝑥, 𝑡, 𝑓, 𝑔, ℎ) 𝐾(𝑥, 𝑡, 𝑓, 𝑔, ℎ) 𝑁(𝑓, ℎ) 𝑍(𝑥, 𝑓, 𝑔)

Proof of Theorem stoweidlem36 Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		stoweidlem36.11	. . . . . 6 ⊢ 𝐻 = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) / 𝑁))
2		stoweidlem36.5	. . . . . . 7 ⊢ Ⅎ𝑡𝜑
3		stoweidlem36.6	. . . . . . . . . . . 12 ⊢ 𝐾 = (topGen‘ran (,))
4		stoweidlem36.8	. . . . . . . . . . . 12 ⊢ 𝑇 = ∪ 𝐽
5		eqid 2762	. . . . . . . . . . . 12 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾)
6		stoweidlem36.13	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ⊆ (𝐽 Cn 𝐾))
7		stoweidlem36.9	. . . . . . . . . . . . . 14 ⊢ 𝐺 = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐹‘𝑡)))
8		stoweidlem36.18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 ∈ 𝐴)
9		stoweidlem36.3	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑡𝐹
10	9	nfeq2 2941	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑡 𝑓 = 𝐹
11	9	nfeq2 2941	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑡 𝑔 = 𝐹
12		stoweidlem36.14	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
13	10, 11, 12	stoweidlem6 46819	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐹‘𝑡))) ∈ 𝐴)
14	8, 8, 13	mpd3an23 1492	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) · (𝐹‘𝑡))) ∈ 𝐴)
15	7, 14	eqeltrid 2866	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ∈ 𝐴)
16	6, 15	sseldd 3935	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
17	3, 4, 5, 16	fcnre 45844	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:𝑇⟶ℝ)
18	17	ffvelcdmda 7080	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ∈ ℝ)
19	18	recnd 11262	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ∈ ℂ)
20		stoweidlem36.10	. . . . . . . . . . . 12 ⊢ 𝑁 = sup(ran 𝐺, ℝ, < )
21		stoweidlem36.12	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐽 ∈ Comp)
22		stoweidlem36.16	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑆 ∈ 𝑇)
23	22	ne0d 4291	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑇 ≠ ∅)
24	4, 3, 21, 16, 23	cncmpmax 45851	. . . . . . . . . . . . 13 ⊢ (𝜑 → (sup(ran 𝐺, ℝ, < ) ∈ ran 𝐺 ∧ sup(ran 𝐺, ℝ, < ) ∈ ℝ ∧ ∀𝑠 ∈ 𝑇 (𝐺‘𝑠) ≤ sup(ran 𝐺, ℝ, < )))
25	24	simp2d 1161	. . . . . . . . . . . 12 ⊢ (𝜑 → sup(ran 𝐺, ℝ, < ) ∈ ℝ)
26	20, 25	eqeltrid 2866	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℝ)
27	26	recnd 11262	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℂ)
28	27	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑁 ∈ ℂ)
29		0red 11236	. . . . . . . . . . . . 13 ⊢ (𝜑 → 0 ∈ ℝ)
30	17, 22	ffvelcdmd 7081	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺‘𝑆) ∈ ℝ)
31	6, 8	sseldd 3935	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
32	3, 4, 5, 31	fcnre 45844	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹:𝑇⟶ℝ)
33	32, 22	ffvelcdmd 7081	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐹‘𝑆) ∈ ℝ)
34		stoweidlem36.19	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐹‘𝑆) ≠ (𝐹‘𝑍))
35		stoweidlem36.20	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐹‘𝑍) = 0)
36	34, 35	neeqtrd 3026	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐹‘𝑆) ≠ 0)
37	33, 36	msqgt0d 11806	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 0 < ((𝐹‘𝑆) · (𝐹‘𝑆)))
38	33, 33	remulcld 11264	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝐹‘𝑆) · (𝐹‘𝑆)) ∈ ℝ)
39		nfcv 2924	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑡𝑆
40	9, 39	nffv 6892	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑡(𝐹‘𝑆)
41		nfcv 2924	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑡 ·
42	40, 41, 40	nfov 7446	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑡((𝐹‘𝑆) · (𝐹‘𝑆))
43		fveq2 6882	. . . . . . . . . . . . . . . . 17 ⊢ (𝑡 = 𝑆 → (𝐹‘𝑡) = (𝐹‘𝑆))
44	43, 43	oveq12d 7434	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 = 𝑆 → ((𝐹‘𝑡) · (𝐹‘𝑡)) = ((𝐹‘𝑆) · (𝐹‘𝑆)))
45	39, 42, 44, 7	fvmptf 7012	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ∈ 𝑇 ∧ ((𝐹‘𝑆) · (𝐹‘𝑆)) ∈ ℝ) → (𝐺‘𝑆) = ((𝐹‘𝑆) · (𝐹‘𝑆)))
46	22, 38, 45	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐺‘𝑆) = ((𝐹‘𝑆) · (𝐹‘𝑆)))
47	37, 46	breqtrrd 5137	. . . . . . . . . . . . 13 ⊢ (𝜑 → 0 < (𝐺‘𝑆))
48	24	simp3d 1162	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑠 ∈ 𝑇 (𝐺‘𝑠) ≤ sup(ran 𝐺, ℝ, < ))
49		fveq2 6882	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑆 → (𝐺‘𝑠) = (𝐺‘𝑆))
50	49	breq1d 5117	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑆 → ((𝐺‘𝑠) ≤ sup(ran 𝐺, ℝ, < ) ↔ (𝐺‘𝑆) ≤ sup(ran 𝐺, ℝ, < )))
51	50	rspccva 3578	. . . . . . . . . . . . . 14 ⊢ ((∀𝑠 ∈ 𝑇 (𝐺‘𝑠) ≤ sup(ran 𝐺, ℝ, < ) ∧ 𝑆 ∈ 𝑇) → (𝐺‘𝑆) ≤ sup(ran 𝐺, ℝ, < ))
52	48, 22, 51	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺‘𝑆) ≤ sup(ran 𝐺, ℝ, < ))
53	29, 30, 25, 47, 52	ltletrd 11395	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 < sup(ran 𝐺, ℝ, < ))
54	53	gt0ne0d 11803	. . . . . . . . . . 11 ⊢ (𝜑 → sup(ran 𝐺, ℝ, < ) ≠ 0)
55	20	neeq1i 3021	. . . . . . . . . . 11 ⊢ (𝑁 ≠ 0 ↔ sup(ran 𝐺, ℝ, < ) ≠ 0)
56	54, 55	sylibr 237	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ≠ 0)
57	56	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑁 ≠ 0)
58	19, 28, 57	divrecd 12019	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) / 𝑁) = ((𝐺‘𝑡) · (1 / 𝑁)))
59		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑇)
60	26, 56	rereccld 12067	. . . . . . . . . . 11 ⊢ (𝜑 → (1 / 𝑁) ∈ ℝ)
61	60	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 / 𝑁) ∈ ℝ)
62		eqid 2762	. . . . . . . . . . 11 ⊢ (𝑡 ∈ 𝑇 ↦ (1 / 𝑁)) = (𝑡 ∈ 𝑇 ↦ (1 / 𝑁))
63	62	fvmpt2 7002	. . . . . . . . . 10 ⊢ ((𝑡 ∈ 𝑇 ∧ (1 / 𝑁) ∈ ℝ) → ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡) = (1 / 𝑁))
64	59, 61, 63	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡) = (1 / 𝑁))
65	64	oveq2d 7432	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) · ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡)) = ((𝐺‘𝑡) · (1 / 𝑁)))
66	58, 65	eqtr4d 2800	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) / 𝑁) = ((𝐺‘𝑡) · ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡)))
67	2, 66	mpteq2da 5201	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) / 𝑁)) = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) · ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡))))
68	1, 67	eqtrid 2809	. . . . 5 ⊢ (𝜑 → 𝐻 = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) · ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡))))
69		stoweidlem36.15	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
70	69	stoweidlem4 46817	. . . . . . 7 ⊢ ((𝜑 ∧ (1 / 𝑁) ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ (1 / 𝑁)) ∈ 𝐴)
71	60, 70	mpdan 700	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ (1 / 𝑁)) ∈ 𝐴)
72		stoweidlem36.4	. . . . . . . 8 ⊢ Ⅎ𝑡𝐺
73	72	nfeq2 2941	. . . . . . 7 ⊢ Ⅎ𝑡 𝑓 = 𝐺
74		nfmpt1 5208	. . . . . . . 8 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ (1 / 𝑁))
75	74	nfeq2 2941	. . . . . . 7 ⊢ Ⅎ𝑡 𝑔 = (𝑡 ∈ 𝑇 ↦ (1 / 𝑁))
76	73, 75, 12	stoweidlem6 46819	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ 𝐴 ∧ (𝑡 ∈ 𝑇 ↦ (1 / 𝑁)) ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) · ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡))) ∈ 𝐴)
77	15, 71, 76	mpd3an23 1492	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) · ((𝑡 ∈ 𝑇 ↦ (1 / 𝑁))‘𝑡))) ∈ 𝐴)
78	68, 77	eqeltrd 2862	. . . 4 ⊢ (𝜑 → 𝐻 ∈ 𝐴)
79		stoweidlem36.17	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ 𝑇)
80	17, 79	ffvelcdmd 7081	. . . . . . . 8 ⊢ (𝜑 → (𝐺‘𝑍) ∈ ℝ)
81	80, 26, 56	redivcld 12068	. . . . . . 7 ⊢ (𝜑 → ((𝐺‘𝑍) / 𝑁) ∈ ℝ)
82		nfcv 2924	. . . . . . . 8 ⊢ Ⅎ𝑡𝑍
83	72, 82	nffv 6892	. . . . . . . . 9 ⊢ Ⅎ𝑡(𝐺‘𝑍)
84		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑡 /
85		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑡𝑁
86	83, 84, 85	nfov 7446	. . . . . . . 8 ⊢ Ⅎ𝑡((𝐺‘𝑍) / 𝑁)
87		fveq2 6882	. . . . . . . . 9 ⊢ (𝑡 = 𝑍 → (𝐺‘𝑡) = (𝐺‘𝑍))
88	87	oveq1d 7431	. . . . . . . 8 ⊢ (𝑡 = 𝑍 → ((𝐺‘𝑡) / 𝑁) = ((𝐺‘𝑍) / 𝑁))
89	82, 86, 88, 1	fvmptf 7012	. . . . . . 7 ⊢ ((𝑍 ∈ 𝑇 ∧ ((𝐺‘𝑍) / 𝑁) ∈ ℝ) → (𝐻‘𝑍) = ((𝐺‘𝑍) / 𝑁))
90	79, 81, 89	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝐻‘𝑍) = ((𝐺‘𝑍) / 𝑁))
91		0re 11235	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
92	35, 91	eqeltrdi 2870	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹‘𝑍) ∈ ℝ)
93	92, 92	remulcld 11264	. . . . . . . . 9 ⊢ (𝜑 → ((𝐹‘𝑍) · (𝐹‘𝑍)) ∈ ℝ)
94	9, 82	nffv 6892	. . . . . . . . . . 11 ⊢ Ⅎ𝑡(𝐹‘𝑍)
95	94, 41, 94	nfov 7446	. . . . . . . . . 10 ⊢ Ⅎ𝑡((𝐹‘𝑍) · (𝐹‘𝑍))
96		fveq2 6882	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑍 → (𝐹‘𝑡) = (𝐹‘𝑍))
97	96, 96	oveq12d 7434	. . . . . . . . . 10 ⊢ (𝑡 = 𝑍 → ((𝐹‘𝑡) · (𝐹‘𝑡)) = ((𝐹‘𝑍) · (𝐹‘𝑍)))
98	82, 95, 97, 7	fvmptf 7012	. . . . . . . . 9 ⊢ ((𝑍 ∈ 𝑇 ∧ ((𝐹‘𝑍) · (𝐹‘𝑍)) ∈ ℝ) → (𝐺‘𝑍) = ((𝐹‘𝑍) · (𝐹‘𝑍)))
99	79, 93, 98	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝐺‘𝑍) = ((𝐹‘𝑍) · (𝐹‘𝑍)))
100	35, 35	oveq12d 7434	. . . . . . . . 9 ⊢ (𝜑 → ((𝐹‘𝑍) · (𝐹‘𝑍)) = (0 · 0))
101		0cn 11223	. . . . . . . . . 10 ⊢ 0 ∈ ℂ
102	101	mul02i 11424	. . . . . . . . 9 ⊢ (0 · 0) = 0
103	100, 102	eqtrdi 2813	. . . . . . . 8 ⊢ (𝜑 → ((𝐹‘𝑍) · (𝐹‘𝑍)) = 0)
104	99, 103	eqtrd 2797	. . . . . . 7 ⊢ (𝜑 → (𝐺‘𝑍) = 0)
105	104	oveq1d 7431	. . . . . 6 ⊢ (𝜑 → ((𝐺‘𝑍) / 𝑁) = (0 / 𝑁))
106	27, 56	div0d 12015	. . . . . 6 ⊢ (𝜑 → (0 / 𝑁) = 0)
107	90, 105, 106	3eqtrd 2801	. . . . 5 ⊢ (𝜑 → (𝐻‘𝑍) = 0)
108	32	ffvelcdmda 7080	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) ∈ ℝ)
109	108	msqge0d 11807	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ ((𝐹‘𝑡) · (𝐹‘𝑡)))
110	108, 108	remulcld 11264	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐹‘𝑡) · (𝐹‘𝑡)) ∈ ℝ)
111	7	fvmpt2 7002	. . . . . . . . . . . 12 ⊢ ((𝑡 ∈ 𝑇 ∧ ((𝐹‘𝑡) · (𝐹‘𝑡)) ∈ ℝ) → (𝐺‘𝑡) = ((𝐹‘𝑡) · (𝐹‘𝑡)))
112	59, 110, 111	syl2anc 596	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) = ((𝐹‘𝑡) · (𝐹‘𝑡)))
113	109, 112	breqtrrd 5137	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝐺‘𝑡))
114	26	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑁 ∈ ℝ)
115	53, 20	breqtrrdi 5151	. . . . . . . . . . 11 ⊢ (𝜑 → 0 < 𝑁)
116	115	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 < 𝑁)
117		divge0 12109	. . . . . . . . . 10 ⊢ ((((𝐺‘𝑡) ∈ ℝ ∧ 0 ≤ (𝐺‘𝑡)) ∧ (𝑁 ∈ ℝ ∧ 0 < 𝑁)) → 0 ≤ ((𝐺‘𝑡) / 𝑁))
118	18, 113, 114, 116, 117	syl22anc 852	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ ((𝐺‘𝑡) / 𝑁))
119	18, 114, 57	redivcld 12068	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) / 𝑁) ∈ ℝ)
120	1	fvmpt2 7002	. . . . . . . . . 10 ⊢ ((𝑡 ∈ 𝑇 ∧ ((𝐺‘𝑡) / 𝑁) ∈ ℝ) → (𝐻‘𝑡) = ((𝐺‘𝑡) / 𝑁))
121	59, 119, 120	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐻‘𝑡) = ((𝐺‘𝑡) / 𝑁))
122	118, 121	breqtrrd 5137	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝐻‘𝑡))
123	19	div1d 12008	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) / 1) = (𝐺‘𝑡))
124		fveq2 6882	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑡 → (𝐺‘𝑠) = (𝐺‘𝑡))
125	124	breq1d 5117	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑡 → ((𝐺‘𝑠) ≤ sup(ran 𝐺, ℝ, < ) ↔ (𝐺‘𝑡) ≤ sup(ran 𝐺, ℝ, < )))
126	125	rspccva 3578	. . . . . . . . . . . . 13 ⊢ ((∀𝑠 ∈ 𝑇 (𝐺‘𝑠) ≤ sup(ran 𝐺, ℝ, < ) ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ≤ sup(ran 𝐺, ℝ, < ))
127	48, 126	sylan 592	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ≤ sup(ran 𝐺, ℝ, < ))
128	127, 20	breqtrrdi 5151	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ≤ 𝑁)
129	123, 128	eqbrtrd 5131	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) / 1) ≤ 𝑁)
130		1red 11234	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 ∈ ℝ)
131		0lt1 11761	. . . . . . . . . . . 12 ⊢ 0 < 1
132	131	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 < 1)
133		lediv23 12132	. . . . . . . . . . 11 ⊢ (((𝐺‘𝑡) ∈ ℝ ∧ (𝑁 ∈ ℝ ∧ 0 < 𝑁) ∧ (1 ∈ ℝ ∧ 0 < 1)) → (((𝐺‘𝑡) / 𝑁) ≤ 1 ↔ ((𝐺‘𝑡) / 1) ≤ 𝑁))
134	18, 114, 116, 130, 132, 133	syl122anc 1406	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (((𝐺‘𝑡) / 𝑁) ≤ 1 ↔ ((𝐺‘𝑡) / 1) ≤ 𝑁))
135	129, 134	mpbird 260	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑡) / 𝑁) ≤ 1)
136	121, 135	eqbrtrd 5131	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐻‘𝑡) ≤ 1)
137	122, 136	jca 521	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1))
138	137	ex 418	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 → (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1)))
139	2, 138	ralrimi 3262	. . . . 5 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1))
140	107, 139	jca 521	. . . 4 ⊢ (𝜑 → ((𝐻‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1)))
141		fveq1 6881	. . . . . . 7 ⊢ (ℎ = 𝐻 → (ℎ‘𝑍) = (𝐻‘𝑍))
142	141	eqeq1d 2764	. . . . . 6 ⊢ (ℎ = 𝐻 → ((ℎ‘𝑍) = 0 ↔ (𝐻‘𝑍) = 0))
143		stoweidlem36.2	. . . . . . . 8 ⊢ Ⅎ𝑡𝐻
144	143	nfeq2 2941	. . . . . . 7 ⊢ Ⅎ𝑡 ℎ = 𝐻
145		fveq1 6881	. . . . . . . . 9 ⊢ (ℎ = 𝐻 → (ℎ‘𝑡) = (𝐻‘𝑡))
146	145	breq2d 5119	. . . . . . . 8 ⊢ (ℎ = 𝐻 → (0 ≤ (ℎ‘𝑡) ↔ 0 ≤ (𝐻‘𝑡)))
147	145	breq1d 5117	. . . . . . . 8 ⊢ (ℎ = 𝐻 → ((ℎ‘𝑡) ≤ 1 ↔ (𝐻‘𝑡) ≤ 1))
148	146, 147	anbi12d 644	. . . . . . 7 ⊢ (ℎ = 𝐻 → ((0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1)))
149	144, 148	ralbid 3277	. . . . . 6 ⊢ (ℎ = 𝐻 → (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1)))
150	142, 149	anbi12d 644	. . . . 5 ⊢ (ℎ = 𝐻 → (((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)) ↔ ((𝐻‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1))))
151	150	elrab 3648	. . . 4 ⊢ (𝐻 ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} ↔ (𝐻 ∈ 𝐴 ∧ ((𝐻‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (𝐻‘𝑡) ∧ (𝐻‘𝑡) ≤ 1))))
152	78, 140, 151	sylanbrc 595	. . 3 ⊢ (𝜑 → 𝐻 ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))})
153		stoweidlem36.7	. . 3 ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
154	152, 153	eleqtrrdi 2873	. 2 ⊢ (𝜑 → 𝐻 ∈ 𝑄)
155	30, 26, 47, 115	divgt0d 12175	. . 3 ⊢ (𝜑 → 0 < ((𝐺‘𝑆) / 𝑁))
156	30, 26, 56	redivcld 12068	. . . 4 ⊢ (𝜑 → ((𝐺‘𝑆) / 𝑁) ∈ ℝ)
157	72, 39	nffv 6892	. . . . . 6 ⊢ Ⅎ𝑡(𝐺‘𝑆)
158	157, 84, 85	nfov 7446	. . . . 5 ⊢ Ⅎ𝑡((𝐺‘𝑆) / 𝑁)
159		fveq2 6882	. . . . . 6 ⊢ (𝑡 = 𝑆 → (𝐺‘𝑡) = (𝐺‘𝑆))
160	159	oveq1d 7431	. . . . 5 ⊢ (𝑡 = 𝑆 → ((𝐺‘𝑡) / 𝑁) = ((𝐺‘𝑆) / 𝑁))
161	39, 158, 160, 1	fvmptf 7012	. . . 4 ⊢ ((𝑆 ∈ 𝑇 ∧ ((𝐺‘𝑆) / 𝑁) ∈ ℝ) → (𝐻‘𝑆) = ((𝐺‘𝑆) / 𝑁))
162	22, 156, 161	syl2anc 596	. . 3 ⊢ (𝜑 → (𝐻‘𝑆) = ((𝐺‘𝑆) / 𝑁))
163	155, 162	breqtrrd 5137	. 2 ⊢ (𝜑 → 0 < (𝐻‘𝑆))
164		nfcv 2924	. . . 4 ⊢ Ⅎℎ𝐻
165		stoweidlem36.1	. . . . . 6 ⊢ Ⅎℎ𝑄
166	165	nfel2 2942	. . . . 5 ⊢ Ⅎℎ 𝐻 ∈ 𝑄
167		nfv 1947	. . . . 5 ⊢ Ⅎℎ0 < (𝐻‘𝑆)
168	166, 167	nfan 1932	. . . 4 ⊢ Ⅎℎ(𝐻 ∈ 𝑄 ∧ 0 < (𝐻‘𝑆))
169		eleq1 2850	. . . . 5 ⊢ (ℎ = 𝐻 → (ℎ ∈ 𝑄 ↔ 𝐻 ∈ 𝑄))
170		fveq1 6881	. . . . . 6 ⊢ (ℎ = 𝐻 → (ℎ‘𝑆) = (𝐻‘𝑆))
171	170	breq2d 5119	. . . . 5 ⊢ (ℎ = 𝐻 → (0 < (ℎ‘𝑆) ↔ 0 < (𝐻‘𝑆)))
172	169, 171	anbi12d 644	. . . 4 ⊢ (ℎ = 𝐻 → ((ℎ ∈ 𝑄 ∧ 0 < (ℎ‘𝑆)) ↔ (𝐻 ∈ 𝑄 ∧ 0 < (𝐻‘𝑆))))
173	164, 168, 172	spcegf 3549	. . 3 ⊢ (𝐻 ∈ 𝑄 → ((𝐻 ∈ 𝑄 ∧ 0 < (𝐻‘𝑆)) → ∃ℎ(ℎ ∈ 𝑄 ∧ 0 < (ℎ‘𝑆))))
174	173	anabsi5 682	. 2 ⊢ ((𝐻 ∈ 𝑄 ∧ 0 < (𝐻‘𝑆)) → ∃ℎ(ℎ ∈ 𝑄 ∧ 0 < (ℎ‘𝑆)))
175	154, 163, 174	syl2anc 596	1 ⊢ (𝜑 → ∃ℎ(ℎ ∈ 𝑄 ∧ 0 < (ℎ‘𝑆)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 Ⅎwnf 1816 ∈ wcel 2145 Ⅎwnfc 2909 ≠ wne 2957 ∀wral 3078 {crab 3414 ⊆ wss 3902 ∪ cuni 4870 class class class wbr 5107 ↦ cmpt 5190 ran crn 5660 ‘cfv 6537 (class class class)co 7416 supcsup 9413 ℂcc 11123 ℝcr 11124 0cc0 11125 1c1 11126 · cmul 11130 < clt 11268 ≤ cle 11269 / cdiv 11896 (,)cioo 13398 topGenctg 17524 Cn ccn 23448 Compccmp 23610

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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 ax-pre-sup 11203

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7681 df-om 7866 df-1st 7989 df-2nd 7990 df-supp 8162 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-2o 8459 df-er 8699 df-map 8831 df-ixp 8908 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-fsupp 9335 df-fi 9384 df-sup 9415 df-inf 9416 df-oi 9485 df-card 9947 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-div 11897 df-nn 12259 df-2 12328 df-3 12329 df-4 12330 df-5 12331 df-6 12332 df-7 12333 df-8 12334 df-9 12335 df-n0 12530 df-z 12617 df-dec 12738 df-uz 12889 df-q 12999 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-ioo 13402 df-icc 13405 df-fz 13562 df-fzo 13710 df-seq 14066 df-exp 14126 df-hash 14395 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-struct 17241 df-sets 17258 df-slot 17276 df-ndx 17288 df-base 17304 df-ress 17325 df-plusg 17357 df-mulr 17358 df-starv 17359 df-sca 17360 df-vsca 17361 df-ip 17362 df-tset 17363 df-ple 17364 df-ds 17366 df-unif 17367 df-hom 17368 df-cco 17369 df-rest 17509 df-topn 17510 df-0g 17528 df-gsum 17529 df-topgen 17530 df-pt 17531 df-prds 17534 df-xrs 17590 df-qtop 17595 df-imas 17596 df-xps 17598 df-mre 17672 df-mrc 17673 df-acs 17675 df-mgm 18732 df-sgrp 18821 df-mnd 18837 df-submnd 18891 df-mulg 19190 df-cntz 19443 df-cmn 19908 df-psmet 21576 df-xmet 21577 df-met 21578 df-bl 21579 df-mopn 21580 df-cnfld 21585 df-top 23118 df-topon 23135 df-topsp 23157 df-bases 23170 df-cn 23451 df-cnp 23452 df-cmp 23611 df-tx 23787 df-hmeo 23980 df-xms 24545 df-ms 24546 df-tms 24547

This theorem is used by: stoweidlem43 46856

W3C validator