Theorem tgcn 13375

Description: The continuity predicate when the range is given by a basis for a topology. (Contributed by Mario Carneiro, 7-Feb-2015.) (Revised by Mario Carneiro, 22-Aug-2015.)

Hypotheses

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

Assertion

Ref	Expression
tgcn	⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽)))

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

Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem tgcn

Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tgcn.1	. . 3 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
2		tgcn.4	. . 3 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
3		iscn 13364	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽)))
4	1, 2, 3	syl2anc 411	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽)))
5		tgcn.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 = (topGen‘𝐵))
6		topontop 13179	. . . . . . . . . 10 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
7	2, 6	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ Top)
8	5, 7	eqeltrrd 2255	. . . . . . . 8 ⊢ (𝜑 → (topGen‘𝐵) ∈ Top)
9		tgclb 13232	. . . . . . . 8 ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top)
10	8, 9	sylibr 134	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ TopBases)
11		bastg 13228	. . . . . . 7 ⊢ (𝐵 ∈ TopBases → 𝐵 ⊆ (topGen‘𝐵))
12	10, 11	syl 14	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ (topGen‘𝐵))
13	12, 5	sseqtrrd 3194	. . . . 5 ⊢ (𝜑 → 𝐵 ⊆ 𝐾)
14		ssralv 3219	. . . . 5 ⊢ (𝐵 ⊆ 𝐾 → (∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽))
15	13, 14	syl 14	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽))
16	5	eleq2d 2247	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐾 ↔ 𝑥 ∈ (topGen‘𝐵)))
17		eltg3 13224	. . . . . . . . . 10 ⊢ (𝐵 ∈ TopBases → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑧)))
18	10, 17	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑧)))
19	16, 18	bitrd 188	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐾 ↔ ∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑧)))
20		ssralv 3219	. . . . . . . . . . . 12 ⊢ (𝑧 ⊆ 𝐵 → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∀𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽))
21		topontop 13179	. . . . . . . . . . . . . 14 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
22	1, 21	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐽 ∈ Top)
23		iunopn 13167	. . . . . . . . . . . . . 14 ⊢ ((𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽) → ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽)
24	23	ex 115	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ Top → (∀𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽))
25	22, 24	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → (∀𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽))
26	20, 25	sylan9r 410	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ⊆ 𝐵) → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽))
27		imaeq2 4962	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ∪ 𝑧 → (◡𝐹 “ 𝑥) = (◡𝐹 “ ∪ 𝑧))
28		imauni 5756	. . . . . . . . . . . . . 14 ⊢ (◡𝐹 “ ∪ 𝑧) = ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦)
29	27, 28	eqtrdi 2226	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∪ 𝑧 → (◡𝐹 “ 𝑥) = ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦))
30	29	eleq1d 2246	. . . . . . . . . . . 12 ⊢ (𝑥 = ∪ 𝑧 → ((◡𝐹 “ 𝑥) ∈ 𝐽 ↔ ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽))
31	30	imbi2d 230	. . . . . . . . . . 11 ⊢ (𝑥 = ∪ 𝑧 → ((∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → (◡𝐹 “ 𝑥) ∈ 𝐽) ↔ (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∪ 𝑦 ∈ 𝑧 (◡𝐹 “ 𝑦) ∈ 𝐽)))
32	26, 31	syl5ibrcom 157	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ⊆ 𝐵) → (𝑥 = ∪ 𝑧 → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
33	32	expimpd 363	. . . . . . . . 9 ⊢ (𝜑 → ((𝑧 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑧) → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
34	33	exlimdv 1819	. . . . . . . 8 ⊢ (𝜑 → (∃𝑧(𝑧 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑧) → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
35	19, 34	sylbid 150	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐾 → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → (◡𝐹 “ 𝑥) ∈ 𝐽)))
36	35	imp 124	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐾) → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → (◡𝐹 “ 𝑥) ∈ 𝐽))
37	36	ralrimdva 2557	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽))
38		imaeq2 4962	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑦))
39	38	eleq1d 2246	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((◡𝐹 “ 𝑥) ∈ 𝐽 ↔ (◡𝐹 “ 𝑦) ∈ 𝐽))
40	39	cbvralv 2703	. . . . 5 ⊢ (∀𝑥 ∈ 𝐾 (◡𝐹 “ 𝑥) ∈ 𝐽 ↔ ∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽)
41	37, 40	syl6ib 161	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽 → ∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽))
42	15, 41	impbid 129	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽 ↔ ∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽))
43	42	anbi2d 464	. 2 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (◡𝐹 “ 𝑦) ∈ 𝐽) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽)))
44	4, 43	bitrd 188	1 ⊢ (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐵 (◡𝐹 “ 𝑦) ∈ 𝐽)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ∀wral 2455   ⊆ wss 3129  ∪ cuni 3807  ∪ ciun 3884  ^◡ccnv 4622   “ cima 4626  ⟶wf 5208  ‘cfv 5212  (class class class)co 5869  topGenctg 12651  Topctop 13162  TopOnctopon 13175  TopBasesctb 13207   Cn ccn 13352

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-map 6644  df-topgen 12657  df-top 13163  df-topon 13176  df-bases 13208  df-cn 13355

This theorem is referenced by:  txcnmpt  13440