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

Theorem icnpimaex 12222
Description: Property of a function continuous at a point. (Contributed by FL, 31-Dec-2006.) (Revised by Jim Kingdon, 28-Mar-2023.)
Assertion
Ref Expression
icnpimaex (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝐴))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝑥,𝑃   𝑥,𝑋   𝑥,𝑌

Proof of Theorem icnpimaex
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 simpr3 972 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → (𝐹𝑃) ∈ 𝐴)
2 eleq2 2178 . . . 4 (𝑦 = 𝐴 → ((𝐹𝑃) ∈ 𝑦 ↔ (𝐹𝑃) ∈ 𝐴))
3 sseq2 3087 . . . . . 6 (𝑦 = 𝐴 → ((𝐹𝑥) ⊆ 𝑦 ↔ (𝐹𝑥) ⊆ 𝐴))
43anbi2d 457 . . . . 5 (𝑦 = 𝐴 → ((𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) ↔ (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝐴)))
54rexbidv 2412 . . . 4 (𝑦 = 𝐴 → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝐴)))
62, 5imbi12d 233 . . 3 (𝑦 = 𝐴 → (((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)) ↔ ((𝐹𝑃) ∈ 𝐴 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝐴))))
7 simpr1 970 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃))
8 iscnp 12210 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
98adantr 272 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))))
107, 9mpbid 146 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → (𝐹:𝑋𝑌 ∧ ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦))))
1110simprd 113 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → ∀𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))
12 simpr2 971 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → 𝐴𝐾)
136, 11, 12rspcdva 2765 . 2 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → ((𝐹𝑃) ∈ 𝐴 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝐴)))
141, 13mpd 13 1 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝑃𝑋) ∧ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐴𝐾 ∧ (𝐹𝑃) ∈ 𝐴)) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 945   = wceq 1314  wcel 1463  wral 2390  wrex 2391  wss 3037  cima 4502  wf 5077  cfv 5081  (class class class)co 5728  TopOnctopon 12020   CnP ccnp 12198
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4006  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-ral 2395  df-rex 2396  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-id 4175  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-fv 5089  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-map 6498  df-top 12008  df-topon 12021  df-cnp 12201
This theorem is referenced by:  iscnp4  12229  cnpnei  12230  cnptopco  12233  cncnp  12241  cnptopresti  12249  lmtopcnp  12261  txcnp  12282
  Copyright terms: Public domain W3C validator