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 46783
Description: Lemma for stoweid 46837: 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 5202 . . . . 5 (𝑇 = ∅ → (𝑡𝑇 ↦ 1) = (𝑡 ∈ ∅ ↦ 1))
3 mpt0 6681 . . . . 5 (𝑡 ∈ ∅ ↦ 1) = ∅
42, 3eqtrdi 2816 . . . 4 (𝑇 = ∅ → (𝑡𝑇 ↦ 1) = ∅)
51, 4syl 18 . . 3 (𝜑 → (𝑡𝑇 ↦ 1) = ∅)
6 stoweidlem9.2 . . 3 (𝜑 → (𝑡𝑇 ↦ 1) ∈ 𝐴)
75, 6eqeltrrd 2866 . 2 (𝜑 → ∅ ∈ 𝐴)
8 rzal 4457 . . 3 (𝑇 = ∅ → ∀𝑡𝑇 (abs‘((∅‘𝑡) − (𝐹𝑡))) < 𝐸)
91, 8syl 18 . 2 (𝜑 → ∀𝑡𝑇 (abs‘((∅‘𝑡) − (𝐹𝑡))) < 𝐸)
10 fveq1 6884 . . . . . 6 (𝑔 = ∅ → (𝑔𝑡) = (∅‘𝑡))
1110fvoveq1d 7441 . . . . 5 (𝑔 = ∅ → (abs‘((𝑔𝑡) − (𝐹𝑡))) = (abs‘((∅‘𝑡) − (𝐹𝑡))))
1211breq1d 5121 . . . 4 (𝑔 = ∅ → ((abs‘((𝑔𝑡) − (𝐹𝑡))) < 𝐸 ↔ (abs‘((∅‘𝑡) − (𝐹𝑡))) < 𝐸))
1312ralbidv 3190 . . 3 (𝑔 = ∅ → (∀𝑡𝑇 (abs‘((𝑔𝑡) − (𝐹𝑡))) < 𝐸 ↔ ∀𝑡𝑇 (abs‘((∅‘𝑡) − (𝐹𝑡))) < 𝐸))
1413rspcev 3583 . 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 2146  wral 3081  wrex 3091  c0 4286   class class class wbr 5111  cmpt 5194  cfv 6540  (class class class)co 7419  1c1 11118   < clt 11260  cmin 11458  abscabs 15311
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fn 6543  df-fv 6548  df-ov 7422
This theorem is used by:  stoweid  46837
  Copyright terms: Public domain W3C validator