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

Theorem cnpresti 23249
Description: One direction of cnprest 23250 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 2737 . . . . 5 𝐾 = 𝐾
31, 2cnpf 23208 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐹:𝑋 𝐾)
433ad2ant3 1136 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐹:𝑋 𝐾)
5 simp1 1137 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴𝑋)
64, 5fssresd 6711 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹𝐴):𝐴 𝐾)
7 simpl2 1194 . . . . . 6 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → 𝑃𝐴)
87fvresd 6864 . . . . 5 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → ((𝐹𝐴)‘𝑃) = (𝐹𝑃))
98eleq1d 2822 . . . 4 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → (((𝐹𝐴)‘𝑃) ∈ 𝑦 ↔ (𝐹𝑃) ∈ 𝑦))
10 cnpimaex 23217 . . . . . . 7 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦𝐾 ∧ (𝐹𝑃) ∈ 𝑦) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦))
11103expia 1122 . . . . . 6 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦𝐾) → ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))
12113ad2antl3 1189 . . . . 5 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → ((𝐹𝑃) ∈ 𝑦 → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦)))
13 idd 24 . . . . . . . . . . 11 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥𝑃𝑥))
14 simp2 1138 . . . . . . . . . . 11 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝑃𝐴)
1513, 14jctird 526 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥 → (𝑃𝑥𝑃𝐴)))
16 elin 3919 . . . . . . . . . 10 (𝑃 ∈ (𝑥𝐴) ↔ (𝑃𝑥𝑃𝐴))
1715, 16imbitrrdi 252 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥𝑃 ∈ (𝑥𝐴)))
18 inss1 4191 . . . . . . . . . . 11 (𝑥𝐴) ⊆ 𝑥
19 imass2 6071 . . . . . . . . . . 11 ((𝑥𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥𝐴)) ⊆ (𝐹𝑥))
2018, 19ax-mp 5 . . . . . . . . . 10 (𝐹 “ (𝑥𝐴)) ⊆ (𝐹𝑥)
21 id 22 . . . . . . . . . 10 ((𝐹𝑥) ⊆ 𝑦 → (𝐹𝑥) ⊆ 𝑦)
2220, 21sstrid 3947 . . . . . . . . 9 ((𝐹𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)
2317, 22anim12d1 611 . . . . . . . 8 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
2423reximdv 3153 . . . . . . 7 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → ∃𝑥𝐽 (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
25 vex 3446 . . . . . . . . . 10 𝑥 ∈ V
2625inex1 5266 . . . . . . . . 9 (𝑥𝐴) ∈ V
2726a1i 11 . . . . . . . 8 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑥𝐽) → (𝑥𝐴) ∈ V)
28 cnptop1 23203 . . . . . . . . . 10 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
29283ad2ant3 1136 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ Top)
3029uniexd 7699 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ V)
315, 1sseqtrdi 3976 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 𝐽)
3230, 31ssexd 5273 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 ∈ V)
33 elrest 17361 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽t 𝐴) ↔ ∃𝑥𝐽 𝑧 = (𝑥𝐴)))
3429, 32, 33syl2anc 585 . . . . . . . 8 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑧 ∈ (𝐽t 𝐴) ↔ ∃𝑥𝐽 𝑧 = (𝑥𝐴)))
35 simpr 484 . . . . . . . . . 10 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → 𝑧 = (𝑥𝐴))
3635eleq2d 2823 . . . . . . . . 9 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → (𝑃𝑧𝑃 ∈ (𝑥𝐴)))
3735imaeq2d 6029 . . . . . . . . . . 11 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝐹𝐴) “ 𝑧) = ((𝐹𝐴) “ (𝑥𝐴)))
38 inss2 4192 . . . . . . . . . . . 12 (𝑥𝐴) ⊆ 𝐴
39 resima2 5985 . . . . . . . . . . . 12 ((𝑥𝐴) ⊆ 𝐴 → ((𝐹𝐴) “ (𝑥𝐴)) = (𝐹 “ (𝑥𝐴)))
4038, 39ax-mp 5 . . . . . . . . . . 11 ((𝐹𝐴) “ (𝑥𝐴)) = (𝐹 “ (𝑥𝐴))
4137, 40eqtrdi 2788 . . . . . . . . . 10 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝐹𝐴) “ 𝑧) = (𝐹 “ (𝑥𝐴)))
4241sseq1d 3967 . . . . . . . . 9 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → (((𝐹𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦))
4336, 42anbi12d 633 . . . . . . . 8 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
4427, 34, 43rexxfr2d 5360 . . . . . . 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 3130 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
501toptopon 22878 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
5129, 50sylib 218 . . . 4 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ (TopOn‘𝑋))
52 resttopon 23122 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
5351, 5, 52syl2anc 585 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
54 cnptop2 23204 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
55543ad2ant3 1136 . . . 4 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ Top)
562toptopon 22878 . . . 4 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
5755, 56sylib 218 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ (TopOn‘ 𝐾))
58 iscnp 23198 . . 3 (((𝐽t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘ 𝐾) ∧ 𝑃𝐴) → ((𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹𝐴):𝐴 𝐾 ∧ ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))))
5953, 57, 14, 58syl3anc 1374 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹𝐴):𝐴 𝐾 ∧ ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))))
606, 49, 59mpbir2and 714 1 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹𝐴) ∈ (((𝐽t 𝐴) CnP 𝐾)‘𝑃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  wrex 3062  Vcvv 3442  cin 3902  wss 3903   cuni 4865  cres 5636  cima 5637  wf 6498  cfv 6502  (class class class)co 7370  t crest 17354  Topctop 22854  TopOnctopon 22871   CnP ccnp 23186
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-1st 7945  df-2nd 7946  df-map 8779  df-en 8898  df-fin 8901  df-fi 9328  df-rest 17356  df-topgen 17377  df-top 22855  df-topon 22872  df-bases 22907  df-cnp 23189
This theorem is referenced by:  efrlim  26952  efrlimOLD  26953  cvmlift2lem11  35535
  Copyright terms: Public domain W3C validator