MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnpresti Structured version   Visualization version   GIF version

Theorem cnpresti 23203
Description: One direction of cnprest 23204 under the weaker condition that the point is in the subset rather than the interior of the subset. (Contributed by Mario Carneiro, 9-Feb-2015.) (Revised by Mario Carneiro, 1-May-2015.)
Hypothesis
Ref Expression
cnprest.1 𝑋 = 𝐽
Assertion
Ref Expression
cnpresti ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃))

Proof of Theorem cnpresti
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnprest.1 . . . . 5 𝑋 = 𝐽
2 eqid 2731 . . . . 5 𝐾 = 𝐾
31, 2cnpf 23162 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐹:𝑋 𝐾)
433ad2ant3 1135 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐹:𝑋 𝐾)
5 simp1 1136 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴𝑋)
64, 5fssresd 6690 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹𝐴):𝐴 𝐾)
7 simpl2 1193 . . . . . 6 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → 𝑃𝐴)
87fvresd 6842 . . . . 5 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → ((𝐹𝐴)‘𝑃) = (𝐹𝑃))
98eleq1d 2816 . . . 4 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → (((𝐹𝐴)‘𝑃) ∈ 𝑦 ↔ (𝐹𝑃) ∈ 𝑦))
10 cnpimaex 23171 . . . . . . 7 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦𝐾 ∧ (𝐹𝑃) ∈ 𝑦) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦))
11103expia 1121 . . . . . 6 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦𝐾) → ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))
12113ad2antl3 1188 . . . . 5 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))
13 idd 24 . . . . . . . . . . 11 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥𝑃𝑥))
14 simp2 1137 . . . . . . . . . . 11 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝑃𝐴)
1513, 14jctird 526 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥 → (𝑃𝑥𝑃𝐴)))
16 elin 3913 . . . . . . . . . 10 (𝑃 ∈ (𝑥𝐴) ↔ (𝑃𝑥𝑃𝐴))
1715, 16imbitrrdi 252 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥𝑃 ∈ (𝑥𝐴)))
18 inss1 4184 . . . . . . . . . . 11 (𝑥𝐴) ⊆ 𝑥
19 imass2 6050 . . . . . . . . . . 11 ((𝑥𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥𝐴)) ⊆ (𝐹𝑥))
2018, 19ax-mp 5 . . . . . . . . . 10 (𝐹 “ (𝑥𝐴)) ⊆ (𝐹𝑥)
21 id 22 . . . . . . . . . 10 ((𝐹𝑥) ⊆ 𝑦 → (𝐹𝑥) ⊆ 𝑦)
2220, 21sstrid 3941 . . . . . . . . 9 ((𝐹𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)
2317, 22anim12d1 610 . . . . . . . 8 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
2423reximdv 3147 . . . . . . 7 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → ∃𝑥𝐽 (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
25 vex 3440 . . . . . . . . . 10 𝑥 ∈ V
2625inex1 5253 . . . . . . . . 9 (𝑥𝐴) ∈ V
2726a1i 11 . . . . . . . 8 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑥𝐽) → (𝑥𝐴) ∈ V)
28 cnptop1 23157 . . . . . . . . . 10 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
29283ad2ant3 1135 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ Top)
3029uniexd 7675 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ V)
315, 1sseqtrdi 3970 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 𝐽)
3230, 31ssexd 5260 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 ∈ V)
33 elrest 17331 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽t 𝐴) ↔ ∃𝑥𝐽 𝑧 = (𝑥𝐴)))
3429, 32, 33syl2anc 584 . . . . . . . 8 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑧 ∈ (𝐽t 𝐴) ↔ ∃𝑥𝐽 𝑧 = (𝑥𝐴)))
35 simpr 484 . . . . . . . . . 10 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → 𝑧 = (𝑥𝐴))
3635eleq2d 2817 . . . . . . . . 9 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → (𝑃𝑧𝑃 ∈ (𝑥𝐴)))
3735imaeq2d 6008 . . . . . . . . . . 11 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝐹𝐴) “ 𝑧) = ((𝐹𝐴) “ (𝑥𝐴)))
38 inss2 4185 . . . . . . . . . . . 12 (𝑥𝐴) ⊆ 𝐴
39 resima2 5964 . . . . . . . . . . . 12 ((𝑥𝐴) ⊆ 𝐴 → ((𝐹𝐴) “ (𝑥𝐴)) = (𝐹 “ (𝑥𝐴)))
4038, 39ax-mp 5 . . . . . . . . . . 11 ((𝐹𝐴) “ (𝑥𝐴)) = (𝐹 “ (𝑥𝐴))
4137, 40eqtrdi 2782 . . . . . . . . . 10 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝐹𝐴) “ 𝑧) = (𝐹 “ (𝑥𝐴)))
4241sseq1d 3961 . . . . . . . . 9 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → (((𝐹𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦))
4336, 42anbi12d 632 . . . . . . . 8 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
4427, 34, 43rexxfr2d 5347 . . . . . . 7 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥𝐽 (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
4524, 44sylibrd 259 . . . . . 6 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
4645adantr 480 . . . . 5 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
4712, 46syld 47 . . . 4 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → ((𝐹𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
489, 47sylbid 240 . . 3 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
4948ralrimiva 3124 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
501toptopon 22832 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
5129, 50sylib 218 . . . 4 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ (TopOn‘𝑋))
52 resttopon 23076 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
5351, 5, 52syl2anc 584 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
54 cnptop2 23158 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
55543ad2ant3 1135 . . . 4 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ Top)
562toptopon 22832 . . . 4 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
5755, 56sylib 218 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ (TopOn‘ 𝐾))
58 iscnp 23152 . . 3 (((𝐽t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘ 𝐾) ∧ 𝑃𝐴) → ((𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹𝐴):𝐴 𝐾 ∧ ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))))
5953, 57, 14, 58syl3anc 1373 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹𝐴):𝐴 𝐾 ∧ ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))))
606, 49, 59mpbir2and 713 1 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2111  wral 3047  wrex 3056  Vcvv 3436  cin 3896  wss 3897   cuni 4856  cres 5616  cima 5617  wf 6477  cfv 6481  (class class class)co 7346  t crest 17324  Topctop 22808  TopOnctopon 22825   CnP ccnp 23140
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-int 4896  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-map 8752  df-en 8870  df-fin 8873  df-fi 9295  df-rest 17326  df-topgen 17347  df-top 22809  df-topon 22826  df-bases 22861  df-cnp 23143
This theorem is referenced by:  efrlim  26906  efrlimOLD  26907  cvmlift2lem11  35357
  Copyright terms: Public domain W3C validator