Theorem txcnpi 22667

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.

Step	Hyp	Ref	Expression
1		txcnpi.3	. . 3 ⊢ (𝜑 → 𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩))
2		txcnpi.4	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝐿)
3		df-ov 7258	. . . 4 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
4		txcnpi.7	. . . 4 ⊢ (𝜑 → (𝐴𝐹𝐵) ∈ 𝑈)
5	3, 4	eqeltrrid 2844	. . 3 ⊢ (𝜑 → (𝐹‘⟨𝐴, 𝐵⟩) ∈ 𝑈)
6		cnpimaex 22315	. . 3 ⊢ ((𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩) ∧ 𝑈 ∈ 𝐿 ∧ (𝐹‘⟨𝐴, 𝐵⟩) ∈ 𝑈) → ∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈))
7	1, 2, 5, 6	syl3anc 1369	. 2 ⊢ (𝜑 → ∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈))
8		eqid 2738	. . . . . . . . . 10 ⊢ ∪ (𝐽 ×t 𝐾) = ∪ (𝐽 ×t 𝐾)
9		eqid 2738	. . . . . . . . . 10 ⊢ ∪ 𝐿 = ∪ 𝐿
10	8, 9	cnpf 22306	. . . . . . . . 9 ⊢ (𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩) → 𝐹:∪ (𝐽 ×t 𝐾)⟶∪ 𝐿)
11	1, 10	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:∪ (𝐽 ×t 𝐾)⟶∪ 𝐿)
12	11	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → 𝐹:∪ (𝐽 ×t 𝐾)⟶∪ 𝐿)
13	12	ffund 6588	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → Fun 𝐹)
14		elssuni 4868	. . . . . . 7 ⊢ (𝑤 ∈ (𝐽 ×t 𝐾) → 𝑤 ⊆ ∪ (𝐽 ×t 𝐾))
15	11	fdmd 6595	. . . . . . . . 9 ⊢ (𝜑 → dom 𝐹 = ∪ (𝐽 ×t 𝐾))
16	15	sseq2d 3949	. . . . . . . 8 ⊢ (𝜑 → (𝑤 ⊆ dom 𝐹 ↔ 𝑤 ⊆ ∪ (𝐽 ×t 𝐾)))
17	16	biimpar 477	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ⊆ ∪ (𝐽 ×t 𝐾)) → 𝑤 ⊆ dom 𝐹)
18	14, 17	sylan2 592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → 𝑤 ⊆ dom 𝐹)
19		funimass3 6913	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑤 ⊆ dom 𝐹) → ((𝐹 “ 𝑤) ⊆ 𝑈 ↔ 𝑤 ⊆ (◡𝐹 “ 𝑈)))
20	13, 18, 19	syl2anc 583	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((𝐹 “ 𝑤) ⊆ 𝑈 ↔ 𝑤 ⊆ (◡𝐹 “ 𝑈)))
21	20	anbi2d 628	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ 𝑤 ⊆ (◡𝐹 “ 𝑈))))
22		txcnpi.1	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
23		txcnpi.2	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
24		eltx 22627	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑤 ∈ (𝐽 ×t 𝐾) ↔ ∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
25	22, 23, 24	syl2anc 583	. . . . . 6 ⊢ (𝜑 → (𝑤 ∈ (𝐽 ×t 𝐾) ↔ ∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
26	25	biimpa 476	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤))
27		eleq1 2826	. . . . . . . . . 10 ⊢ (𝑧 = ⟨𝐴, 𝐵⟩ → (𝑧 ∈ (𝑢 × 𝑣) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣)))
28	27	anbi1d 629	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝐴, 𝐵⟩ → ((𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
29	28	2rexbidv 3228	. . . . . . . 8 ⊢ (𝑧 = ⟨𝐴, 𝐵⟩ → (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
30	29	rspccv 3549	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (⟨𝐴, 𝐵⟩ ∈ 𝑤 → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
31		sstr2 3924	. . . . . . . . . . . . 13 ⊢ ((𝑢 × 𝑣) ⊆ 𝑤 → (𝑤 ⊆ (◡𝐹 “ 𝑈) → (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))
32	31	com12 32	. . . . . . . . . . . 12 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → ((𝑢 × 𝑣) ⊆ 𝑤 → (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))
33	32	anim2d 611	. . . . . . . . . . 11 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → (((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
34		opelxp 5616	. . . . . . . . . . . 12 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ↔ (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣))
35	34	anbi1i 623	. . . . . . . . . . 11 ⊢ ((⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤))
36		df-3an 1087	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)) ↔ ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))
37	33, 35, 36	3imtr4g 295	. . . . . . . . . 10 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → ((⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
38	37	reximdv 3201	. . . . . . . . 9 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → (∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
39	38	reximdv 3201	. . . . . . . 8 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
40	39	com12 32	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (𝑤 ⊆ (◡𝐹 “ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
41	30, 40	syl6 35	. . . . . 6 ⊢ (∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (⟨𝐴, 𝐵⟩ ∈ 𝑤 → (𝑤 ⊆ (◡𝐹 “ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))))
42	41	impd 410	. . . . 5 ⊢ (∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ 𝑤 ⊆ (◡𝐹 “ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
43	26, 42	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ 𝑤 ⊆ (◡𝐹 “ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
44	21, 43	sylbid 239	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
45	44	rexlimdva 3212	. 2 ⊢ (𝜑 → (∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
46	7, 45	mpd 15	1 ⊢ (𝜑 → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064   ⊆ wss 3883  ⟨cop 4564  ∪ cuni 4836   × cxp 5578  ^◡ccnv 5579  dom cdm 5580   “ cima 5583  Fun wfun 6412  ⟶wf 6414  ‘cfv 6418  (class class class)co 7255  TopOnctopon 21967   CnP ccnp 22284   ×_t ctx 22619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-map 8575  df-topgen 17071  df-top 21951  df-topon 21968  df-cnp 22287  df-tx 22621

This theorem is referenced by:  tmdcn2  23148