Theorem stoweidlem40 46814

Description: This lemma proves that q_n is in the subalgebra, as in the proof of Lemma 1 in [BrosowskiDeutsh] p. 90. Q is used to represent q_n in the paper, N is used to represent n in the paper, and M is used to represent k^n in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem40.1	⊢ Ⅎ𝑡𝑃
stoweidlem40.2	⊢ Ⅎ𝑡𝜑
stoweidlem40.3	⊢ 𝑄 = (𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑𝑀))
stoweidlem40.4	⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁)))
stoweidlem40.5	⊢ 𝐺 = (𝑡 ∈ 𝑇 ↦ 1)
stoweidlem40.6	⊢ 𝐻 = (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁))
stoweidlem40.7	⊢ (𝜑 → 𝑃 ∈ 𝐴)
stoweidlem40.8	⊢ (𝜑 → 𝑃:𝑇⟶ℝ)
stoweidlem40.9	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
stoweidlem40.10	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem40.11	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem40.12	⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
stoweidlem40.13	⊢ (𝜑 → 𝑁 ∈ ℕ)
stoweidlem40.14	⊢ (𝜑 → 𝑀 ∈ ℕ)

Assertion

Ref	Expression
stoweidlem40	⊢ (𝜑 → 𝑄 ∈ 𝐴)

Distinct variable groups:   𝑓,𝑔,𝑡,𝐴   𝑓,𝐹,𝑔   𝑓,𝐺,𝑔   𝑓,𝐻,𝑔   𝑃,𝑓,𝑔   𝑇,𝑓,𝑔,𝑡   𝜑,𝑓,𝑔   𝑥,𝑡,𝐴   𝑡,𝑀   𝑡,𝑁   𝑥,𝑇   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑡)   𝑃(𝑥, 𝑡)   𝑄(𝑥, 𝑡, 𝑓, 𝑔)   𝐹(𝑥, 𝑡)   𝐺(𝑥, 𝑡)   𝐻(𝑥, 𝑡)   𝑀(𝑥, 𝑓, 𝑔)   𝑁(𝑥, 𝑓, 𝑔)

Proof of Theorem stoweidlem40

Step	Hyp	Ref	Expression
1		stoweidlem40.3	. . 3 ⊢ 𝑄 = (𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑𝑀))
2		stoweidlem40.2	. . . 4 ⊢ Ⅎ𝑡𝜑
3		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑇)
4		1red 11226	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 ∈ ℝ)
5		stoweidlem40.8	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃:𝑇⟶ℝ)
6	5	ffvelcdmda 7083	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑃‘𝑡) ∈ ℝ)
7		stoweidlem40.13	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	nnnn0d 12582	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
9	8	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑁 ∈ ℕ0)
10	6, 9	reexpcld 14219	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑃‘𝑡)↑𝑁) ∈ ℝ)
11	4, 10	resubcld 11659	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) ∈ ℝ)
12		stoweidlem40.4	. . . . . . . 8 ⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁)))
13	12	fvmpt2 7005	. . . . . . 7 ⊢ ((𝑡 ∈ 𝑇 ∧ (1 − ((𝑃‘𝑡)↑𝑁)) ∈ ℝ) → (𝐹‘𝑡) = (1 − ((𝑃‘𝑡)↑𝑁)))
14	3, 11, 13	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) = (1 − ((𝑃‘𝑡)↑𝑁)))
15	14	eqcomd 2771	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) = (𝐹‘𝑡))
16	15	oveq1d 7434	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((1 − ((𝑃‘𝑡)↑𝑁))↑𝑀) = ((𝐹‘𝑡)↑𝑀))
17	2, 16	mpteq2da 5205	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑𝑀)) = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡)↑𝑀)))
18	1, 17	eqtrid 2812	. 2 ⊢ (𝜑 → 𝑄 = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡)↑𝑀)))
19		nfmpt1 5212	. . . 4 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁)))
20	12, 19	nfcxfr 2925	. . 3 ⊢ Ⅎ𝑡𝐹
21		stoweidlem40.9	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
22		stoweidlem40.11	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
23		stoweidlem40.12	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
24		1re 11225	. . . . . . . . . 10 ⊢ 1 ∈ ℝ
25		stoweidlem40.5	. . . . . . . . . . 11 ⊢ 𝐺 = (𝑡 ∈ 𝑇 ↦ 1)
26	25	fvmpt2 7005	. . . . . . . . . 10 ⊢ ((𝑡 ∈ 𝑇 ∧ 1 ∈ ℝ) → (𝐺‘𝑡) = 1)
27	24, 26	mpan2 704	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝑇 → (𝐺‘𝑡) = 1)
28	27	eqcomd 2771	. . . . . . . 8 ⊢ (𝑡 ∈ 𝑇 → 1 = (𝐺‘𝑡))
29	28	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 = (𝐺‘𝑡))
30		stoweidlem40.6	. . . . . . . . . 10 ⊢ 𝐻 = (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁))
31	30	fvmpt2 7005	. . . . . . . . 9 ⊢ ((𝑡 ∈ 𝑇 ∧ ((𝑃‘𝑡)↑𝑁) ∈ ℝ) → (𝐻‘𝑡) = ((𝑃‘𝑡)↑𝑁))
32	3, 10, 31	syl2anc 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐻‘𝑡) = ((𝑃‘𝑡)↑𝑁))
33	32	eqcomd 2771	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑃‘𝑡)↑𝑁) = (𝐻‘𝑡))
34	29, 33	oveq12d 7437	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) = ((𝐺‘𝑡) − (𝐻‘𝑡)))
35	2, 34	mpteq2da 5205	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁))) = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))))
36	12, 35	eqtrid 2812	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))))
37	23	stoweidlem4 46778	. . . . . . 7 ⊢ ((𝜑 ∧ 1 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
38	24, 37	mpan2 704	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
39	25, 38	eqeltrid 2869	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝐴)
40		stoweidlem40.1	. . . . . . 7 ⊢ Ⅎ𝑡𝑃
41		stoweidlem40.7	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ 𝐴)
42	40, 2, 21, 22, 23, 41, 8	stoweidlem19 46793	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁)) ∈ 𝐴)
43	30, 42	eqeltrid 2869	. . . . 5 ⊢ (𝜑 → 𝐻 ∈ 𝐴)
44		nfmpt1 5212	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ 1)
45	25, 44	nfcxfr 2925	. . . . . 6 ⊢ Ⅎ𝑡𝐺
46		nfmpt1 5212	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁))
47	30, 46	nfcxfr 2925	. . . . . 6 ⊢ Ⅎ𝑡𝐻
48		stoweidlem40.10	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
49	45, 47, 2, 21, 48, 22, 23	stoweidlem33 46807	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))) ∈ 𝐴)
50	39, 43, 49	mpd3an23 1492	. . . 4 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))) ∈ 𝐴)
51	36, 50	eqeltrd 2865	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐴)
52		stoweidlem40.14	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
53	52	nnnn0d 12582	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℕ0)
54	20, 2, 21, 22, 23, 51, 53	stoweidlem19 46793	. 2 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡)↑𝑀)) ∈ 𝐴)
55	18, 54	eqeltrd 2865	1 ⊢ (𝜑 → 𝑄 ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2146  Ⅎwnfc 2912   ↦ cmpt 5194  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  ℝcr 11116  1c1 11118   + caddc 11120   · cmul 11122   − cmin 11458  ℕcn 12250  ℕ₀cn0 12521  ↑cexp 14117

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-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11173  ax-resscn 11174  ax-1cn 11175  ax-icn 11176  ax-addcl 11177  ax-addrcl 11178  ax-mulcl 11179  ax-mulrcl 11180  ax-mulcom 11181  ax-addass 11182  ax-mulass 11183  ax-distr 11184  ax-i2m1 11185  ax-1ne0 11186  ax-1rid 11187  ax-rnegex 11188  ax-rrecex 11189  ax-cnre 11190  ax-pre-lttri 11191  ax-pre-lttrn 11192  ax-pre-ltadd 11193  ax-pre-mulgt0 11194

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-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-op 4598  df-uni 4875  df-iun 4960  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-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-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11262  df-mnf 11263  df-xr 11264  df-ltxr 11265  df-le 11266  df-sub 11460  df-neg 11461  df-nn 12251  df-n0 12522  df-z 12609  df-uz 12881  df-seq 14058  df-exp 14118

This theorem is used by:  stoweidlem45  46819