Theorem cnconst2 14676

Description: A constant function is continuous. (Contributed by Mario Carneiro, 19-Mar-2015.)

Assertion

Ref	Expression
cnconst2	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾))

Proof of Theorem cnconst2

Dummy variables 𝑥 𝑢 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fconst6g 5473	. . 3 ⊢ (𝐵 ∈ 𝑌 → (𝑋 × {𝐵}):𝑋⟶𝑌)
2	1	3ad2ant3 1022	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}):𝑋⟶𝑌)
3	2	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐵}):𝑋⟶𝑌)
4		simpll3 1040	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → 𝐵 ∈ 𝑌)
5		simplr 528	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → 𝑥 ∈ 𝑋)
6		fvconst2g 5797	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑌 ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
7	4, 5, 6	syl2anc 411	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
8	7	eleq1d 2273	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 ↔ 𝐵 ∈ 𝑦))
9		simpll1 1038	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝐽 ∈ (TopOn‘𝑋))
10		toponmax 14468	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
11	9, 10	syl 14	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝑋 ∈ 𝐽)
12		simplr 528	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝑥 ∈ 𝑋)
13		df-ima 4687	. . . . . . . . 9 ⊢ ((𝑋 × {𝐵}) “ 𝑋) = ran ((𝑋 × {𝐵}) ↾ 𝑋)
14		ssid 3212	. . . . . . . . . . . . 13 ⊢ 𝑋 ⊆ 𝑋
15		xpssres 4993	. . . . . . . . . . . . 13 ⊢ (𝑋 ⊆ 𝑋 → ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵}))
16	14, 15	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵})
17	16	rneqi 4905	. . . . . . . . . . 11 ⊢ ran ((𝑋 × {𝐵}) ↾ 𝑋) = ran (𝑋 × {𝐵})
18		rnxpss 5113	. . . . . . . . . . 11 ⊢ ran (𝑋 × {𝐵}) ⊆ {𝐵}
19	17, 18	eqsstri 3224	. . . . . . . . . 10 ⊢ ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ {𝐵}
20		simprr 531	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝐵 ∈ 𝑦)
21	20	snssd 3777	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → {𝐵} ⊆ 𝑦)
22	19, 21	sstrid 3203	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ 𝑦)
23	13, 22	eqsstrid 3238	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)
24		eleq2 2268	. . . . . . . . . 10 ⊢ (𝑢 = 𝑋 → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ 𝑋))
25		imaeq2 5017	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑋 → ((𝑋 × {𝐵}) “ 𝑢) = ((𝑋 × {𝐵}) “ 𝑋))
26	25	sseq1d 3221	. . . . . . . . . 10 ⊢ (𝑢 = 𝑋 → (((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦 ↔ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦))
27	24, 26	anbi12d 473	. . . . . . . . 9 ⊢ (𝑢 = 𝑋 → ((𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)))
28	27	rspcev 2876	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐽 ∧ (𝑥 ∈ 𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
29	11, 12, 23, 28	syl12anc 1247	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
30	29	expr 375	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (𝐵 ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
31	8, 30	sylbid 150	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
32	31	ralrimiva 2578	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
33		simpl1 1002	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
34		simpl2 1003	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐾 ∈ (TopOn‘𝑌))
35		simpr 110	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
36		iscnp 14642	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
37	33, 34, 35, 36	syl3anc 1249	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
38	3, 32, 37	mpbir2and 946	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
39	38	ralrimiva 2578	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
40		cncnp 14673	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
41	40	3adant3 1019	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
42	2, 39, 41	mpbir2and 946	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1372   ∈ wcel 2175  ∀wral 2483  ∃wrex 2484   ⊆ wss 3165  {csn 3632   × cxp 4672  ran crn 4675   ↾ cres 4676   “ cima 4677  ⟶wf 5266  ‘cfv 5270  (class class class)co 5943  TopOnctopon 14453   Cn ccn 14628   CnP ccnp 14629

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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-map 6736  df-topgen 13063  df-top 14441  df-topon 14454  df-cn 14631  df-cnp 14632

This theorem is referenced by:  cnconst  14677  cnmptc  14725