Theorem txcnpi 23835

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 7419	. . . 4 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
4		txcnpi.7	. . . 4 ⊢ (𝜑 → (𝐴𝐹𝐵) ∈ 𝑈)
5	3, 4	eqeltrrid 2867	. . 3 ⊢ (𝜑 → (𝐹‘⟨𝐴, 𝐵⟩) ∈ 𝑈)
6		cnpimaex 23482	. . 3 ⊢ ((𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩) ∧ 𝑈 ∈ 𝐿 ∧ (𝐹‘⟨𝐴, 𝐵⟩) ∈ 𝑈) → ∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈))
7	1, 2, 5, 6	syl3anc 1398	. 2 ⊢ (𝜑 → ∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈))
8		eqid 2762	. . . . . . . . . 10 ⊢ ∪ (𝐽 ×t 𝐾) = ∪ (𝐽 ×t 𝐾)
9		eqid 2762	. . . . . . . . . 10 ⊢ ∪ 𝐿 = ∪ 𝐿
10	8, 9	cnpf 23473	. . . . . . . . 9 ⊢ (𝐹 ∈ (((𝐽 ×t 𝐾) CnP 𝐿)‘⟨𝐴, 𝐵⟩) → 𝐹:∪ (𝐽 ×t 𝐾)⟶∪ 𝐿)
11	1, 10	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:∪ (𝐽 ×t 𝐾)⟶∪ 𝐿)
12	11	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → 𝐹:∪ (𝐽 ×t 𝐾)⟶∪ 𝐿)
13	12	ffund 6711	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → Fun 𝐹)
14		elssuni 4902	. . . . . . 7 ⊢ (𝑤 ∈ (𝐽 ×t 𝐾) → 𝑤 ⊆ ∪ (𝐽 ×t 𝐾))
15	11	fdmd 6717	. . . . . . . . 9 ⊢ (𝜑 → dom 𝐹 = ∪ (𝐽 ×t 𝐾))
16	15	sseq2d 3966	. . . . . . . 8 ⊢ (𝜑 → (𝑤 ⊆ dom 𝐹 ↔ 𝑤 ⊆ ∪ (𝐽 ×t 𝐾)))
17	16	biimpar 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ⊆ ∪ (𝐽 ×t 𝐾)) → 𝑤 ⊆ dom 𝐹)
18	14, 17	sylan2 605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → 𝑤 ⊆ dom 𝐹)
19		funimass3 7050	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑤 ⊆ dom 𝐹) → ((𝐹 “ 𝑤) ⊆ 𝑈 ↔ 𝑤 ⊆ (◡𝐹 “ 𝑈)))
20	13, 18, 19	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((𝐹 “ 𝑤) ⊆ 𝑈 ↔ 𝑤 ⊆ (◡𝐹 “ 𝑈)))
21	20	anbi2d 642	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ 𝑤 ⊆ (◡𝐹 “ 𝑈))))
22		txcnpi.1	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
23		txcnpi.2	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
24		eltx 23795	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝑤 ∈ (𝐽 ×t 𝐾) ↔ ∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
25	22, 23, 24	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (𝑤 ∈ (𝐽 ×t 𝐾) ↔ ∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
26	25	biimpa 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤))
27		eleq1 2850	. . . . . . . . . 10 ⊢ (𝑧 = ⟨𝐴, 𝐵⟩ → (𝑧 ∈ (𝑢 × 𝑣) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣)))
28	27	anbi1d 643	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝐴, 𝐵⟩ → ((𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
29	28	2rexbidv 3229	. . . . . . . 8 ⊢ (𝑧 = ⟨𝐴, 𝐵⟩ → (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
30	29	rspccv 3576	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (⟨𝐴, 𝐵⟩ ∈ 𝑤 → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤)))
31		sstr2 3941	. . . . . . . . . . . . 13 ⊢ ((𝑢 × 𝑣) ⊆ 𝑤 → (𝑤 ⊆ (◡𝐹 “ 𝑈) → (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))
32	31	com12 33	. . . . . . . . . . . 12 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → ((𝑢 × 𝑣) ⊆ 𝑤 → (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))
33	32	anim2d 624	. . . . . . . . . . 11 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → (((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
34		opelxp 5695	. . . . . . . . . . . 12 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ↔ (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣))
35	34	anbi1i 636	. . . . . . . . . . 11 ⊢ ((⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) ↔ ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤))
36		df-3an 1105	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)) ↔ ((𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))
37	33, 35, 36	3imtr4g 299	. . . . . . . . . 10 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → ((⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
38	37	reximdv 3179	. . . . . . . . 9 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → (∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
39	38	reximdv 3179	. . . . . . . 8 ⊢ (𝑤 ⊆ (◡𝐹 “ 𝑈) → (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
40	39	com12 33	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (⟨𝐴, 𝐵⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (𝑤 ⊆ (◡𝐹 “ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
41	30, 40	syl6 36	. . . . . 6 ⊢ (∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → (⟨𝐴, 𝐵⟩ ∈ 𝑤 → (𝑤 ⊆ (◡𝐹 “ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))))
42	41	impd 416	. . . . 5 ⊢ (∀𝑧 ∈ 𝑤 ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝑧 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑤) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ 𝑤 ⊆ (◡𝐹 “ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
43	26, 42	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ 𝑤 ⊆ (◡𝐹 “ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
44	21, 43	sylbid 243	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝐽 ×t 𝐾)) → ((⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
45	44	rexlimdva 3165	. 2 ⊢ (𝜑 → (∃𝑤 ∈ (𝐽 ×t 𝐾)(⟨𝐴, 𝐵⟩ ∈ 𝑤 ∧ (𝐹 “ 𝑤) ⊆ 𝑈) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈))))
46	7, 45	mpd 16	1 ⊢ (𝜑 → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐾 (𝐴 ∈ 𝑢 ∧ 𝐵 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡𝐹 “ 𝑈)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902  ⟨cop 4593  ∪ cuni 4870   × cxp 5657  ^◡ccnv 5658  dom cdm 5659   “ cima 5662  Fun wfun 6531  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416  TopOnctopon 23136   CnP ccnp 23451   ×_t ctx 23787

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831  df-topgen 17532  df-top 23120  df-topon 23137  df-cnp 23454  df-tx 23789

This theorem is used by:  tmdcn2  24316