| 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 46171: 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 5178 | . . . . 5 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = (𝑡 ∈ ∅ ↦ 1)) | |
| 3 | mpt0 6623 | . . . . 5 ⊢ (𝑡 ∈ ∅ ↦ 1) = ∅ | |
| 4 | 2, 3 | eqtrdi 2782 | . . . 4 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = ∅) |
| 5 | 1, 4 | syl 17 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) = ∅) |
| 6 | stoweidlem9.2 | . . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴) | |
| 7 | 5, 6 | eqeltrrd 2832 | . 2 ⊢ (𝜑 → ∅ ∈ 𝐴) |
| 8 | rzal 4456 | . . 3 ⊢ (𝑇 = ∅ → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) | |
| 9 | 1, 8 | syl 17 | . 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| 10 | fveq1 6821 | . . . . . 6 ⊢ (𝑔 = ∅ → (𝑔‘𝑡) = (∅‘𝑡)) | |
| 11 | 10 | fvoveq1d 7368 | . . . . 5 ⊢ (𝑔 = ∅ → (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) = (abs‘((∅‘𝑡) − (𝐹‘𝑡)))) |
| 12 | 11 | breq1d 5099 | . . . 4 ⊢ (𝑔 = ∅ → ((abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)) |
| 13 | 12 | ralbidv 3155 | . . 3 ⊢ (𝑔 = ∅ → (∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)) |
| 14 | 13 | rspcev 3572 | . 2 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| 15 | 7, 9, 14 | syl2anc 584 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ∃wrex 3056 ∅c0 4280 class class class wbr 5089 ↦ cmpt 5170 ‘cfv 6481 (class class class)co 7346 1c1 11007 < clt 11146 − cmin 11344 abscabs 15141 |
| 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-11 2160 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-nfc 2881 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-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-iota 6437 df-fun 6483 df-fn 6484 df-fv 6489 df-ov 7349 |
| This theorem is referenced by: stoweid 46171 |
| Copyright terms: Public domain | W3C validator |