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

Theorem cstucnd 24208
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 6720 . . 3 (𝐴𝑌 → (𝑋 × {𝐴}):𝑋𝑌)
31, 2syl 17 . 2 (𝜑 → (𝑋 × {𝐴}):𝑋𝑌)
4 cstucnd.1 . . . . . 6 (𝜑𝑈 ∈ (UnifOn‘𝑋))
54adantr 480 . . . . 5 ((𝜑𝑠𝑉) → 𝑈 ∈ (UnifOn‘𝑋))
6 ustne0 24139 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅)
75, 6syl 17 . . . 4 ((𝜑𝑠𝑉) → 𝑈 ≠ ∅)
8 cstucnd.2 . . . . . . . . . 10 (𝜑𝑉 ∈ (UnifOn‘𝑌))
98ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑉 ∈ (UnifOn‘𝑌))
10 simpllr 775 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑠𝑉)
111ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑌)
12 ustref 24144 . . . . . . . . 9 ((𝑉 ∈ (UnifOn‘𝑌) ∧ 𝑠𝑉𝐴𝑌) → 𝐴𝑠𝐴)
139, 10, 11, 12syl3anc 1373 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑠𝐴)
14 simprl 770 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
15 fvconst2g 7145 . . . . . . . . 9 ((𝐴𝑌𝑥𝑋) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
1611, 14, 15syl2anc 584 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
17 simprr 772 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
18 fvconst2g 7145 . . . . . . . . 9 ((𝐴𝑌𝑦𝑋) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
1911, 17, 18syl2anc 584 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
2013, 16, 193brtr4d 5127 . . . . . . 7 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦))
2120a1d 25 . . . . . 6 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2221ralrimivva 3177 . . . . 5 (((𝜑𝑠𝑉) ∧ 𝑟𝑈) → ∀𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2322reximdva0 4306 . . . 4 (((𝜑𝑠𝑉) ∧ 𝑈 ≠ ∅) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
247, 23mpdan 687 . . 3 ((𝜑𝑠𝑉) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2524ralrimiva 3126 . 2 (𝜑 → ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
26 isucn 24202 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
274, 8, 26syl2anc 584 . 2 (𝜑 → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
283, 25, 27mpbir2and 713 1 (𝜑 → (𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wne 2930  wral 3049  wrex 3058  c0 4284  {csn 4577   class class class wbr 5095   × cxp 5619  wf 6485  cfv 6489  (class class class)co 7355  UnifOncust 24125   Cnucucn 24199
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-map 8761  df-ust 24126  df-ucn 24200
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator