Theorem stoweidlem44 38937

Description: This lemma is used to prove the existence of a function p as in Lemma 1 of [BrosowskiDeutsh] p. 90: p is in the subalgebra, such that 0 <= p <= 1, p_(t_0) = 0, and p > 0 on T - U. Z is used to represent t₀ in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem44.1	⊢ Ⅎ𝑗𝜑
stoweidlem44.2	⊢ Ⅎ𝑡𝜑
stoweidlem44.3	⊢ 𝐾 = (topGen‘ran (,))
stoweidlem44.4	⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
stoweidlem44.5	⊢ 𝑃 = (𝑡 ∈ 𝑇 ↦ ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
stoweidlem44.6	⊢ (𝜑 → 𝑀 ∈ ℕ)
stoweidlem44.7	⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
stoweidlem44.8	⊢ (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑗 ∈ (1...𝑀)0 < ((𝐺‘𝑗)‘𝑡))
stoweidlem44.9	⊢ 𝑇 = ∪ 𝐽
stoweidlem44.10	⊢ (𝜑 → 𝐴 ⊆ (𝐽 Cn 𝐾))
stoweidlem44.11	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem44.12	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem44.13	⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
stoweidlem44.14	⊢ (𝜑 → 𝑍 ∈ 𝑇)

Assertion

Ref	Expression
stoweidlem44	⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))

Distinct variable groups:   𝑓,𝑔,𝑖,𝑡,𝐺   𝑓,𝑗,𝑖,𝑡,𝐺   𝐴,𝑓,𝑔   𝑓,𝑀,𝑔,𝑖,𝑡   𝑇,𝑓,𝑔,𝑖,𝑡   𝜑,𝑓,𝑔,𝑖   ℎ,𝑖,𝑗,𝑡,𝐺   𝐴,ℎ   𝑇,ℎ,𝑗   ℎ,𝑍,𝑖,𝑡   𝑥,𝑗,𝑀,𝑡   𝑈,𝑗   𝑡,𝑝,𝑇   𝐴,𝑝   𝑃,𝑝   𝑈,𝑝   𝑍,𝑝   𝑥,𝐴   𝑥,𝑇   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑡,ℎ,𝑗,𝑝)   𝐴(𝑡,𝑖,𝑗)   𝑃(𝑥,𝑡,𝑓,𝑔,ℎ,𝑖,𝑗)   𝑄(𝑥,𝑡,𝑓,𝑔,ℎ,𝑖,𝑗,𝑝)   𝑈(𝑥,𝑡,𝑓,𝑔,ℎ,𝑖)   𝐺(𝑥,𝑝)   𝐽(𝑥,𝑡,𝑓,𝑔,ℎ,𝑖,𝑗,𝑝)   𝐾(𝑥,𝑡,𝑓,𝑔,ℎ,𝑖,𝑗,𝑝)   𝑀(ℎ,𝑝)   𝑍(𝑥,𝑓,𝑔,𝑗)

Proof of Theorem stoweidlem44

Step	Hyp	Ref	Expression
1		stoweidlem44.2	. . . 4 ⊢ Ⅎ𝑡𝜑
2		stoweidlem44.5	. . . 4 ⊢ 𝑃 = (𝑡 ∈ 𝑇 ↦ ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
3		eqid 2610	. . . 4 ⊢ (𝑡 ∈ 𝑇 ↦ Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)) = (𝑡 ∈ 𝑇 ↦ Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡))
4		eqid 2610	. . . 4 ⊢ (𝑡 ∈ 𝑇 ↦ (1 / 𝑀)) = (𝑡 ∈ 𝑇 ↦ (1 / 𝑀))
5		stoweidlem44.6	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
6	5	nnrecred 10943	. . . 4 ⊢ (𝜑 → (1 / 𝑀) ∈ ℝ)
7		stoweidlem44.7	. . . . 5 ⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
8		stoweidlem44.4	. . . . . 6 ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
9		ssrab2 3650	. . . . . 6 ⊢ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} ⊆ 𝐴
10	8, 9	eqsstri 3598	. . . . 5 ⊢ 𝑄 ⊆ 𝐴
11		fss 5969	. . . . 5 ⊢ ((𝐺:(1...𝑀)⟶𝑄 ∧ 𝑄 ⊆ 𝐴) → 𝐺:(1...𝑀)⟶𝐴)
12	7, 10, 11	sylancl 693	. . . 4 ⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝐴)
13		stoweidlem44.11	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
14		stoweidlem44.12	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
15		stoweidlem44.13	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
16		stoweidlem44.3	. . . . 5 ⊢ 𝐾 = (topGen‘ran (,))
17		stoweidlem44.9	. . . . 5 ⊢ 𝑇 = ∪ 𝐽
18		eqid 2610	. . . . 5 ⊢ (𝐽 Cn 𝐾) = (𝐽 Cn 𝐾)
19		stoweidlem44.10	. . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ (𝐽 Cn 𝐾))
20	19	sselda 3568	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓 ∈ (𝐽 Cn 𝐾))
21	16, 17, 18, 20	fcnre 38207	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
22	1, 2, 3, 4, 5, 6, 12, 13, 14, 15, 21	stoweidlem32 38925	. . 3 ⊢ (𝜑 → 𝑃 ∈ 𝐴)
23	8, 2, 5, 7, 21	stoweidlem38 38931	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1))
24	23	ex 449	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ 𝑇 → (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1)))
25	1, 24	ralrimi 2940	. . . 4 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1))
26		stoweidlem44.14	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑇)
27	8, 2, 5, 7, 21, 26	stoweidlem37 38930	. . . 4 ⊢ (𝜑 → (𝑃‘𝑍) = 0)
28		stoweidlem44.1	. . . . . . . . 9 ⊢ Ⅎ𝑗𝜑
29		nfv 1830	. . . . . . . . 9 ⊢ Ⅎ𝑗 𝑡 ∈ (𝑇 ∖ 𝑈)
30	28, 29	nfan 1816	. . . . . . . 8 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈))
31		nfv 1830	. . . . . . . 8 ⊢ Ⅎ𝑗0 < ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡))
32		stoweidlem44.8	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑗 ∈ (1...𝑀)0 < ((𝐺‘𝑗)‘𝑡))
33	32	r19.21bi 2916	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → ∃𝑗 ∈ (1...𝑀)0 < ((𝐺‘𝑗)‘𝑡))
34		df-rex 2902	. . . . . . . . 9 ⊢ (∃𝑗 ∈ (1...𝑀)0 < ((𝐺‘𝑗)‘𝑡) ↔ ∃𝑗(𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡)))
35	33, 34	sylib 207	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → ∃𝑗(𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡)))
36	6	ad2antrr 758	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → (1 / 𝑀) ∈ ℝ)
37		simpll 786	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 𝜑)
38		eldifi 3694	. . . . . . . . . . 11 ⊢ (𝑡 ∈ (𝑇 ∖ 𝑈) → 𝑡 ∈ 𝑇)
39	38	ad2antlr 759	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 𝑡 ∈ 𝑇)
40		fzfid 12634	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1...𝑀) ∈ Fin)
41	8, 7, 21	stoweidlem15 38908	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ (1...𝑀)) ∧ 𝑡 ∈ 𝑇) → (((𝐺‘𝑖)‘𝑡) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1))
42	41	an32s 842	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑀)) → (((𝐺‘𝑖)‘𝑡) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1))
43	42	simp1d 1066	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑀)) → ((𝐺‘𝑖)‘𝑡) ∈ ℝ)
44	40, 43	fsumrecl 14312	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡) ∈ ℝ)
45	37, 39, 44	syl2anc 691	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡) ∈ ℝ)
46	5	nnred 10912	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℝ)
47	5	nngt0d 10941	. . . . . . . . . . 11 ⊢ (𝜑 → 0 < 𝑀)
48	46, 47	recgt0d 10837	. . . . . . . . . 10 ⊢ (𝜑 → 0 < (1 / 𝑀))
49	48	ad2antrr 758	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < (1 / 𝑀))
50		0red 9920	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 ∈ ℝ)
51		simprl 790	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 𝑗 ∈ (1...𝑀))
52	37, 51, 39	3jca 1235	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → (𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇))
53		snfi 7923	. . . . . . . . . . . . . . 15 ⊢ {𝑗} ∈ Fin
54	53	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → {𝑗} ∈ Fin)
55		simpl1 1057	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ {𝑗}) → 𝜑)
56		simpl3 1059	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ {𝑗}) → 𝑡 ∈ 𝑇)
57		elsni 4142	. . . . . . . . . . . . . . . . 17 ⊢ (𝑖 ∈ {𝑗} → 𝑖 = 𝑗)
58	57	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ {𝑗}) → 𝑖 = 𝑗)
59		simpl2 1058	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ {𝑗}) → 𝑗 ∈ (1...𝑀))
60	58, 59	eqeltrd 2688	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ {𝑗}) → 𝑖 ∈ (1...𝑀))
61	55, 56, 60, 43	syl21anc 1317	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ {𝑗}) → ((𝐺‘𝑖)‘𝑡) ∈ ℝ)
62	54, 61	fsumrecl 14312	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡) ∈ ℝ)
63	52, 62	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡) ∈ ℝ)
64	50, 63	readdcld 9948	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → (0 + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)) ∈ ℝ)
65		fzfi 12633	. . . . . . . . . . . . . . 15 ⊢ (1...𝑀) ∈ Fin
66		diffi 8077	. . . . . . . . . . . . . . 15 ⊢ ((1...𝑀) ∈ Fin → ((1...𝑀) ∖ {𝑗}) ∈ Fin)
67	65, 66	mp1i 13	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((1...𝑀) ∖ {𝑗}) ∈ Fin)
68		eldifi 3694	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ((1...𝑀) ∖ {𝑗}) → 𝑖 ∈ (1...𝑀))
69	68, 43	sylan2 490	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ ((1...𝑀) ∖ {𝑗})) → ((𝐺‘𝑖)‘𝑡) ∈ ℝ)
70	67, 69	fsumrecl 14312	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) ∈ ℝ)
71	37, 39, 70	syl2anc 691	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) ∈ ℝ)
72	71, 63	readdcld 9948	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → (Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)) ∈ ℝ)
73		00id 10090	. . . . . . . . . . . 12 ⊢ (0 + 0) = 0
74		simprr 792	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < ((𝐺‘𝑗)‘𝑡))
75	8, 7, 21	stoweidlem15 38908	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀)) ∧ 𝑡 ∈ 𝑇) → (((𝐺‘𝑗)‘𝑡) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝑗)‘𝑡) ∧ ((𝐺‘𝑗)‘𝑡) ≤ 1))
76	75	simp1d 1066	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀)) ∧ 𝑡 ∈ 𝑇) → ((𝐺‘𝑗)‘𝑡) ∈ ℝ)
77	37, 51, 39, 76	syl21anc 1317	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → ((𝐺‘𝑗)‘𝑡) ∈ ℝ)
78	77	recnd 9947	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → ((𝐺‘𝑗)‘𝑡) ∈ ℂ)
79		fveq2 6103	. . . . . . . . . . . . . . . . 17 ⊢ (𝑖 = 𝑗 → (𝐺‘𝑖) = (𝐺‘𝑗))
80	79	fveq1d 6105	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 = 𝑗 → ((𝐺‘𝑖)‘𝑡) = ((𝐺‘𝑗)‘𝑡))
81	80	sumsn 14319	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ (1...𝑀) ∧ ((𝐺‘𝑗)‘𝑡) ∈ ℂ) → Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡) = ((𝐺‘𝑗)‘𝑡))
82	51, 78, 81	syl2anc 691	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡) = ((𝐺‘𝑗)‘𝑡))
83	74, 82	breqtrrd 4611	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡))
84	50, 63, 50, 83	ltadd2dd 10075	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → (0 + 0) < (0 + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
85	73, 84	syl5eqbrr 4619	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < (0 + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
86		0red 9920	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → 0 ∈ ℝ)
87	70	3adant2 1073	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) ∈ ℝ)
88		simpll 786	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ ((1...𝑀) ∖ {𝑗})) → 𝜑)
89	68	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ ((1...𝑀) ∖ {𝑗})) → 𝑖 ∈ (1...𝑀))
90		simplr 788	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ ((1...𝑀) ∖ {𝑗})) → 𝑡 ∈ 𝑇)
91	88, 89, 90, 41	syl21anc 1317	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ ((1...𝑀) ∖ {𝑗})) → (((𝐺‘𝑖)‘𝑡) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1))
92	91	simp2d 1067	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ ((1...𝑀) ∖ {𝑗})) → 0 ≤ ((𝐺‘𝑖)‘𝑡))
93	67, 69, 92	fsumge0 14368	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡))
94	93	3adant2 1073	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → 0 ≤ Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡))
95	86, 87, 62, 94	leadd1dd 10520	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → (0 + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)) ≤ (Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
96	52, 95	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → (0 + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)) ≤ (Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
97	50, 64, 72, 85, 96	ltletrd 10076	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < (Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
98		eq0 3888	. . . . . . . . . . . . . 14 ⊢ ((((1...𝑀) ∖ {𝑗}) ∩ {𝑗}) = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ (((1...𝑀) ∖ {𝑗}) ∩ {𝑗}))
99		eldifn 3695	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ((1...𝑀) ∖ {𝑗}) → ¬ 𝑥 ∈ {𝑗})
100		imnan 437	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ((1...𝑀) ∖ {𝑗}) → ¬ 𝑥 ∈ {𝑗}) ↔ ¬ (𝑥 ∈ ((1...𝑀) ∖ {𝑗}) ∧ 𝑥 ∈ {𝑗}))
101	99, 100	mpbi 219	. . . . . . . . . . . . . . 15 ⊢ ¬ (𝑥 ∈ ((1...𝑀) ∖ {𝑗}) ∧ 𝑥 ∈ {𝑗})
102		elin 3758	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (((1...𝑀) ∖ {𝑗}) ∩ {𝑗}) ↔ (𝑥 ∈ ((1...𝑀) ∖ {𝑗}) ∧ 𝑥 ∈ {𝑗}))
103	101, 102	mtbir 312	. . . . . . . . . . . . . 14 ⊢ ¬ 𝑥 ∈ (((1...𝑀) ∖ {𝑗}) ∩ {𝑗})
104	98, 103	mpgbir 1717	. . . . . . . . . . . . 13 ⊢ (((1...𝑀) ∖ {𝑗}) ∩ {𝑗}) = ∅
105	104	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → (((1...𝑀) ∖ {𝑗}) ∩ {𝑗}) = ∅)
106		undif1 3995	. . . . . . . . . . . . 13 ⊢ (((1...𝑀) ∖ {𝑗}) ∪ {𝑗}) = ((1...𝑀) ∪ {𝑗})
107		snssi 4280	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (1...𝑀) → {𝑗} ⊆ (1...𝑀))
108	107	3ad2ant2 1076	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → {𝑗} ⊆ (1...𝑀))
109		ssequn2 3748	. . . . . . . . . . . . . 14 ⊢ ({𝑗} ⊆ (1...𝑀) ↔ ((1...𝑀) ∪ {𝑗}) = (1...𝑀))
110	108, 109	sylib 207	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → ((1...𝑀) ∪ {𝑗}) = (1...𝑀))
111	106, 110	syl5req 2657	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → (1...𝑀) = (((1...𝑀) ∖ {𝑗}) ∪ {𝑗}))
112		fzfid 12634	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → (1...𝑀) ∈ Fin)
113	43	3adantl2 1211	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑀)) → ((𝐺‘𝑖)‘𝑡) ∈ ℝ)
114	113	recnd 9947	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) ∧ 𝑖 ∈ (1...𝑀)) → ((𝐺‘𝑖)‘𝑡) ∈ ℂ)
115	105, 111, 112, 114	fsumsplit 14318	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀) ∧ 𝑡 ∈ 𝑇) → Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡) = (Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
116	52, 115	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡) = (Σ𝑖 ∈ ((1...𝑀) ∖ {𝑗})((𝐺‘𝑖)‘𝑡) + Σ𝑖 ∈ {𝑗} ((𝐺‘𝑖)‘𝑡)))
117	97, 116	breqtrrd 4611	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡))
118	36, 45, 49, 117	mulgt0d 10071	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) ∧ (𝑗 ∈ (1...𝑀) ∧ 0 < ((𝐺‘𝑗)‘𝑡))) → 0 < ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
119	30, 31, 35, 118	exlimdd 2075	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → 0 < ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
120	8, 2, 5, 7, 21	stoweidlem30 38923	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑃‘𝑡) = ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
121	38, 120	sylan2 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (𝑃‘𝑡) = ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
122	119, 121	breqtrrd 4611	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → 0 < (𝑃‘𝑡))
123	122	ex 449	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ (𝑇 ∖ 𝑈) → 0 < (𝑃‘𝑡)))
124	1, 123	ralrimi 2940	. . . 4 ⊢ (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡))
125	25, 27, 124	3jca 1235	. . 3 ⊢ (𝜑 → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1) ∧ (𝑃‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡)))
126		eleq1 2676	. . . . . 6 ⊢ (𝑝 = 𝑃 → (𝑝 ∈ 𝐴 ↔ 𝑃 ∈ 𝐴))
127		nfmpt1 4675	. . . . . . . . . 10 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡)))
128	2, 127	nfcxfr 2749	. . . . . . . . 9 ⊢ Ⅎ𝑡𝑃
129	128	nfeq2 2766	. . . . . . . 8 ⊢ Ⅎ𝑡 𝑝 = 𝑃
130		fveq1 6102	. . . . . . . . . 10 ⊢ (𝑝 = 𝑃 → (𝑝‘𝑡) = (𝑃‘𝑡))
131	130	breq2d 4595	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → (0 ≤ (𝑝‘𝑡) ↔ 0 ≤ (𝑃‘𝑡)))
132	130	breq1d 4593	. . . . . . . . 9 ⊢ (𝑝 = 𝑃 → ((𝑝‘𝑡) ≤ 1 ↔ (𝑃‘𝑡) ≤ 1))
133	131, 132	anbi12d 743	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → ((0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ↔ (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1)))
134	129, 133	ralbid 2966	. . . . . . 7 ⊢ (𝑝 = 𝑃 → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1)))
135		fveq1 6102	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → (𝑝‘𝑍) = (𝑃‘𝑍))
136	135	eqeq1d 2612	. . . . . . 7 ⊢ (𝑝 = 𝑃 → ((𝑝‘𝑍) = 0 ↔ (𝑃‘𝑍) = 0))
137	130	breq2d 4595	. . . . . . . 8 ⊢ (𝑝 = 𝑃 → (0 < (𝑝‘𝑡) ↔ 0 < (𝑃‘𝑡)))
138	129, 137	ralbid 2966	. . . . . . 7 ⊢ (𝑝 = 𝑃 → (∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡) ↔ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡)))
139	134, 136, 138	3anbi123d 1391	. . . . . 6 ⊢ (𝑝 = 𝑃 → ((∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) ↔ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1) ∧ (𝑃‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡))))
140	126, 139	anbi12d 743	. . . . 5 ⊢ (𝑝 = 𝑃 → ((𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))) ↔ (𝑃 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1) ∧ (𝑃‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡)))))
141	140	spcegv 3267	. . . 4 ⊢ (𝑃 ∈ 𝐴 → ((𝑃 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1) ∧ (𝑃‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡))) → ∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))))
142	22, 141	syl 17	. . 3 ⊢ (𝜑 → ((𝑃 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1) ∧ (𝑃‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑃‘𝑡))) → ∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))))
143	22, 125, 142	mp2and 711	. 2 ⊢ (𝜑 → ∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))))
144		df-rex 2902	. 2 ⊢ (∃𝑝 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)) ↔ ∃𝑝(𝑝 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡))))
145	143, 144	sylibr 223	1 ⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑝‘𝑡) ∧ (𝑝‘𝑡) ≤ 1) ∧ (𝑝‘𝑍) = 0 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)0 < (𝑝‘𝑡)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475  ∃wex 1695  Ⅎwnf 1699   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  {crab 2900   ∖ cdif 3537   ∪ cun 3538   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  {csn 4125  ∪ cuni 4372   class class class wbr 4583   ↦ cmpt 4643  ran crn 5039  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  Fincfn 7841  ℂcc 9813  ℝcr 9814  0cc0 9815  1c1 9816   + caddc 9818   · cmul 9820   < clt 9953   ≤ cle 9954   / cdiv 10563  ℕcn 10897  (,)cioo 12046  ...cfz 12197  Σcsu 14264  topGenctg 15921   Cn ccn 20838

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-oi 8298  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-rp 11709  df-ioo 12050  df-ico 12052  df-fz 12198  df-fzo 12335  df-seq 12664  df-exp 12723  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-sum 14265  df-topgen 15927  df-top 20521  df-bases 20522  df-topon 20523  df-cn 20841

This theorem is referenced by:  stoweidlem53  38946