Theorem stoweidlem15 46757

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 487	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → 𝜑)
2		stoweidlem15.3	. . . . . 6 ⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
3	2	ffvelcdmda 7079	. . . . 5 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ 𝑄)
4		elrabi 3646	. . . . . 6 ⊢ ((𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} → (𝐺‘𝐼) ∈ 𝐴)
5		stoweidlem15.1	. . . . . 6 ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
6	4, 5	eleq2s 2881	. . . . 5 ⊢ ((𝐺‘𝐼) ∈ 𝑄 → (𝐺‘𝐼) ∈ 𝐴)
7	3, 6	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ 𝐴)
8		eleq1 2851	. . . . . . . 8 ⊢ (𝑓 = (𝐺‘𝐼) → (𝑓 ∈ 𝐴 ↔ (𝐺‘𝐼) ∈ 𝐴))
9	8	anbi2d 641	. . . . . . 7 ⊢ (𝑓 = (𝐺‘𝐼) → ((𝜑 ∧ 𝑓 ∈ 𝐴) ↔ (𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴)))
10		feq1 6683	. . . . . . 7 ⊢ (𝑓 = (𝐺‘𝐼) → (𝑓:𝑇⟶ℝ ↔ (𝐺‘𝐼):𝑇⟶ℝ))
11	9, 10	imbi12d 347	. . . . . 6 ⊢ (𝑓 = (𝐺‘𝐼) → (((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ) ↔ ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ)))
12		stoweidlem15.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
13	11, 12	vtoclg 3522	. . . . 5 ⊢ ((𝐺‘𝐼) ∈ 𝐴 → ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ))
14	7, 13	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ))
15	1, 7, 14	mp2and 711	. . 3 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼):𝑇⟶ℝ)
16	15	ffvelcdmda 7079	. 2 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → ((𝐺‘𝐼)‘𝑆) ∈ ℝ)
17	3, 5	eleqtrdi 2873	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))})
18		fveq1 6880	. . . . . . . . . 10 ⊢ (ℎ = (𝐺‘𝐼) → (ℎ‘𝑍) = ((𝐺‘𝐼)‘𝑍))
19	18	eqeq1d 2765	. . . . . . . . 9 ⊢ (ℎ = (𝐺‘𝐼) → ((ℎ‘𝑍) = 0 ↔ ((𝐺‘𝐼)‘𝑍) = 0))
20		fveq1 6880	. . . . . . . . . . . 12 ⊢ (ℎ = (𝐺‘𝐼) → (ℎ‘𝑡) = ((𝐺‘𝐼)‘𝑡))
21	20	breq2d 5121	. . . . . . . . . . 11 ⊢ (ℎ = (𝐺‘𝐼) → (0 ≤ (ℎ‘𝑡) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑡)))
22	20	breq1d 5119	. . . . . . . . . . 11 ⊢ (ℎ = (𝐺‘𝐼) → ((ℎ‘𝑡) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑡) ≤ 1))
23	21, 22	anbi12d 643	. . . . . . . . . 10 ⊢ (ℎ = (𝐺‘𝐼) → ((0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
24	23	ralbidv 3188	. . . . . . . . 9 ⊢ (ℎ = (𝐺‘𝐼) → (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
25	19, 24	anbi12d 643	. . . . . . . 8 ⊢ (ℎ = (𝐺‘𝐼) → (((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)) ↔ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
26	25	elrab 3650	. . . . . . 7 ⊢ ((𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} ↔ ((𝐺‘𝐼) ∈ 𝐴 ∧ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
27	17, 26	sylib 221	. . . . . 6 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ((𝐺‘𝐼) ∈ 𝐴 ∧ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
28	27	simprd 500	. . . . 5 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
29	28	simprd 500	. . . 4 ⊢ ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))
30		fveq2 6881	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → ((𝐺‘𝐼)‘𝑠) = ((𝐺‘𝐼)‘𝑡))
31	30	breq2d 5121	. . . . . . 7 ⊢ (𝑠 = 𝑡 → (0 ≤ ((𝐺‘𝐼)‘𝑠) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑡)))
32	30	breq1d 5119	. . . . . . 7 ⊢ (𝑠 = 𝑡 → (((𝐺‘𝐼)‘𝑠) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑡) ≤ 1))
33	31, 32	anbi12d 643	. . . . . 6 ⊢ (𝑠 = 𝑡 → ((0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
34	33	cbvralvw 3243	. . . . 5 ⊢ (∀𝑠 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))
35		fveq2 6881	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((𝐺‘𝐼)‘𝑠) = ((𝐺‘𝐼)‘𝑆))
36	35	breq2d 5121	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (0 ≤ ((𝐺‘𝐼)‘𝑠) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑆)))
37	35	breq1d 5119	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (((𝐺‘𝐼)‘𝑠) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑆) ≤ 1))
38	36, 37	anbi12d 643	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1)))
39	38	rspccva 3580	. . . . 5 ⊢ ((∀𝑠 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
40	34, 39	sylanbr 593	. . . 4 ⊢ ((∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
41	29, 40	sylan 591	. . 3 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
42	41	simpld 499	. 2 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → 0 ≤ ((𝐺‘𝐼)‘𝑆))
43	41	simprd 500	. 2 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → ((𝐺‘𝐼)‘𝑆) ≤ 1)
44	16, 42, 43	3jca 1146	1 ⊢ (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (((𝐺‘𝐼)‘𝑆) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∀wral 3079  {crab 3416   class class class wbr 5109  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  ℝcr 11103  0cc0 11104  1c1 11105   ≤ cle 11248  ...cfz 13539

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544

This theorem is used by:  stoweidlem30  46772  stoweidlem38  46780  stoweidlem44  46786