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

Theorem txcnpi 21221
Description: Continuity of a two-argument function at a point. (Contributed by Mario Carneiro, 20-Sep-2015.)
Hypotheses
Ref Expression
txcnpi.1 (𝜑𝐽 ∈ (TopOn‘𝑋))
txcnpi.2 (𝜑𝐾 ∈ (TopOn‘𝑌))
txcnpi.3 (𝜑𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩))
txcnpi.4 (𝜑𝑈𝐿)
txcnpi.5 (𝜑𝐴𝑋)
txcnpi.6 (𝜑𝐵𝑌)
txcnpi.7 (𝜑 → (𝐴𝐹𝐵) ∈ 𝑈)
Assertion
Ref Expression
txcnpi (𝜑 → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈)))
Distinct variable groups:   𝑣,𝑢,𝐴   𝑢,𝐵,𝑣   𝑢,𝐹,𝑣   𝑢,𝐽,𝑣   𝑢,𝐾,𝑣   𝑢,𝑈,𝑣
Allowed substitution hints:   𝜑(𝑣,𝑢)   𝐿(𝑣,𝑢)   𝑋(𝑣,𝑢)   𝑌(𝑣,𝑢)

Proof of Theorem txcnpi
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 txcnpi.3 . . 3 (𝜑𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩))
2 txcnpi.4 . . 3 (𝜑𝑈𝐿)
3 df-ov 6552 . . . 4 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
4 txcnpi.7 . . . 4 (𝜑 → (𝐴𝐹𝐵) ∈ 𝑈)
53, 4syl5eqelr 2693 . . 3 (𝜑 → (𝐹‘⟨𝐴, 𝐵⟩) ∈ 𝑈)
6 cnpimaex 20870 . . 3 ((𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩) ∧ 𝑈𝐿 ∧ (𝐹‘⟨𝐴, 𝐵⟩) ∈ 𝑈) → ∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹𝑤) ⊆ 𝑈))
71, 2, 5, 6syl3anc 1318 . 2 (𝜑 → ∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹𝑤) ⊆ 𝑈))
8 eqid 2610 . . . . . . . . . 10 (𝐽 ×t 𝐾) = (𝐽 ×t 𝐾)
9 eqid 2610 . . . . . . . . . 10 𝐿 = 𝐿
108, 9cnpf 20861 . . . . . . . . 9 (𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩) → 𝐹: (𝐽 ×t 𝐾)⟶ 𝐿)
111, 10syl 17 . . . . . . . 8 (𝜑𝐹: (𝐽 ×t 𝐾)⟶ 𝐿)
1211adantr 480 . . . . . . 7 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → 𝐹: (𝐽 ×t 𝐾)⟶ 𝐿)
13 ffun 5961 . . . . . . 7 (𝐹: (𝐽 ×t 𝐾)⟶ 𝐿 → Fun 𝐹)
1412, 13syl 17 . . . . . 6 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → Fun 𝐹)
15 elssuni 4403 . . . . . . 7 (𝑤 ∈ (𝐽 ×t 𝐾) → 𝑤 (𝐽 ×t 𝐾))
16 fdm 5964 . . . . . . . . . 10 (𝐹: (𝐽 ×t 𝐾)⟶ 𝐿 → dom 𝐹 = (𝐽 ×t 𝐾))
1711, 16syl 17 . . . . . . . . 9 (𝜑 → dom 𝐹 = (𝐽 ×t 𝐾))
1817sseq2d 3596 . . . . . . . 8 (𝜑 → (𝑤 ⊆ dom 𝐹𝑤 (𝐽 ×t 𝐾)))
1918biimpar 501 . . . . . . 7 ((𝜑𝑤 (𝐽 ×t 𝐾)) → 𝑤 ⊆ dom 𝐹)
2015, 19sylan2 490 . . . . . 6 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → 𝑤 ⊆ dom 𝐹)
21 funimass3 6241 . . . . . 6 ((Fun 𝐹𝑤 ⊆ dom 𝐹) → ((𝐹𝑤) ⊆ 𝑈𝑤 ⊆ (𝐹𝑈)))
2214, 20, 21syl2anc 691 . . . . 5 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → ((𝐹𝑤) ⊆ 𝑈𝑤 ⊆ (𝐹𝑈)))
2322anbi2d 736 . . . 4 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹𝑤) ⊆ 𝑈) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑤𝑤 ⊆ (𝐹𝑈))))
24 txcnpi.1 . . . . . . 7 (𝜑𝐽 ∈ (TopOn‘𝑋))
25 txcnpi.2 . . . . . . 7 (𝜑𝐾 ∈ (TopOn‘𝑌))
26 eltx 21181 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑤 ∈ (𝐽 ×t 𝐾) ↔ ∀𝑧𝑤𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
2724, 25, 26syl2anc 691 . . . . . 6 (𝜑 → (𝑤 ∈ (𝐽 ×t 𝐾) ↔ ∀𝑧𝑤𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
2827biimpa 500 . . . . 5 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → ∀𝑧𝑤𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤))
29 eleq1 2676 . . . . . . . . . 10 (𝑧 = ⟨𝐴, 𝐵⟩ → (𝑧 ∈ (𝑢 × 𝑣) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣)))
3029anbi1d 737 . . . . . . . . 9 (𝑧 = ⟨𝐴, 𝐵⟩ → ((𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
31302rexbidv 3039 . . . . . . . 8 (𝑧 = ⟨𝐴, 𝐵⟩ → (∃𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ ∃𝑢𝐽𝑣𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
3231rspccv 3279 . . . . . . 7 (∀𝑧𝑤𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (⟨𝐴, 𝐵⟩ ∈ 𝑤 → ∃𝑢𝐽𝑣𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
33 sstr2 3575 . . . . . . . . . . . . 13 ((𝑢 × 𝑣) ⊆ 𝑤 → (𝑤 ⊆ (𝐹𝑈) → (𝑢 × 𝑣) ⊆ (𝐹𝑈)))
3433com12 32 . . . . . . . . . . . 12 (𝑤 ⊆ (𝐹𝑈) → ((𝑢 × 𝑣) ⊆ 𝑤 → (𝑢 × 𝑣) ⊆ (𝐹𝑈)))
3534anim2d 587 . . . . . . . . . . 11 (𝑤 ⊆ (𝐹𝑈) → (((𝐴𝑢𝐵𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ((𝐴𝑢𝐵𝑣) ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
36 opelxp 5070 . . . . . . . . . . . 12 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ↔ (𝐴𝑢𝐵𝑣))
3736anbi1i 727 . . . . . . . . . . 11 ((⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ ((𝐴𝑢𝐵𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤))
38 df-3an 1033 . . . . . . . . . . 11 ((𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈)) ↔ ((𝐴𝑢𝐵𝑣) ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈)))
3935, 37, 383imtr4g 284 . . . . . . . . . 10 (𝑤 ⊆ (𝐹𝑈) → ((⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4039reximdv 2999 . . . . . . . . 9 (𝑤 ⊆ (𝐹𝑈) → (∃𝑣𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ∃𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4140reximdv 2999 . . . . . . . 8 (𝑤 ⊆ (𝐹𝑈) → (∃𝑢𝐽𝑣𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4241com12 32 . . . . . . 7 (∃𝑢𝐽𝑣𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (𝑤 ⊆ (𝐹𝑈) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4332, 42syl6 34 . . . . . 6 (∀𝑧𝑤𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (⟨𝐴, 𝐵⟩ ∈ 𝑤 → (𝑤 ⊆ (𝐹𝑈) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈)))))
4443impd 446 . . . . 5 (∀𝑧𝑤𝑢𝐽𝑣𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤𝑤 ⊆ (𝐹𝑈)) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4528, 44syl 17 . . . 4 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤𝑤 ⊆ (𝐹𝑈)) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4623, 45sylbid 229 . . 3 ((𝜑𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹𝑤) ⊆ 𝑈) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
4746rexlimdva 3013 . 2 (𝜑 → (∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹𝑤) ⊆ 𝑈) → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈))))
487, 47mpd 15 1 (𝜑 → ∃𝑢𝐽𝑣𝐾 (𝐴𝑢𝐵𝑣 ∧ (𝑢 × 𝑣) ⊆ (𝐹𝑈)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  wrex 2897  wss 3540  cop 4131   cuni 4372   × cxp 5036  ccnv 5037  dom cdm 5038  cima 5041  Fun wfun 5798  wf 5800  cfv 5804  (class class class)co 6549  TopOnctopon 20518   CnP ccnp 20839   ×t ctx 21173
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-iun 4457  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-ima 5051  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-1st 7059  df-2nd 7060  df-map 7746  df-topgen 15927  df-top 20521  df-topon 20523  df-cnp 20842  df-tx 21175
This theorem is referenced by:  tmdcn2  21703
  Copyright terms: Public domain W3C validator