Theorem stoweidlem15 46123

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

Hypotheses

Ref	Expression
stoweidlem15.1	⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
stoweidlem15.3	⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
stoweidlem15.4	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)

Assertion

Ref	Expression
stoweidlem15	⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (((𝐺‘𝐼)‘𝑆) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))

Distinct variable groups:   𝐴,𝑓   𝑓,𝐺   𝑓,𝐼   𝑇,𝑓   𝜑,𝑓   𝑡,ℎ,𝐺   𝐴,ℎ   ℎ,𝐼,𝑡   𝑇,ℎ,𝑡   ℎ,𝑍

Allowed substitution hints:   𝜑(𝑡,ℎ)   𝐴(𝑡)   𝑄(𝑡,𝑓,ℎ)   𝑆(𝑡,𝑓,ℎ)   𝑀(𝑡,𝑓,ℎ)   𝑍(𝑡,𝑓)

Proof of Theorem stoweidlem15

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 482	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → 𝜑)
2		stoweidlem15.3	. . . . . 6 ⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
3	2	ffvelcdmda 7017	. . . . 5 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ 𝑄)
4		elrabi 3638	. . . . . 6 ⊢ ((𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} → (𝐺‘𝐼) ∈ 𝐴)
5		stoweidlem15.1	. . . . . 6 ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
6	4, 5	eleq2s 2849	. . . . 5 ⊢ ((𝐺‘𝐼) ∈ 𝑄 → (𝐺‘𝐼) ∈ 𝐴)
7	3, 6	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ 𝐴)
8		eleq1 2819	. . . . . . . 8 ⊢ (𝑓 = (𝐺‘𝐼) → (𝑓 ∈ 𝐴 ↔ (𝐺‘𝐼) ∈ 𝐴))
9	8	anbi2d 630	. . . . . . 7 ⊢ (𝑓 = (𝐺‘𝐼) → ((𝜑 ∧ 𝑓 ∈ 𝐴) ↔ (𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴)))
10		feq1 6629	. . . . . . 7 ⊢ (𝑓 = (𝐺‘𝐼) → (𝑓:𝑇⟶ℝ ↔ (𝐺‘𝐼):𝑇⟶ℝ))
11	9, 10	imbi12d 344	. . . . . 6 ⊢ (𝑓 = (𝐺‘𝐼) → (((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ) ↔ ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ)))
12		stoweidlem15.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
13	11, 12	vtoclg 3507	. . . . 5 ⊢ ((𝐺‘𝐼) ∈ 𝐴 → ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ))
14	7, 13	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ))
15	1, 7, 14	mp2and 699	. . 3 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼):𝑇⟶ℝ)
16	15	ffvelcdmda 7017	. 2 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → ((𝐺‘𝐼)‘𝑆) ∈ ℝ)
17	3, 5	eleqtrdi 2841	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))})
18		fveq1 6821	. . . . . . . . . 10 ⊢ (ℎ = (𝐺‘𝐼) → (ℎ‘𝑍) = ((𝐺‘𝐼)‘𝑍))
19	18	eqeq1d 2733	. . . . . . . . 9 ⊢ (ℎ = (𝐺‘𝐼) → ((ℎ‘𝑍) = 0 ↔ ((𝐺‘𝐼)‘𝑍) = 0))
20		fveq1 6821	. . . . . . . . . . . 12 ⊢ (ℎ = (𝐺‘𝐼) → (ℎ‘𝑡) = ((𝐺‘𝐼)‘𝑡))
21	20	breq2d 5101	. . . . . . . . . . 11 ⊢ (ℎ = (𝐺‘𝐼) → (0 ≤ (ℎ‘𝑡) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑡)))
22	20	breq1d 5099	. . . . . . . . . . 11 ⊢ (ℎ = (𝐺‘𝐼) → ((ℎ‘𝑡) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑡) ≤ 1))
23	21, 22	anbi12d 632	. . . . . . . . . 10 ⊢ (ℎ = (𝐺‘𝐼) → ((0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
24	23	ralbidv 3155	. . . . . . . . 9 ⊢ (ℎ = (𝐺‘𝐼) → (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
25	19, 24	anbi12d 632	. . . . . . . 8 ⊢ (ℎ = (𝐺‘𝐼) → (((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)) ↔ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
26	25	elrab 3642	. . . . . . 7 ⊢ ((𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} ↔ ((𝐺‘𝐼) ∈ 𝐴 ∧ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
27	17, 26	sylib 218	. . . . . 6 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ((𝐺‘𝐼) ∈ 𝐴 ∧ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
28	27	simprd 495	. . . . 5 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
29	28	simprd 495	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))
30		fveq2 6822	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → ((𝐺‘𝐼)‘𝑠) = ((𝐺‘𝐼)‘𝑡))
31	30	breq2d 5101	. . . . . . 7 ⊢ (𝑠 = 𝑡 → (0 ≤ ((𝐺‘𝐼)‘𝑠) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑡)))
32	30	breq1d 5099	. . . . . . 7 ⊢ (𝑠 = 𝑡 → (((𝐺‘𝐼)‘𝑠) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑡) ≤ 1))
33	31, 32	anbi12d 632	. . . . . 6 ⊢ (𝑠 = 𝑡 → ((0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
34	33	cbvralvw 3210	. . . . 5 ⊢ (∀𝑠 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))
35		fveq2 6822	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((𝐺‘𝐼)‘𝑠) = ((𝐺‘𝐼)‘𝑆))
36	35	breq2d 5101	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (0 ≤ ((𝐺‘𝐼)‘𝑠) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑆)))
37	35	breq1d 5099	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (((𝐺‘𝐼)‘𝑠) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑆) ≤ 1))
38	36, 37	anbi12d 632	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1)))
39	38	rspccva 3571	. . . . 5 ⊢ ((∀𝑠 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
40	34, 39	sylanbr 582	. . . 4 ⊢ ((∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
41	29, 40	sylan 580	. . 3 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
42	41	simpld 494	. 2 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → 0 ≤ ((𝐺‘𝐼)‘𝑆))
43	41	simprd 495	. 2 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → ((𝐺‘𝐼)‘𝑆) ≤ 1)
44	16, 42, 43	3jca 1128	1 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (((𝐺‘𝐼)‘𝑆) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  ∀wral 3047  {crab 3395   class class class wbr 5089  ⟶wf 6477  ‘cfv 6481  (class class class)co 7346  ℝcr 11005  0cc0 11006  1c1 11007   ≤ cle 11147  ...cfz 13407

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-fv 6489

This theorem is referenced by:  stoweidlem30  46138  stoweidlem38  46146  stoweidlem44  46152