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

Theorem cstucnd 24273
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 6723 . . 3 (𝐴𝑌 → (𝑋 × {𝐴}):𝑋𝑌)
31, 2syl 17 . 2 (𝜑 → (𝑋 × {𝐴}):𝑋𝑌)
4 cstucnd.1 . . . . . 6 (𝜑𝑈 ∈ (UnifOn‘𝑋))
54adantr 481 . . . . 5 ((𝜑𝑠𝑉) → 𝑈 ∈ (UnifOn‘𝑋))
6 ustne0 24204 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅)
75, 6syl 17 . . . 4 ((𝜑𝑠𝑉) → 𝑈 ≠ ∅)
8 cstucnd.2 . . . . . . . . . 10 (𝜑𝑉 ∈ (UnifOn‘𝑌))
98ad3antrrr 736 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑉 ∈ (UnifOn‘𝑌))
10 simpllr 781 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑠𝑉)
111ad3antrrr 736 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑌)
12 ustref 24209 . . . . . . . . 9 ((𝑉 ∈ (UnifOn‘𝑌) ∧ 𝑠𝑉𝐴𝑌) → 𝐴𝑠𝐴)
139, 10, 11, 12syl3anc 1379 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑠𝐴)
14 simprl 776 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
15 fvconst2g 7153 . . . . . . . . 9 ((𝐴𝑌𝑥𝑋) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
1611, 14, 15syl2anc 590 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
17 simprr 778 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
18 fvconst2g 7153 . . . . . . . . 9 ((𝐴𝑌𝑦𝑋) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
1911, 17, 18syl2anc 590 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
2013, 16, 193brtr4d 5111 . . . . . . 7 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦))
2120a1d 25 . . . . . 6 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2221ralrimivva 3183 . . . . 5 (((𝜑𝑠𝑉) ∧ 𝑟𝑈) → ∀𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2322reximdva0 4290 . . . 4 (((𝜑𝑠𝑉) ∧ 𝑈 ≠ ∅) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
247, 23mpdan 693 . . 3 ((𝜑𝑠𝑉) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2524ralrimiva 3132 . 2 (𝜑 → ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
26 isucn 24267 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
274, 8, 26syl2anc 590 . 2 (𝜑 → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
283, 25, 27mpbir2and 719 1 (𝜑 → (𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wne 2935  wral 3054  wrex 3064  c0 4268  {csn 4562   class class class wbr 5079   × cxp 5623  wf 6488  cfv 6492  (class class class)co 7363  UnifOncust 24190   Cnucucn 24264
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-map 8772  df-ust 24191  df-ucn 24265
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator