Theorem cnconst2 15098

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 5566	. . 3 ⊢ (𝐵 ∈ 𝑌 → (𝑋 × {𝐵}):𝑋⟶𝑌)
2	1	3ad2ant3 1047	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}):𝑋⟶𝑌)
3	2	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐵}):𝑋⟶𝑌)
4		simpll3 1065	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → 𝐵 ∈ 𝑌)
5		simplr 529	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → 𝑥 ∈ 𝑋)
6		fvconst2g 5898	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑌 ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
7	4, 5, 6	syl2anc 411	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
8	7	eleq1d 2301	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 ↔ 𝐵 ∈ 𝑦))
9		simpll1 1063	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝐽 ∈ (TopOn‘𝑋))
10		toponmax 14890	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
11	9, 10	syl 14	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝑋 ∈ 𝐽)
12		simplr 529	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝑥 ∈ 𝑋)
13		df-ima 4762	. . . . . . . . 9 ⊢ ((𝑋 × {𝐵}) “ 𝑋) = ran ((𝑋 × {𝐵}) ↾ 𝑋)
14		ssid 3258	. . . . . . . . . . . . 13 ⊢ 𝑋 ⊆ 𝑋
15		xpssres 5073	. . . . . . . . . . . . 13 ⊢ (𝑋 ⊆ 𝑋 → ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵}))
16	14, 15	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵})
17	16	rneqi 4985	. . . . . . . . . . 11 ⊢ ran ((𝑋 × {𝐵}) ↾ 𝑋) = ran (𝑋 × {𝐵})
18		rnxpss 5194	. . . . . . . . . . 11 ⊢ ran (𝑋 × {𝐵}) ⊆ {𝐵}
19	17, 18	eqsstri 3270	. . . . . . . . . 10 ⊢ ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ {𝐵}
20		simprr 533	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝐵 ∈ 𝑦)
21	20	snssd 3839	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → {𝐵} ⊆ 𝑦)
22	19, 21	sstrid 3249	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ 𝑦)
23	13, 22	eqsstrid 3284	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)
24		eleq2 2296	. . . . . . . . . 10 ⊢ (𝑢 = 𝑋 → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ 𝑋))
25		imaeq2 5097	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑋 → ((𝑋 × {𝐵}) “ 𝑢) = ((𝑋 × {𝐵}) “ 𝑋))
26	25	sseq1d 3267	. . . . . . . . . 10 ⊢ (𝑢 = 𝑋 → (((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦 ↔ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦))
27	24, 26	anbi12d 473	. . . . . . . . 9 ⊢ (𝑢 = 𝑋 → ((𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)))
28	27	rspcev 2921	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐽 ∧ (𝑥 ∈ 𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
29	11, 12, 23, 28	syl12anc 1272	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
30	29	expr 375	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (𝐵 ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
31	8, 30	sylbid 150	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
32	31	ralrimiva 2615	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
33		simpl1 1027	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
34		simpl2 1028	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐾 ∈ (TopOn‘𝑌))
35		simpr 110	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
36		iscnp 15064	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
37	33, 34, 35, 36	syl3anc 1274	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
38	3, 32, 37	mpbir2and 953	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
39	38	ralrimiva 2615	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
40		cncnp 15095	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
41	40	3adant3 1044	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
42	2, 39, 41	mpbir2and 953	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203  ∀wral 2520  ∃wrex 2521   ⊆ wss 3211  {csn 3689   × cxp 4747  ran crn 4750   ↾ cres 4751   “ cima 4752  ⟶wf 5348  ‘cfv 5352  (class class class)co 6050  TopOnctopon 14875   Cn ccn 15050   CnP ccnp 15051

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-map 6884  df-topgen 13473  df-top 14863  df-topon 14876  df-cn 15053  df-cnp 15054

This theorem is referenced by:  cnconst  15099  cnmptc  15147