Theorem tgcnp 23481

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 23465	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
5	1, 2, 3, 4	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
6		tgcn.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 = (topGen‘𝐵))
7		topontop 23141	. . . . . . . . . 10 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
8	2, 7	syl 18	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ Top)
9	6, 8	eqeltrrd 2861	. . . . . . . 8 ⊢ (𝜑 → (topGen‘𝐵) ∈ Top)
10		tgclb 23198	. . . . . . . 8 ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top)
11	9, 10	sylibr 237	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ TopBases)
12		bastg 23194	. . . . . . 7 ⊢ (𝐵 ∈ TopBases → 𝐵 ⊆ (topGen‘𝐵))
13	11, 12	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ (topGen‘𝐵))
14	13, 6	sseqtrrd 3968	. . . . 5 ⊢ (𝜑 → 𝐵 ⊆ 𝐾)
15		ssralv 4000	. . . . 5 ⊢ (𝐵 ⊆ 𝐾 → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
16	14, 15	syl 18	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
17	16	anim2d 624	. . 3 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
18	5, 17	sylbid 243	. 2 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
19	6	eleq2d 2846	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ 𝐾 ↔ 𝑧 ∈ (topGen‘𝐵)))
20	19	biimpa 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐾) → 𝑧 ∈ (topGen‘𝐵))
21		tg2 23193	. . . . . . . . 9 ⊢ ((𝑧 ∈ (topGen‘𝐵) ∧ (𝐹‘𝑃) ∈ 𝑧) → ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧))
22		r19.29 3125	. . . . . . . . . . 11 ⊢ ((∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑦 ∈ 𝐵 (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)))
23		sstr 3939	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 “ 𝑥) ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑧) → (𝐹 “ 𝑥) ⊆ 𝑧)
24	23	expcom 419	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ⊆ 𝑧 → ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ 𝑥) ⊆ 𝑧))
25	24	anim2d 624	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ⊆ 𝑧 → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
26	25	reximdv 3177	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ⊆ 𝑧 → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
27	26	com12 33	. . . . . . . . . . . . . 14 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑦 ⊆ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
28	27	imim2i 17	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑦 → (𝑦 ⊆ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
29	28	imp32 424	. . . . . . . . . . . 12 ⊢ ((((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
30	29	rexlimivw 3159	. . . . . . . . . . 11 ⊢ (∃𝑦 ∈ 𝐵 (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
31	22, 30	syl 18	. . . . . . . . . 10 ⊢ ((∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
32	31	expcom 419	. . . . . . . . 9 ⊢ (∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
33	21, 32	syl 18	. . . . . . . 8 ⊢ ((𝑧 ∈ (topGen‘𝐵) ∧ (𝐹‘𝑃) ∈ 𝑧) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
34	33	ex 418	. . . . . . 7 ⊢ (𝑧 ∈ (topGen‘𝐵) → ((𝐹‘𝑃) ∈ 𝑧 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
35	34	com23 87	. . . . . 6 ⊢ (𝑧 ∈ (topGen‘𝐵) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
36	20, 35	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐾) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
37	36	ralrimdva 3162	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
38	37	anim2d 624	. . 3 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
39		iscnp 23465	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
40	1, 2, 3, 39	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
41	38, 40	sylibrd 262	. 2 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)))
42	18, 41	impbid 215	1 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086   ⊆ wss 3899   “ cima 5658  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  topGenctg 17525  Topctop 23121  TopOnctopon 23138  TopBasesctb 23173   CnP ccnp 23453

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-map 8831  df-topgen 17531  df-top 23122  df-topon 23139  df-bases 23174  df-cnp 23456

This theorem is used by:  txcnp  23849  ptcnp  23851  metcnp3  24769