Theorem tgcnp 23140

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 23124	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
5	1, 2, 3, 4	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
6		tgcn.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 = (topGen‘𝐵))
7		topontop 22800	. . . . . . . . . 10 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
8	2, 7	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ Top)
9	6, 8	eqeltrrd 2829	. . . . . . . 8 ⊢ (𝜑 → (topGen‘𝐵) ∈ Top)
10		tgclb 22857	. . . . . . . 8 ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top)
11	9, 10	sylibr 234	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ TopBases)
12		bastg 22853	. . . . . . 7 ⊢ (𝐵 ∈ TopBases → 𝐵 ⊆ (topGen‘𝐵))
13	11, 12	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ (topGen‘𝐵))
14	13, 6	sseqtrrd 3984	. . . . 5 ⊢ (𝜑 → 𝐵 ⊆ 𝐾)
15		ssralv 4015	. . . . 5 ⊢ (𝐵 ⊆ 𝐾 → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
16	14, 15	syl 17	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))))
17	16	anim2d 612	. . 3 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
18	5, 17	sylbid 240	. 2 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))
19	6	eleq2d 2814	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ 𝐾 ↔ 𝑧 ∈ (topGen‘𝐵)))
20	19	biimpa 476	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐾) → 𝑧 ∈ (topGen‘𝐵))
21		tg2 22852	. . . . . . . . 9 ⊢ ((𝑧 ∈ (topGen‘𝐵) ∧ (𝐹‘𝑃) ∈ 𝑧) → ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧))
22		r19.29 3094	. . . . . . . . . . 11 ⊢ ((∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑦 ∈ 𝐵 (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)))
23		sstr 3955	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 “ 𝑥) ⊆ 𝑦 ∧ 𝑦 ⊆ 𝑧) → (𝐹 “ 𝑥) ⊆ 𝑧)
24	23	expcom 413	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ⊆ 𝑧 → ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ 𝑥) ⊆ 𝑧))
25	24	anim2d 612	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ⊆ 𝑧 → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
26	25	reximdv 3148	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ⊆ 𝑧 → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
27	26	com12 32	. . . . . . . . . . . . . 14 ⊢ (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑦 ⊆ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
28	27	imim2i 16	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑦 → (𝑦 ⊆ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
29	28	imp32 418	. . . . . . . . . . . 12 ⊢ ((((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
30	29	rexlimivw 3130	. . . . . . . . . . 11 ⊢ (∃𝑦 ∈ 𝐵 (((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
31	22, 30	syl 17	. . . . . . . . . 10 ⊢ ((∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) ∧ ∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))
32	31	expcom 413	. . . . . . . . 9 ⊢ (∃𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 ∧ 𝑦 ⊆ 𝑧) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
33	21, 32	syl 17	. . . . . . . 8 ⊢ ((𝑧 ∈ (topGen‘𝐵) ∧ (𝐹‘𝑃) ∈ 𝑧) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))
34	33	ex 412	. . . . . . 7 ⊢ (𝑧 ∈ (topGen‘𝐵) → ((𝐹‘𝑃) ∈ 𝑧 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
35	34	com23 86	. . . . . 6 ⊢ (𝑧 ∈ (topGen‘𝐵) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
36	20, 35	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐾) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
37	36	ralrimdva 3133	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)) → ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧))))
38	37	anim2d 612	. . 3 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
39		iscnp 23124	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃 ∈ 𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
40	1, 2, 3, 39	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑧 ∈ 𝐾 ((𝐹‘𝑃) ∈ 𝑧 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑧)))))
41	38, 40	sylibrd 259	. 2 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)))
42	18, 41	impbid 212	1 ⊢ (𝜑 → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053   ⊆ wss 3914   “ cima 5641  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387  topGenctg 17400  Topctop 22780  TopOnctopon 22797  TopBasesctb 22832   CnP ccnp 23112

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-map 8801  df-topgen 17406  df-top 22781  df-topon 22798  df-bases 22833  df-cnp 23115

This theorem is referenced by:  txcnp  23507  ptcnp  23509  metcnp3  24428