Theorem stoweidlem40 46069

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 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑇)
4		1red 11236	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 ∈ ℝ)
5		stoweidlem40.8	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃:𝑇⟶ℝ)
6	5	ffvelcdmda 7074	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑃‘𝑡) ∈ ℝ)
7		stoweidlem40.13	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ)
8	7	nnnn0d 12562	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
9	8	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑁 ∈ ℕ0)
10	6, 9	reexpcld 14181	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑃‘𝑡)↑𝑁) ∈ ℝ)
11	4, 10	resubcld 11665	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) ∈ ℝ)
12		stoweidlem40.4	. . . . . . . 8 ⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁)))
13	12	fvmpt2 6997	. . . . . . 7 ⊢ ((𝑡 ∈ 𝑇 ∧ (1 − ((𝑃‘𝑡)↑𝑁)) ∈ ℝ) → (𝐹‘𝑡) = (1 − ((𝑃‘𝑡)↑𝑁)))
14	3, 11, 13	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) = (1 − ((𝑃‘𝑡)↑𝑁)))
15	14	eqcomd 2741	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) = (𝐹‘𝑡))
16	15	oveq1d 7420	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((1 − ((𝑃‘𝑡)↑𝑁))↑𝑀) = ((𝐹‘𝑡)↑𝑀))
17	2, 16	mpteq2da 5213	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑𝑀)) = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡)↑𝑀)))
18	1, 17	eqtrid 2782	. 2 ⊢ (𝜑 → 𝑄 = (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡)↑𝑀)))
19		nfmpt1 5220	. . . 4 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁)))
20	12, 19	nfcxfr 2896	. . 3 ⊢ Ⅎ𝑡𝐹
21		stoweidlem40.9	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
22		stoweidlem40.11	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
23		stoweidlem40.12	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
24		1re 11235	. . . . . . . . . 10 ⊢ 1 ∈ ℝ
25		stoweidlem40.5	. . . . . . . . . . 11 ⊢ 𝐺 = (𝑡 ∈ 𝑇 ↦ 1)
26	25	fvmpt2 6997	. . . . . . . . . 10 ⊢ ((𝑡 ∈ 𝑇 ∧ 1 ∈ ℝ) → (𝐺‘𝑡) = 1)
27	24, 26	mpan2 691	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝑇 → (𝐺‘𝑡) = 1)
28	27	eqcomd 2741	. . . . . . . 8 ⊢ (𝑡 ∈ 𝑇 → 1 = (𝐺‘𝑡))
29	28	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 = (𝐺‘𝑡))
30		stoweidlem40.6	. . . . . . . . . 10 ⊢ 𝐻 = (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁))
31	30	fvmpt2 6997	. . . . . . . . 9 ⊢ ((𝑡 ∈ 𝑇 ∧ ((𝑃‘𝑡)↑𝑁) ∈ ℝ) → (𝐻‘𝑡) = ((𝑃‘𝑡)↑𝑁))
32	3, 10, 31	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐻‘𝑡) = ((𝑃‘𝑡)↑𝑁))
33	32	eqcomd 2741	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑃‘𝑡)↑𝑁) = (𝐻‘𝑡))
34	29, 33	oveq12d 7423	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) = ((𝐺‘𝑡) − (𝐻‘𝑡)))
35	2, 34	mpteq2da 5213	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁))) = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))))
36	12, 35	eqtrid 2782	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))))
37	23	stoweidlem4 46033	. . . . . . 7 ⊢ ((𝜑 ∧ 1 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
38	24, 37	mpan2 691	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
39	25, 38	eqeltrid 2838	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝐴)
40		stoweidlem40.1	. . . . . . 7 ⊢ Ⅎ𝑡𝑃
41		stoweidlem40.7	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ 𝐴)
42	40, 2, 21, 22, 23, 41, 8	stoweidlem19 46048	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁)) ∈ 𝐴)
43	30, 42	eqeltrid 2838	. . . . 5 ⊢ (𝜑 → 𝐻 ∈ 𝐴)
44		nfmpt1 5220	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ 1)
45	25, 44	nfcxfr 2896	. . . . . 6 ⊢ Ⅎ𝑡𝐺
46		nfmpt1 5220	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁))
47	30, 46	nfcxfr 2896	. . . . . 6 ⊢ Ⅎ𝑡𝐻
48		stoweidlem40.10	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
49	45, 47, 2, 21, 48, 22, 23	stoweidlem33 46062	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ∈ 𝐴 ∧ 𝐻 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))) ∈ 𝐴)
50	39, 43, 49	mpd3an23 1465	. . . 4 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐺‘𝑡) − (𝐻‘𝑡))) ∈ 𝐴)
51	36, 50	eqeltrd 2834	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐴)
52		stoweidlem40.14	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
53	52	nnnn0d 12562	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℕ0)
54	20, 2, 21, 22, 23, 51, 53	stoweidlem19 46048	. 2 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡)↑𝑀)) ∈ 𝐴)
55	18, 54	eqeltrd 2834	1 ⊢ (𝜑 → 𝑄 ∈ 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540  Ⅎwnf 1783   ∈ wcel 2108  Ⅎwnfc 2883   ↦ cmpt 5201  ⟶wf 6527  ‘cfv 6531  (class class class)co 7405  ℝcr 11128  1c1 11130   + caddc 11132   · cmul 11134   − cmin 11466  ℕcn 12240  ℕ₀cn0 12501  ↑cexp 14079

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-er 8719  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-n0 12502  df-z 12589  df-uz 12853  df-seq 14020  df-exp 14080

This theorem is referenced by:  stoweidlem45  46074