Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  stoweidlem9 Structured version   Visualization version   GIF version

Theorem stoweidlem9 47018
Description: Lemma for stoweid 47072: here the Stone Weierstrass theorem is proven for the trivial case, T is the empty set. (Contributed by Glauco Siliprandi, 20-Apr-2017.)
Hypotheses
Ref Expression
stoweidlem9.1 (𝜑 → 𝑇 = ∅)
stoweidlem9.2 (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
Assertion
Ref Expression
stoweidlem9 (𝜑 → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸)
Distinct variable groups:   𝐴,𝑔   𝑔,𝐸   𝑔,𝐹   𝑡,𝑔,𝑇
Allowed substitution hints:   𝜑(𝑡, 𝑔)   𝐴(𝑡)   𝐸(𝑡)   𝐹(𝑡)

Proof of Theorem stoweidlem9
StepHypRef Expression
1 stoweidlem9.1 . . . 4 (𝜑 → 𝑇 = ∅)
2 mpteq1 5194 . . . . 5 (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = (𝑡 ∈ ∅ ↦ 1))
3 mpt0 6681 . . . . 5 (𝑡 ∈ ∅ ↦ 1) = ∅
42, 3eqtrdi 2812 . . . 4 (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = ∅)
51, 4syl 18 . . 3 (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) = ∅)
6 stoweidlem9.2 . . 3 (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
75, 6eqeltrrd 2862 . 2 (𝜑 → ∅ ∈ 𝐴)
8 rzal 4450 . . 3 (𝑇 = ∅ → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)
91, 8syl 18 . 2 (𝜑 → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)
10 fveq1 6884 . . . . . 6 (𝑔 = ∅ → (𝑔‘𝑡) = (∅‘𝑡))
1110fvoveq1d 7442 . . . . 5 (𝑔 = ∅ → (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) = (abs‘((∅‘𝑡) − (𝐹‘𝑡))))
1211breq1d 5113 . . . 4 (𝑔 = ∅ → ((abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸))
1312ralbidv 3186 . . 3 (𝑔 = ∅ → (∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸))
1413rspcev 3577 . 2 ((∅ ∈ 𝐴 ∧ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸)
157, 9, 14syl2anc 596 1 (𝜑 → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  ∅c0 4279   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6538  (class class class)co 7420  1c1 11201   < clt 11343   − cmin 11541  abscabs 15401
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-ov 7423
This theorem is used by:  stoweid  47072
  Copyright terms: Public domain W3C validator