MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cstucnd Structured version   Visualization version   GIF version

Theorem cstucnd 22890
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.
StepHypRef Expression
1 cstucnd.3 . . 3 (𝜑𝐴𝑌)
2 fconst6g 6542 . . 3 (𝐴𝑌 → (𝑋 × {𝐴}):𝑋𝑌)
31, 2syl 17 . 2 (𝜑 → (𝑋 × {𝐴}):𝑋𝑌)
4 cstucnd.1 . . . . . 6 (𝜑𝑈 ∈ (UnifOn‘𝑋))
54adantr 484 . . . . 5 ((𝜑𝑠𝑉) → 𝑈 ∈ (UnifOn‘𝑋))
6 ustne0 22819 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅)
75, 6syl 17 . . . 4 ((𝜑𝑠𝑉) → 𝑈 ≠ ∅)
8 cstucnd.2 . . . . . . . . . 10 (𝜑𝑉 ∈ (UnifOn‘𝑌))
98ad3antrrr 729 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑉 ∈ (UnifOn‘𝑌))
10 simpllr 775 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑠𝑉)
111ad3antrrr 729 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑌)
12 ustref 22824 . . . . . . . . 9 ((𝑉 ∈ (UnifOn‘𝑌) ∧ 𝑠𝑉𝐴𝑌) → 𝐴𝑠𝐴)
139, 10, 11, 12syl3anc 1368 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑠𝐴)
14 simprl 770 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
15 fvconst2g 6941 . . . . . . . . 9 ((𝐴𝑌𝑥𝑋) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
1611, 14, 15syl2anc 587 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
17 simprr 772 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
18 fvconst2g 6941 . . . . . . . . 9 ((𝐴𝑌𝑦𝑋) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
1911, 17, 18syl2anc 587 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
2013, 16, 193brtr4d 5062 . . . . . . 7 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦))
2120a1d 25 . . . . . 6 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2221ralrimivva 3156 . . . . 5 (((𝜑𝑠𝑉) ∧ 𝑟𝑈) → ∀𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2322reximdva0 4265 . . . 4 (((𝜑𝑠𝑉) ∧ 𝑈 ≠ ∅) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
247, 23mpdan 686 . . 3 ((𝜑𝑠𝑉) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2524ralrimiva 3149 . 2 (𝜑 → ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
26 isucn 22884 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
274, 8, 26syl2anc 587 . 2 (𝜑 → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
283, 25, 27mpbir2and 712 1 (𝜑 → (𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wne 2987  wral 3106  wrex 3107  c0 4243  {csn 4525   class class class wbr 5030   × cxp 5517  wf 6320  cfv 6324  (class class class)co 7135  UnifOncust 22805   Cnucucn 22881
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-ust 22806  df-ucn 22882
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator