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

Theorem cncnp2m 15315
Description: A continuous function is continuous at all points. Theorem 7.2(g) of [Munkres] p. 107. (Contributed by Raph Levien, 20-Nov-2006.) (Revised by Jim Kingdon, 30-Mar-2023.)
Hypotheses
Ref Expression
cncnp.1 𝑋 = 𝐽
cncnp.2 𝑌 = 𝐾
Assertion
Ref Expression
cncnp2m ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝑥,𝑋   𝑦,𝑋   𝑥,𝑌
Allowed substitution hints:   𝐹(𝑦)   𝐽(𝑦)   𝐾(𝑦)   𝑌(𝑦)

Proof of Theorem cncnp2m
StepHypRef Expression
1 cntop1 15285 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
2 cncnp.1 . . . . . 6 𝑋 = 𝐽
32toptopon 15102 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
41, 3sylib 122 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ (TopOn‘𝑋))
5 cntop2 15286 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
6 cncnp.2 . . . . . 6 𝑌 = 𝐾
76toptopon 15102 . . . . 5 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
85, 7sylib 122 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ (TopOn‘𝑌))
92, 6cnf 15288 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌)
104, 8, 9jca31 309 . . 3 (𝐹 ∈ (𝐽 Cn 𝐾) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
1110adantl 277 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
123biimpi 120 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
13123ad2ant1 1049 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → 𝐽 ∈ (TopOn‘𝑋))
1413adantr 276 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐽 ∈ (TopOn‘𝑋))
157biimpi 120 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘𝑌))
16153ad2ant2 1050 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → 𝐾 ∈ (TopOn‘𝑌))
1716adantr 276 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐾 ∈ (TopOn‘𝑌))
18 r19.2m 3614 . . . . . . 7 ((∃𝑦 𝑦𝑋 ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))
1918ex 115 . . . . . 6 (∃𝑦 𝑦𝑋 → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
20193ad2ant3 1051 . . . . 5 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
21 cnpf2 15291 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐹:𝑋𝑌)
22213expia 1236 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2322rexlimdvw 2672 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2413, 16, 23syl2anc 415 . . . . 5 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2520, 24syld 45 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2625imp 124 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐹:𝑋𝑌)
2714, 17, 26jca31 309 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
28 cncnp 15314 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))))
2928baibd 935 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
3011, 27, 29pm5.21nd 928 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wex 1545  wcel 2209  wral 2528  wrex 2529   cuni 3933  wf 5371  cfv 5375  (class class class)co 6079  Topctop 15081  TopOnctopon 15094   Cn ccn 15269   CnP ccnp 15270
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-map 6918  df-topgen 13597  df-top 15082  df-topon 15095  df-cn 15272  df-cnp 15273
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator