Theorem cstucnd 24632

Description: A constant function is uniformly continuous. Deduction form. Example 1 of [BourbakiTop1] p. II.6. (Contributed by Thierry Arnoux, 16-Nov-2017.)

Hypotheses

Ref	Expression
cstucnd.1	⊢ (𝜑 → 𝑈 ∈ (UnifOn‘𝑋))
cstucnd.2	⊢ (𝜑 → 𝑉 ∈ (UnifOn‘𝑌))
cstucnd.3	⊢ (𝜑 → 𝐴 ∈ 𝑌)

Assertion

Ref	Expression
cstucnd	⊢ (𝜑 → (𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉))

Proof of Theorem cstucnd

Dummy variables 𝑠 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cstucnd.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑌)
2		fconst6g 6793	. . 3 ⊢ (𝐴 ∈ 𝑌 → (𝑋 × {𝐴}):𝑋⟶𝑌)
3	1, 2	syl 18	. 2 ⊢ (𝜑 → (𝑋 × {𝐴}):𝑋⟶𝑌)
4		cstucnd.1	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ (UnifOn‘𝑋))
5	4	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑉) → 𝑈 ∈ (UnifOn‘𝑋))
6		ustne0 24563	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅)
7	5, 6	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑉) → 𝑈 ≠ ∅)
8		cstucnd.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑉 ∈ (UnifOn‘𝑌))
9	8	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑉 ∈ (UnifOn‘𝑌))
10		simpllr 788	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑠 ∈ 𝑉)
11	1	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐴 ∈ 𝑌)
12		ustref 24568	. . . . . . . . 9 ⊢ ((𝑉 ∈ (UnifOn‘𝑌) ∧ 𝑠 ∈ 𝑉 ∧ 𝐴 ∈ 𝑌) → 𝐴𝑠𝐴)
13	9, 10, 11, 12	syl3anc 1399	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐴𝑠𝐴)
14		simprl 783	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ 𝑋)
15		fvconst2g 7231	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑌 ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
16	11, 14, 15	syl2anc 596	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
17		simprr 785	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
18		fvconst2g 7231	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑌 ∧ 𝑦 ∈ 𝑋) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
19	11, 17, 18	syl2anc 596	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
20	13, 16, 19	3brtr4d 5140	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦))
21	20	a1d 26	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
22	21	ralrimivva 3209	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑟 ∈ 𝑈) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
23	22	reximdva0 4306	. . . 4 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝑉) ∧ 𝑈 ≠ ∅) → ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
24	7, 23	mpdan 700	. . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝑉) → ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
25	24	ralrimiva 3158	. 2 ⊢ (𝜑 → ∀𝑠 ∈ 𝑉 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
26		isucn 24626	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋⟶𝑌 ∧ ∀𝑠 ∈ 𝑉 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
27	4, 8, 26	syl2anc 596	. 2 ⊢ (𝜑 → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋⟶𝑌 ∧ ∀𝑠 ∈ 𝑉 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
28	3, 25, 27	mpbir2and 726	1 ⊢ (𝜑 → (𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  ∅c0 4281  {csn 4588   class class class wbr 5106   × cxp 5653  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  UnifOncust 24549   Cn_ucucn 24623

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 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-map 8877  df-ust 24550  df-ucn 24624

This theorem is used by: (None)