Theorem stoweidlem9 47292

Description: Lemma for stoweid 47346: 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

Step	Hyp	Ref	Expression
1		stoweidlem9.1	. . . 4 ⊢ (𝜑 → 𝑇 = ∅)
2		mpteq1 5200	. . . . 5 ⊢ (𝑇 = ∅ → (𝑡 ∈ 𝑇 ↦ 1) = (𝑡 ∈ ∅ ↦ 1))
3		mpt0 6711	. . . . 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 2865	. 2 ⊢ (𝜑 → ∅ ∈ 𝐴)
8		rzal 4453	. . 3 ⊢ (𝑇 = ∅ → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)
9	1, 8	syl 18	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸)
10		fveq1 6915	. . . . . 6 ⊢ (𝑔 = ∅ → (𝑔‘𝑡) = (∅‘𝑡))
11	10	fvoveq1d 7473	. . . . 5 ⊢ (𝑔 = ∅ → (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) = (abs‘((∅‘𝑡) − (𝐹‘𝑡))))
12	11	breq1d 5118	. . . 4 ⊢ (𝑔 = ∅ → ((abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸))
13	12	ralbidv 3189	. . 3 ⊢ (𝑔 = ∅ → (∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸 ↔ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸))
14	13	rspcev 3580	. 2 ⊢ ((∅ ∈ 𝐴 ∧ ∀𝑡 ∈ 𝑇 (abs‘((∅‘𝑡) − (𝐹‘𝑡))) < 𝐸) → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸)
15	7, 9, 14	syl2anc 596	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝐴 ∀𝑡 ∈ 𝑇 (abs‘((𝑔‘𝑡) − (𝐹‘𝑡))) < 𝐸)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∅c0 4281   class class class wbr 5108   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451  1c1 11240   < clt 11382   − cmin 11580  abscabs 15444

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574  df-ov 7454

This theorem is used by:  stoweid  47346