ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnconst2 GIF version

Theorem cnconst2 13400
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.
StepHypRef Expression
1 fconst6g 5410 . . 3 (𝐵𝑌 → (𝑋 × {𝐵}):𝑋𝑌)
213ad2ant3 1020 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → (𝑋 × {𝐵}):𝑋𝑌)
32adantr 276 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → (𝑋 × {𝐵}):𝑋𝑌)
4 simpll3 1038 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → 𝐵𝑌)
5 simplr 528 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → 𝑥𝑋)
6 fvconst2g 5726 . . . . . . . 8 ((𝐵𝑌𝑥𝑋) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
74, 5, 6syl2anc 411 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
87eleq1d 2246 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦𝐵𝑦))
9 simpll1 1036 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝐽 ∈ (TopOn‘𝑋))
10 toponmax 13190 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
119, 10syl 14 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝑋𝐽)
12 simplr 528 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝑥𝑋)
13 df-ima 4636 . . . . . . . . 9 ((𝑋 × {𝐵}) “ 𝑋) = ran ((𝑋 × {𝐵}) ↾ 𝑋)
14 ssid 3175 . . . . . . . . . . . . 13 𝑋𝑋
15 xpssres 4938 . . . . . . . . . . . . 13 (𝑋𝑋 → ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵}))
1614, 15ax-mp 5 . . . . . . . . . . . 12 ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵})
1716rneqi 4851 . . . . . . . . . . 11 ran ((𝑋 × {𝐵}) ↾ 𝑋) = ran (𝑋 × {𝐵})
18 rnxpss 5056 . . . . . . . . . . 11 ran (𝑋 × {𝐵}) ⊆ {𝐵}
1917, 18eqsstri 3187 . . . . . . . . . 10 ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ {𝐵}
20 simprr 531 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝐵𝑦)
2120snssd 3736 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → {𝐵} ⊆ 𝑦)
2219, 21sstrid 3166 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ 𝑦)
2313, 22eqsstrid 3201 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)
24 eleq2 2241 . . . . . . . . . 10 (𝑢 = 𝑋 → (𝑥𝑢𝑥𝑋))
25 imaeq2 4962 . . . . . . . . . . 11 (𝑢 = 𝑋 → ((𝑋 × {𝐵}) “ 𝑢) = ((𝑋 × {𝐵}) “ 𝑋))
2625sseq1d 3184 . . . . . . . . . 10 (𝑢 = 𝑋 → (((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦 ↔ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦))
2724, 26anbi12d 473 . . . . . . . . 9 (𝑢 = 𝑋 → ((𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦) ↔ (𝑥𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)))
2827rspcev 2841 . . . . . . . 8 ((𝑋𝐽 ∧ (𝑥𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)) → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
2911, 12, 23, 28syl12anc 1236 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
3029expr 375 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → (𝐵𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
318, 30sylbid 150 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
3231ralrimiva 2550 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → ∀𝑦𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
33 simpl1 1000 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → 𝐽 ∈ (TopOn‘𝑋))
34 simpl2 1001 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → 𝐾 ∈ (TopOn‘𝑌))
35 simpr 110 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → 𝑥𝑋)
36 iscnp 13366 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑦𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
3733, 34, 35, 36syl3anc 1238 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑦𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
383, 32, 37mpbir2and 944 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
3938ralrimiva 2550 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → ∀𝑥𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
40 cncnp 13397 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑥𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
41403adant3 1017 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑥𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
422, 39, 41mpbir2and 944 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → (𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 978   = wceq 1353  wcel 2148  wral 2455  wrex 2456  wss 3129  {csn 3591   × cxp 4621  ran crn 4624  cres 4625  cima 4626  wf 5208  cfv 5212  (class class class)co 5869  TopOnctopon 13175   Cn ccn 13352   CnP ccnp 13353
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-coll 4115  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-reu 2462  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-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-f1 5217  df-fo 5218  df-f1o 5219  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-cn 13355  df-cnp 13356
This theorem is referenced by:  cnconst  13401  cnmptc  13449
  Copyright terms: Public domain W3C validator