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

Theorem isucn 24287
Description: The predicate "𝐹 is a uniformly continuous function from uniform space 𝑈 to uniform space 𝑉". (Contributed by Thierry Arnoux, 16-Nov-2017.)
Assertion
Ref Expression
isucn ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → (𝐹 ∈ (𝑈 Cnu𝑉) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦)))))
Distinct variable groups:   𝑠,𝑟,𝑥,𝑦,𝐹   𝑈,𝑟,𝑠,𝑥,𝑦   𝑉,𝑟,𝑠,𝑥   𝑋,𝑟,𝑠,𝑥,𝑦   𝑌,𝑟,𝑠,𝑥
Allowed substitution hints:   𝑉(𝑦)   𝑌(𝑦)

Proof of Theorem isucn
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 ucnval 24286 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → (𝑈 Cnu𝑉) = {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦))})
21eleq2d 2827 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → (𝐹 ∈ (𝑈 Cnu𝑉) ↔ 𝐹 ∈ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦))}))
3 fveq1 6905 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
4 fveq1 6905 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
53, 4breq12d 5156 . . . . . . . 8 (𝑓 = 𝐹 → ((𝑓𝑥)𝑠(𝑓𝑦) ↔ (𝐹𝑥)𝑠(𝐹𝑦)))
65imbi2d 340 . . . . . . 7 (𝑓 = 𝐹 → ((𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦)) ↔ (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦))))
76ralbidv 3178 . . . . . 6 (𝑓 = 𝐹 → (∀𝑦𝑋 (𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦)) ↔ ∀𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦))))
87rexralbidv 3223 . . . . 5 (𝑓 = 𝐹 → (∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦)) ↔ ∃𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦))))
98ralbidv 3178 . . . 4 (𝑓 = 𝐹 → (∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦)) ↔ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦))))
109elrab 3692 . . 3 (𝐹 ∈ {𝑓 ∈ (𝑌m 𝑋) ∣ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝑓𝑥)𝑠(𝑓𝑦))} ↔ (𝐹 ∈ (𝑌m 𝑋) ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦))))
112, 10bitrdi 287 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → (𝐹 ∈ (𝑈 Cnu𝑉) ↔ (𝐹 ∈ (𝑌m 𝑋) ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦)))))
12 elfvex 6944 . . . 4 (𝑉 ∈ (UnifOn‘𝑌) → 𝑌 ∈ V)
13 elfvex 6944 . . . 4 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
14 elmapg 8879 . . . 4 ((𝑌 ∈ V ∧ 𝑋 ∈ V) → (𝐹 ∈ (𝑌m 𝑋) ↔ 𝐹:𝑋𝑌))
1512, 13, 14syl2anr 597 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → (𝐹 ∈ (𝑌m 𝑋) ↔ 𝐹:𝑋𝑌))
1615anbi1d 631 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → ((𝐹 ∈ (𝑌m 𝑋) ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦))) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦)))))
1711, 16bitrd 279 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ (UnifOn‘𝑌)) → (𝐹 ∈ (𝑈 Cnu𝑉) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑠𝑉𝑟𝑈𝑥𝑋𝑦𝑋 (𝑥𝑟𝑦 → (𝐹𝑥)𝑠(𝐹𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wral 3061  wrex 3070  {crab 3436  Vcvv 3480   class class class wbr 5143  wf 6557  cfv 6561  (class class class)co 7431  m cmap 8866  UnifOncust 24208   Cnucucn 24284
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-map 8868  df-ust 24209  df-ucn 24285
This theorem is referenced by:  isucn2  24288  ucnima  24290  iducn  24292  cstucnd  24293  ucncn  24294  fmucnd  24301  ucnextcn  24313
  Copyright terms: Public domain W3C validator