![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > stoweidlem37 | Structured version Visualization version GIF version |
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_(t0) = 0, and p > 0 on T - U. Z is used for t0, P is used for p, (𝐺‘𝑖) is used for p_(ti). (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
Ref | Expression |
---|---|
stoweidlem37.1 | ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} |
stoweidlem37.2 | ⊢ 𝑃 = (𝑡 ∈ 𝑇 ↦ ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡))) |
stoweidlem37.3 | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
stoweidlem37.4 | ⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄) |
stoweidlem37.5 | ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ) |
stoweidlem37.6 | ⊢ (𝜑 → 𝑍 ∈ 𝑇) |
Ref | Expression |
---|---|
stoweidlem37 | ⊢ (𝜑 → (𝑃‘𝑍) = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | stoweidlem37.6 | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑇) | |
2 | stoweidlem37.1 | . . . 4 ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} | |
3 | stoweidlem37.2 | . . . 4 ⊢ 𝑃 = (𝑡 ∈ 𝑇 ↦ ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑡))) | |
4 | stoweidlem37.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
5 | stoweidlem37.4 | . . . 4 ⊢ (𝜑 → 𝐺:(1...𝑀)⟶𝑄) | |
6 | stoweidlem37.5 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ) | |
7 | 2, 3, 4, 5, 6 | stoweidlem30 42672 | . . 3 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑇) → (𝑃‘𝑍) = ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑍))) |
8 | 1, 7 | mpdan 686 | . 2 ⊢ (𝜑 → (𝑃‘𝑍) = ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑍))) |
9 | 5 | ffvelrnda 6828 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐺‘𝑖) ∈ 𝑄) |
10 | fveq1 6644 | . . . . . . . . . 10 ⊢ (ℎ = (𝐺‘𝑖) → (ℎ‘𝑍) = ((𝐺‘𝑖)‘𝑍)) | |
11 | 10 | eqeq1d 2800 | . . . . . . . . 9 ⊢ (ℎ = (𝐺‘𝑖) → ((ℎ‘𝑍) = 0 ↔ ((𝐺‘𝑖)‘𝑍) = 0)) |
12 | fveq1 6644 | . . . . . . . . . . . 12 ⊢ (ℎ = (𝐺‘𝑖) → (ℎ‘𝑡) = ((𝐺‘𝑖)‘𝑡)) | |
13 | 12 | breq2d 5042 | . . . . . . . . . . 11 ⊢ (ℎ = (𝐺‘𝑖) → (0 ≤ (ℎ‘𝑡) ↔ 0 ≤ ((𝐺‘𝑖)‘𝑡))) |
14 | 12 | breq1d 5040 | . . . . . . . . . . 11 ⊢ (ℎ = (𝐺‘𝑖) → ((ℎ‘𝑡) ≤ 1 ↔ ((𝐺‘𝑖)‘𝑡) ≤ 1)) |
15 | 13, 14 | anbi12d 633 | . . . . . . . . . 10 ⊢ (ℎ = (𝐺‘𝑖) → ((0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ (0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1))) |
16 | 15 | ralbidv 3162 | . . . . . . . . 9 ⊢ (ℎ = (𝐺‘𝑖) → (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1))) |
17 | 11, 16 | anbi12d 633 | . . . . . . . 8 ⊢ (ℎ = (𝐺‘𝑖) → (((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)) ↔ (((𝐺‘𝑖)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1)))) |
18 | 17, 2 | elrab2 3631 | . . . . . . 7 ⊢ ((𝐺‘𝑖) ∈ 𝑄 ↔ ((𝐺‘𝑖) ∈ 𝐴 ∧ (((𝐺‘𝑖)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1)))) |
19 | 9, 18 | sylib 221 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐺‘𝑖) ∈ 𝐴 ∧ (((𝐺‘𝑖)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝑖)‘𝑡) ∧ ((𝐺‘𝑖)‘𝑡) ≤ 1)))) |
20 | 19 | simprld 771 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐺‘𝑖)‘𝑍) = 0) |
21 | 20 | sumeq2dv 15052 | . . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑍) = Σ𝑖 ∈ (1...𝑀)0) |
22 | fzfi 13335 | . . . . 5 ⊢ (1...𝑀) ∈ Fin | |
23 | olc 865 | . . . . 5 ⊢ ((1...𝑀) ∈ Fin → ((1...𝑀) ⊆ (ℤ≥‘1) ∨ (1...𝑀) ∈ Fin)) | |
24 | sumz 15071 | . . . . 5 ⊢ (((1...𝑀) ⊆ (ℤ≥‘1) ∨ (1...𝑀) ∈ Fin) → Σ𝑖 ∈ (1...𝑀)0 = 0) | |
25 | 22, 23, 24 | mp2b 10 | . . . 4 ⊢ Σ𝑖 ∈ (1...𝑀)0 = 0 |
26 | 21, 25 | eqtrdi 2849 | . . 3 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑍) = 0) |
27 | 26 | oveq2d 7151 | . 2 ⊢ (𝜑 → ((1 / 𝑀) · Σ𝑖 ∈ (1...𝑀)((𝐺‘𝑖)‘𝑍)) = ((1 / 𝑀) · 0)) |
28 | 4 | nncnd 11641 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
29 | 4 | nnne0d 11675 | . . . 4 ⊢ (𝜑 → 𝑀 ≠ 0) |
30 | 28, 29 | reccld 11398 | . . 3 ⊢ (𝜑 → (1 / 𝑀) ∈ ℂ) |
31 | 30 | mul01d 10828 | . 2 ⊢ (𝜑 → ((1 / 𝑀) · 0) = 0) |
32 | 8, 27, 31 | 3eqtrd 2837 | 1 ⊢ (𝜑 → (𝑃‘𝑍) = 0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ∀wral 3106 {crab 3110 ⊆ wss 3881 class class class wbr 5030 ↦ cmpt 5110 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 Fincfn 8492 ℝcr 10525 0cc0 10526 1c1 10527 · cmul 10531 ≤ cle 10665 / cdiv 11286 ℕcn 11625 ℤ≥cuz 12231 ...cfz 12885 Σcsu 15034 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-inf2 9088 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-se 5479 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-isom 6333 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-oi 8958 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-seq 13365 df-exp 13426 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-clim 14837 df-sum 15035 |
This theorem is referenced by: stoweidlem44 42686 |
Copyright terms: Public domain | W3C validator |