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

Theorem cncnp2m 15083
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 15053 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
2 cncnp.1 . . . . . 6 𝑋 = 𝐽
32toptopon 14870 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
41, 3sylib 122 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ (TopOn‘𝑋))
5 cntop2 15054 . . . . 5 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ Top)
6 cncnp.2 . . . . . 6 𝑌 = 𝐾
76toptopon 14870 . . . . 5 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
85, 7sylib 122 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐾 ∈ (TopOn‘𝑌))
92, 6cnf 15056 . . . 4 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:𝑋𝑌)
104, 8, 9jca31 309 . . 3 (𝐹 ∈ (𝐽 Cn 𝐾) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
1110adantl 277 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌))
123biimpi 120 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
13123ad2ant1 1045 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → 𝐽 ∈ (TopOn‘𝑋))
1413adantr 276 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐽 ∈ (TopOn‘𝑋))
157biimpi 120 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘𝑌))
16153ad2ant2 1046 . . . 4 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → 𝐾 ∈ (TopOn‘𝑌))
1716adantr 276 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐾 ∈ (TopOn‘𝑌))
18 r19.2m 3595 . . . . . . 7 ((∃𝑦 𝑦𝑋 ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))
1918ex 115 . . . . . 6 (∃𝑦 𝑦𝑋 → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
20193ad2ant3 1047 . . . . 5 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → ∃𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
21 cnpf2 15059 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)) → 𝐹:𝑋𝑌)
22213expia 1232 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥) → 𝐹:𝑋𝑌))
2322rexlimdvw 2664 . . . . . 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 15082 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥))))
2928baibd 931 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) ∧ 𝐹:𝑋𝑌) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
3011, 27, 29pm5.21nd 924 1 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∃𝑦 𝑦𝑋) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ ∀𝑥𝑋 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑥)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005   = wceq 1398  wex 1541  wcel 2203  wral 2520  wrex 2521   cuni 3913  wf 5347  cfv 5351  (class class class)co 6049  Topctop 14849  TopOnctopon 14862   Cn ccn 15037   CnP ccnp 15038
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-map 6883  df-topgen 13462  df-top 14850  df-topon 14863  df-cn 15040  df-cnp 15041
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator