| 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 47212: 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 5196 | . . . . 5 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = (𝑡 ∈ ∅ ↦ 1)) | |
| 3 | mpt0 6689 | . . . . 5 ⊢ (𝑡 ∈ ∅ ↦ 1) = ∅ | |
| 4 | 2, 3 | eqtrdi 2814 | . . . 4 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = ∅) |
| 5 | 1, 4 | syl 18 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) = ∅) |
| 6 | stoweidlem9.2 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴) | |
| 7 | 5, 6 | eqeltrrd 2864 | . 2 ⊢ (𝜑 → ∅ ∈ 𝐴) |
| 8 | rzal 4452 | . . 3 ⊢ (𝑇 = ∅ → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) | |
| 9 | 1, 8 | syl 18 | . 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| 10 | fveq1 6892 | . . . . . 6 ⊢ (𝑔 = ∅ → (𝑔‘𝑡) = (∅‘𝑡)) | |
| 11 | 10 | fvoveq1d 7449 | . . . . 5 ⊢ (𝑔 = ∅ → (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) = (abs‘((∅‘𝑡) − (𝐹‘𝑡)))) |
| 12 | 11 | breq1d 5115 | . . . 4 ⊢ (𝑔 = ∅ → ((abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)) |
| 13 | 12 | ralbidv 3188 | . . 3 ⊢ (𝑔 = ∅ → (∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)) |
| 14 | 13 | rspcev 3579 | . 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 1569 ∈ wcel 2146 ∀wral 3079 ∃wrex 3089 ∅c0 4280 class class class wbr 5105 ↦ cmpt 5188 ‘cfv 6546 (class class class)co 7427 1c1 11211 < clt 11353 − cmin 11551 abscabs 15413 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-iota 6500 df-fun 6548 df-fn 6549 df-fv 6554 df-ov 7430 |
| This theorem is used by: stoweid 47212 |
| Copyright terms: Public domain | W3C validator |