Theorem tgcnp 15310

Description: The "continuous at a point" predicate when the range is given by a basis for a topology. (Contributed by Mario Carneiro, 3-Feb-2015.) (Revised by Mario Carneiro, 22-Aug-2015.)

Hypotheses

Ref	Expression
tgcn.1	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
tgcn.3	⊢ (𝜑 → 𝐾 = (topGen‘𝐵))
tgcn.4	⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
tgcnp.5	⊢ (𝜑 → 𝑃 ∈ 𝑋)

Assertion

Ref	Expression
tgcnp	⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐹,𝑦   𝑥,𝐽,𝑦   𝑥,𝐾,𝑦   𝑥,𝑃,𝑦   𝜑,𝑥   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦

Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem tgcnp

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tgcn.1	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
2		tgcn.4	. . . 4 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
3		tgcnp.5	. . . 4 ⊢ (𝜑 → 𝑃 ∈ 𝑋)
4		iscnp 15300	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
5	1, 2, 3, 4	syl3anc 1278	. . 3 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
6		tgcn.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 = (topGen‘𝐵))
7		topontop 15115	. . . . . . . . . 10 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
8	2, 7	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ Top)
9	6, 8	eqeltrrd 2316	. . . . . . . 8 ⊢ (𝜑 → (topGen‘𝐵) ∈ Top)
10		tgclb 15166	. . . . . . . 8 ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top)
11	9, 10	sylibr 134	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ TopBases)
12		bastg 15162	. . . . . . 7 ⊢ (𝐵 ∈ TopBases → 𝐵 ⊆ (topGen‘𝐵))
13	11, 12	syl 14	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ (topGen‘𝐵))
14	13, 6	sseqtrrd 3287	. . . . 5 ⊢ (𝜑 → 𝐵 ⊆ 𝐾)
15		ssralv 3312	. . . . 5 ⊢ (𝐵 ⊆ 𝐾 → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
16	14, 15	syl 14	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
17	16	anim2d 337	. . 3 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
18	5, 17	sylbid 150	. 2 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
19	6	eleq2d 2308	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ 𝐾 ↔ 𝑧 ∈ (topGen‘𝐵)))
20	19	biimpa 296	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐾) → 𝑧 ∈ (topGen‘𝐵))
21		tg2 15161	. . . . . . . . 9 ⊢ ((𝑧 ∈ (topGen‘𝐵) ∧ (𝐹‘𝑃) ∈ 𝑧) → ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧))
22		r19.29 2688	. . . . . . . . . . 11 ⊢ ((∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑦 ∈ 𝐵 (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)))
23		sstr 3256	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 “ 𝑥) ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑧) → (𝐹 “ 𝑥) ⊆ 𝑧)
24	23	expcom 116	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ⊆ 𝑧 → ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ 𝑥) ⊆ 𝑧))
25	24	anim2d 337	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ⊆ 𝑧 → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
26	25	reximdv 2651	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ⊆ 𝑧 → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
27	26	com12 30	. . . . . . . . . . . . . 14 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑦 ⊆ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
28	27	imim2i 12	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑦 → (𝑦 ⊆ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
29	28	imp32 257	. . . . . . . . . . . 12 ⊢ ((((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
30	29	rexlimivw 2664	. . . . . . . . . . 11 ⊢ (∃𝑦 ∈ 𝐵 (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
31	22, 30	syl 14	. . . . . . . . . 10 ⊢ ((∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
32	31	expcom 116	. . . . . . . . 9 ⊢ (∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
33	21, 32	syl 14	. . . . . . . 8 ⊢ ((𝑧 ∈ (topGen‘𝐵) ∧ (𝐹‘𝑃) ∈ 𝑧) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
34	33	ex 115	. . . . . . 7 ⊢ (𝑧 ∈ (topGen‘𝐵) → ((𝐹‘𝑃) ∈ 𝑧 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
35	34	com23 78	. . . . . 6 ⊢ (𝑧 ∈ (topGen‘𝐵) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
36	20, 35	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐾) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
37	36	ralrimdva 2630	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
38	37	anim2d 337	. . 3 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
39		iscnp 15300	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
40	1, 2, 3, 39	syl3anc 1278	. . 3 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
41	38, 40	sylibrd 169	. 2 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)))
42	18, 41	impbid 129	1 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529   ⊆ wss 3220   “ cima 4777  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085  topGenctg 13608  Topctop 15098  TopOnctopon 15111  TopBasesctb 15143   CnP ccnp 15287

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-topgen 13614  df-top 15099  df-topon 15112  df-bases 15144  df-cnp 15290

This theorem is used by:  txcnp  15372  metcnp3  15612