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

Theorem cstucnd 21898
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 6007 . . 3 (𝐴𝑌 → (𝑋 × {𝐴}):𝑋𝑌)
31, 2syl 17 . 2 (𝜑 → (𝑋 × {𝐴}):𝑋𝑌)
4 cstucnd.1 . . . . . 6 (𝜑𝑈 ∈ (UnifOn‘𝑋))
54adantr 480 . . . . 5 ((𝜑𝑠𝑉) → 𝑈 ∈ (UnifOn‘𝑋))
6 ustne0 21827 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅)
75, 6syl 17 . . . 4 ((𝜑𝑠𝑉) → 𝑈 ≠ ∅)
8 cstucnd.2 . . . . . . . . . 10 (𝜑𝑉 ∈ (UnifOn‘𝑌))
98ad3antrrr 762 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑉 ∈ (UnifOn‘𝑌))
10 simpllr 795 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑠𝑉)
111ad3antrrr 762 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑌)
12 ustref 21832 . . . . . . . . 9 ((𝑉 ∈ (UnifOn‘𝑌) ∧ 𝑠𝑉𝐴𝑌) → 𝐴𝑠𝐴)
139, 10, 11, 12syl3anc 1318 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝐴𝑠𝐴)
14 simprl 790 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑥𝑋)
15 fvconst2g 6372 . . . . . . . . 9 ((𝐴𝑌𝑥𝑋) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
1611, 14, 15syl2anc 691 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥) = 𝐴)
17 simprr 792 . . . . . . . . 9 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → 𝑦𝑋)
18 fvconst2g 6372 . . . . . . . . 9 ((𝐴𝑌𝑦𝑋) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
1911, 17, 18syl2anc 691 . . . . . . . 8 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑦) = 𝐴)
2013, 16, 193brtr4d 4615 . . . . . . 7 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦))
2120a1d 25 . . . . . 6 ((((𝜑𝑠𝑉) ∧ 𝑟𝑈) ∧ (𝑥𝑋𝑦𝑋)) → (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2221ralrimivva 2954 . . . . 5 (((𝜑𝑠𝑉) ∧ 𝑟𝑈) → ∀𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2322reximdva0 3891 . . . 4 (((𝜑𝑠𝑉) ∧ 𝑈 ≠ ∅) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
247, 23mpdan 699 . . 3 ((𝜑𝑠𝑉) → ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
2524ralrimiva 2949 . 2 (𝜑 → ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))
26 isucn 21892 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
274, 8, 26syl2anc 691 . 2 (𝜑 → ((𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉) ↔ ((𝑋 × {𝐴}):𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → ((𝑋 × {𝐴})‘𝑥)𝑠((𝑋 × {𝐴})‘𝑦)))))
283, 25, 27mpbir2and 959 1 (𝜑 → (𝑋 × {𝐴}) ∈ (𝑈 Cnu𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wne 2780  wral 2896  wrex 2897  c0 3874  {csn 4125   class class class wbr 4583   × cxp 5036  wf 5800  cfv 5804  (class class class)co 6549  UnifOncust 21813   Cnucucn 21889
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-map 7746  df-ust 21814  df-ucn 21890
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator