Theorem cnconst2 14820

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 5496	. . 3 ⊢ (𝐵 ∈ 𝑌 → (𝑋 × {𝐵}):𝑋⟶𝑌)
2	1	3ad2ant3 1023	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}):𝑋⟶𝑌)
3	2	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐵}):𝑋⟶𝑌)
4		simpll3 1041	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → 𝐵 ∈ 𝑌)
5		simplr 528	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → 𝑥 ∈ 𝑋)
6		fvconst2g 5821	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑌 ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
7	4, 5, 6	syl2anc 411	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
8	7	eleq1d 2276	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 ↔ 𝐵 ∈ 𝑦))
9		simpll1 1039	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝐽 ∈ (TopOn‘𝑋))
10		toponmax 14612	. . . . . . . . 9 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
11	9, 10	syl 14	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝑋 ∈ 𝐽)
12		simplr 528	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝑥 ∈ 𝑋)
13		df-ima 4706	. . . . . . . . 9 ⊢ ((𝑋 × {𝐵}) “ 𝑋) = ran ((𝑋 × {𝐵}) ↾ 𝑋)
14		ssid 3221	. . . . . . . . . . . . 13 ⊢ 𝑋 ⊆ 𝑋
15		xpssres 5013	. . . . . . . . . . . . 13 ⊢ (𝑋 ⊆ 𝑋 → ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵}))
16	14, 15	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵})
17	16	rneqi 4925	. . . . . . . . . . 11 ⊢ ran ((𝑋 × {𝐵}) ↾ 𝑋) = ran (𝑋 × {𝐵})
18		rnxpss 5133	. . . . . . . . . . 11 ⊢ ran (𝑋 × {𝐵}) ⊆ {𝐵}
19	17, 18	eqsstri 3233	. . . . . . . . . 10 ⊢ ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ {𝐵}
20		simprr 531	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → 𝐵 ∈ 𝑦)
21	20	snssd 3789	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → {𝐵} ⊆ 𝑦)
22	19, 21	sstrid 3212	. . . . . . . . 9 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ 𝑦)
23	13, 22	eqsstrid 3247	. . . . . . . 8 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)
24		eleq2 2271	. . . . . . . . . 10 ⊢ (𝑢 = 𝑋 → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ 𝑋))
25		imaeq2 5037	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑋 → ((𝑋 × {𝐵}) “ 𝑢) = ((𝑋 × {𝐵}) “ 𝑋))
26	25	sseq1d 3230	. . . . . . . . . 10 ⊢ (𝑢 = 𝑋 → (((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦 ↔ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦))
27	24, 26	anbi12d 473	. . . . . . . . 9 ⊢ (𝑢 = 𝑋 → ((𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)))
28	27	rspcev 2884	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐽 ∧ (𝑥 ∈ 𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
29	11, 12, 23, 28	syl12anc 1248	. . . . . . 7 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ (𝑦 ∈ 𝐾 ∧ 𝐵 ∈ 𝑦)) → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
30	29	expr 375	. . . . . 6 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (𝐵 ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
31	8, 30	sylbid 150	. . . . 5 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
32	31	ralrimiva 2581	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
33		simpl1 1003	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
34		simpl2 1004	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝐾 ∈ (TopOn‘𝑌))
35		simpr 110	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
36		iscnp 14786	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
37	33, 34, 35, 36	syl3anc 1250	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑦 ∈ 𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢 ∈ 𝐽 (𝑥 ∈ 𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
38	3, 32, 37	mpbir2and 947	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
39	38	ralrimiva 2581	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
40		cncnp 14817	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
41	40	3adant3 1020	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
42	2, 39, 41	mpbir2and 947	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵 ∈ 𝑌) → (𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 981   = wceq 1373   ∈ wcel 2178  ∀wral 2486  ∃wrex 2487   ⊆ wss 3174  {csn 3643   × cxp 4691  ran crn 4694   ↾ cres 4695   “ cima 4696  ⟶wf 5286  ‘cfv 5290  (class class class)co 5967  TopOnctopon 14597   Cn ccn 14772   CnP ccnp 14773

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-map 6760  df-topgen 13207  df-top 14585  df-topon 14598  df-cn 14775  df-cnp 14776

This theorem is referenced by:  cnconst  14821  cnmptc  14869