| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > stoweidlem9 | Structured version Visualization version GIF version | ||
| Description: Lemma for stoweid 46894: here the Stone Weierstrass theorem is proven for the trivial case, T is the empty set. (Contributed by Glauco Siliprandi, 20-Apr-2017.) |
| Ref | Expression |
|---|---|
| stoweidlem9.1 | ⊢ (𝜑 → 𝑇 = ∅) |
| stoweidlem9.2 | ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴) |
| Ref | Expression |
|---|---|
| stoweidlem9 | ⊢ (𝜑 → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | stoweidlem9.1 | . . . 4 ⊢ (𝜑 → 𝑇 = ∅) | |
| 2 | mpteq1 5194 | . . . . 5 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = (𝑡 ∈ ∅ ↦ 1)) | |
| 3 | mpt0 6675 | . . . . 5 ⊢ (𝑡 ∈ ∅ ↦ 1) = ∅ | |
| 4 | 2, 3 | eqtrdi 2811 | . . . 4 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = ∅) |
| 5 | 1, 4 | syl 18 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) = ∅) |
| 6 | stoweidlem9.2 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴) | |
| 7 | 5, 6 | eqeltrrd 2861 | . 2 ⊢ (𝜑 → ∅ ∈ 𝐴) |
| 8 | rzal 4450 | . . 3 ⊢ (𝑇 = ∅ → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) | |
| 9 | 1, 8 | syl 18 | . 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| 10 | fveq1 6878 | . . . . . 6 ⊢ (𝑔 = ∅ → (𝑔‘𝑡) = (∅‘𝑡)) | |
| 11 | 10 | fvoveq1d 7436 | . . . . 5 ⊢ (𝑔 = ∅ → (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) = (abs‘((∅‘𝑡) − (𝐹‘𝑡)))) |
| 12 | 11 | breq1d 5113 | . . . 4 ⊢ (𝑔 = ∅ → ((abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)) |
| 13 | 12 | ralbidv 3185 | . . 3 ⊢ (𝑔 = ∅ → (∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)) |
| 14 | 13 | rspcev 3576 | . 2 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| 15 | 7, 9, 14 | syl2anc 596 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 ∅c0 4279 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6533 (class class class)co 7414 1c1 11128 < clt 11270 − cmin 11468 abscabs 15324 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6489 df-fun 6535 df-fn 6536 df-fv 6541 df-ov 7417 |
| This theorem is used by: stoweid 46894 |
| Copyright terms: Public domain | W3C validator |