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

Theorem cncnp2m 14958
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 14928 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
2 cncnp.1 . . . . . 6 𝑋 = 𝐽
32toptopon 14745 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
41, 3sylib 122 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ (TopOn‘𝑋))
5 cntop2 14929 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
6 cncnp.2 . . . . . 6 𝑌 = 𝐾
76toptopon 14745 . . . . 5 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
85, 7sylib 122 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ (TopOn‘𝑌))
92, 6cnf 14931 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌)
104, 8, 9jca31 309 . . 3 (𝐹 ∈ (𝐽 Cn 𝐾) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
1110adantl 277 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
123biimpi 120 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
13123ad2ant1 1044 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → 𝐽 ∈ (TopOn‘𝑋))
1413adantr 276 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐽 ∈ (TopOn‘𝑋))
157biimpi 120 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘𝑌))
16153ad2ant2 1045 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → 𝐾 ∈ (TopOn‘𝑌))
1716adantr 276 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐾 ∈ (TopOn‘𝑌))
18 r19.2m 3581 . . . . . . 7 ((∃𝑦 𝑦𝑋 ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))
1918ex 115 . . . . . 6 (∃𝑦 𝑦𝑋 → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
20193ad2ant3 1046 . . . . 5 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
21 cnpf2 14934 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐹:𝑋𝑌)
22213expia 1231 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2322rexlimdvw 2654 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2413, 16, 23syl2anc 411 . . . . 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 14957 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))))
2928baibd 930 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
3011, 27, 29pm5.21nd 923 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1004   = wceq 1397  wex 1540  wcel 2202  wral 2510  wrex 2511   cuni 3893  wf 5322  cfv 5326  (class class class)co 6018  Topctop 14724  TopOnctopon 14737   Cn ccn 14912   CnP ccnp 14913
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-map 6819  df-topgen 13345  df-top 14725  df-topon 14738  df-cn 14915  df-cnp 14916
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator