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

Theorem cnconst2 12416
 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 5321 . . 3 (𝐵𝑌 → (𝑋 × {𝐵}):𝑋𝑌)
213ad2ant3 1004 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → (𝑋 × {𝐵}):𝑋𝑌)
32adantr 274 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → (𝑋 × {𝐵}):𝑋𝑌)
4 simpll3 1022 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → 𝐵𝑌)
5 simplr 519 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → 𝑥𝑋)
6 fvconst2g 5634 . . . . . . . 8 ((𝐵𝑌𝑥𝑋) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
74, 5, 6syl2anc 408 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → ((𝑋 × {𝐵})‘𝑥) = 𝐵)
87eleq1d 2208 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦𝐵𝑦))
9 simpll1 1020 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝐽 ∈ (TopOn‘𝑋))
10 toponmax 12206 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
119, 10syl 14 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝑋𝐽)
12 simplr 519 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝑥𝑋)
13 df-ima 4552 . . . . . . . . 9 ((𝑋 × {𝐵}) “ 𝑋) = ran ((𝑋 × {𝐵}) ↾ 𝑋)
14 ssid 3117 . . . . . . . . . . . . 13 𝑋𝑋
15 xpssres 4854 . . . . . . . . . . . . 13 (𝑋𝑋 → ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵}))
1614, 15ax-mp 5 . . . . . . . . . . . 12 ((𝑋 × {𝐵}) ↾ 𝑋) = (𝑋 × {𝐵})
1716rneqi 4767 . . . . . . . . . . 11 ran ((𝑋 × {𝐵}) ↾ 𝑋) = ran (𝑋 × {𝐵})
18 rnxpss 4970 . . . . . . . . . . 11 ran (𝑋 × {𝐵}) ⊆ {𝐵}
1917, 18eqsstri 3129 . . . . . . . . . 10 ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ {𝐵}
20 simprr 521 . . . . . . . . . . 11 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → 𝐵𝑦)
2120snssd 3665 . . . . . . . . . 10 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → {𝐵} ⊆ 𝑦)
2219, 21sstrid 3108 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → ran ((𝑋 × {𝐵}) ↾ 𝑋) ⊆ 𝑦)
2313, 22eqsstrid 3143 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)
24 eleq2 2203 . . . . . . . . . 10 (𝑢 = 𝑋 → (𝑥𝑢𝑥𝑋))
25 imaeq2 4877 . . . . . . . . . . 11 (𝑢 = 𝑋 → ((𝑋 × {𝐵}) “ 𝑢) = ((𝑋 × {𝐵}) “ 𝑋))
2625sseq1d 3126 . . . . . . . . . 10 (𝑢 = 𝑋 → (((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦 ↔ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦))
2724, 26anbi12d 464 . . . . . . . . 9 (𝑢 = 𝑋 → ((𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦) ↔ (𝑥𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)))
2827rspcev 2789 . . . . . . . 8 ((𝑋𝐽 ∧ (𝑥𝑋 ∧ ((𝑋 × {𝐵}) “ 𝑋) ⊆ 𝑦)) → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
2911, 12, 23, 28syl12anc 1214 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ (𝑦𝐾𝐵𝑦)) → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦))
3029expr 372 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → (𝐵𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
318, 30sylbid 149 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) ∧ 𝑦𝐾) → (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
3231ralrimiva 2505 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → ∀𝑦𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))
33 simpl1 984 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → 𝐽 ∈ (TopOn‘𝑋))
34 simpl2 985 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → 𝐾 ∈ (TopOn‘𝑌))
35 simpr 109 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → 𝑥𝑋)
36 iscnp 12382 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑦𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
3733, 34, 35, 36syl3anc 1216 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → ((𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑦𝐾 (((𝑋 × {𝐵})‘𝑥) ∈ 𝑦 → ∃𝑢𝐽 (𝑥𝑢 ∧ ((𝑋 × {𝐵}) “ 𝑢) ⊆ 𝑦)))))
383, 32, 37mpbir2and 928 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) ∧ 𝑥𝑋) → (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
3938ralrimiva 2505 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → ∀𝑥𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))
40 cncnp 12413 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑥𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
41403adant3 1001 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → ((𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾) ↔ ((𝑋 × {𝐵}):𝑋𝑌 ∧ ∀𝑥𝑋 (𝑋 × {𝐵}) ∈ ((𝐽 CnP 𝐾)‘𝑥))))
422, 39, 41mpbir2and 928 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐵𝑌) → (𝑋 × {𝐵}) ∈ (𝐽 Cn 𝐾))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 962   = wceq 1331   ∈ wcel 1480  ∀wral 2416  ∃wrex 2417   ⊆ wss 3071  {csn 3527   × cxp 4537  ran crn 4540   ↾ cres 4541   “ cima 4542  ⟶wf 5119  ‘cfv 5123  (class class class)co 5774  TopOnctopon 12191   Cn ccn 12368   CnP ccnp 12369 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452 This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-map 6544  df-topgen 12155  df-top 12179  df-topon 12192  df-cn 12371  df-cnp 12372 This theorem is referenced by:  cnconst  12417  cnmptc  12465
 Copyright terms: Public domain W3C validator