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

Theorem cnpresti 23175
Description: One direction of cnprest 23176 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 2729 . . . . 5 𝐾 = 𝐾
31, 2cnpf 23134 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐹:𝑋 𝐾)
433ad2ant3 1135 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐹:𝑋 𝐾)
5 simp1 1136 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴𝑋)
64, 5fssresd 6727 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹𝐴):𝐴 𝐾)
7 simpl2 1193 . . . . . 6 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → 𝑃𝐴)
87fvresd 6878 . . . . 5 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → ((𝐹𝐴)‘𝑃) = (𝐹𝑃))
98eleq1d 2813 . . . 4 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦𝐾) → (((𝐹𝐴)‘𝑃) ∈ 𝑦 ↔ (𝐹𝑃) ∈ 𝑦))
10 cnpimaex 23143 . . . . . . 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 3930 . . . . . . . . . 10 (𝑃 ∈ (𝑥𝐴) ↔ (𝑃𝑥𝑃𝐴))
1715, 16imbitrrdi 252 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃𝑥𝑃 ∈ (𝑥𝐴)))
18 inss1 4200 . . . . . . . . . . 11 (𝑥𝐴) ⊆ 𝑥
19 imass2 6073 . . . . . . . . . . 11 ((𝑥𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥𝐴)) ⊆ (𝐹𝑥))
2018, 19ax-mp 5 . . . . . . . . . 10 (𝐹 “ (𝑥𝐴)) ⊆ (𝐹𝑥)
21 id 22 . . . . . . . . . 10 ((𝐹𝑥) ⊆ 𝑦 → (𝐹𝑥) ⊆ 𝑦)
2220, 21sstrid 3958 . . . . . . . . 9 ((𝐹𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)
2317, 22anim12d1 610 . . . . . . . 8 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
2423reximdv 3148 . . . . . . 7 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → ∃𝑥𝐽 (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
25 vex 3451 . . . . . . . . . 10 𝑥 ∈ V
2625inex1 5272 . . . . . . . . 9 (𝑥𝐴) ∈ V
2726a1i 11 . . . . . . . 8 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑥𝐽) → (𝑥𝐴) ∈ V)
28 cnptop1 23129 . . . . . . . . . 10 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
29283ad2ant3 1135 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ Top)
3029uniexd 7718 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ V)
315, 1sseqtrdi 3987 . . . . . . . . . 10 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 𝐽)
3230, 31ssexd 5279 . . . . . . . . 9 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 ∈ V)
33 elrest 17390 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽t 𝐴) ↔ ∃𝑥𝐽 𝑧 = (𝑥𝐴)))
3429, 32, 33syl2anc 584 . . . . . . . 8 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑧 ∈ (𝐽t 𝐴) ↔ ∃𝑥𝐽 𝑧 = (𝑥𝐴)))
35 simpr 484 . . . . . . . . . 10 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → 𝑧 = (𝑥𝐴))
3635eleq2d 2814 . . . . . . . . 9 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → (𝑃𝑧𝑃 ∈ (𝑥𝐴)))
3735imaeq2d 6031 . . . . . . . . . . 11 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝐹𝐴) “ 𝑧) = ((𝐹𝐴) “ (𝑥𝐴)))
38 inss2 4201 . . . . . . . . . . . 12 (𝑥𝐴) ⊆ 𝐴
39 resima2 5987 . . . . . . . . . . . 12 ((𝑥𝐴) ⊆ 𝐴 → ((𝐹𝐴) “ (𝑥𝐴)) = (𝐹 “ (𝑥𝐴)))
4038, 39ax-mp 5 . . . . . . . . . . 11 ((𝐹𝐴) “ (𝑥𝐴)) = (𝐹 “ (𝑥𝐴))
4137, 40eqtrdi 2780 . . . . . . . . . 10 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝐹𝐴) “ 𝑧) = (𝐹 “ (𝑥𝐴)))
4241sseq1d 3978 . . . . . . . . 9 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → (((𝐹𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦))
4336, 42anbi12d 632 . . . . . . . 8 (((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥𝐴)) → ((𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥𝐴) ∧ (𝐹 “ (𝑥𝐴)) ⊆ 𝑦)))
4427, 34, 43rexxfr2d 5366 . . . . . . 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 3125 . 2 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ∀𝑦𝐾 (((𝐹𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽t 𝐴)(𝑃𝑧 ∧ ((𝐹𝐴) “ 𝑧) ⊆ 𝑦)))
501toptopon 22804 . . . . 5 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
5129, 50sylib 218 . . . 4 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ (TopOn‘𝑋))
52 resttopon 23048 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴𝑋) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
5351, 5, 52syl2anc 584 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐽t 𝐴) ∈ (TopOn‘𝐴))
54 cnptop2 23130 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
55543ad2ant3 1135 . . . 4 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ Top)
562toptopon 22804 . . . 4 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
5755, 56sylib 218 . . 3 ((𝐴𝑋𝑃𝐴𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ (TopOn‘ 𝐾))
58 iscnp 23124 . . 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 1540  wcel 2109  wral 3044  wrex 3053  Vcvv 3447  cin 3913  wss 3914   cuni 4871  cres 5640  cima 5641  wf 6507  cfv 6511  (class class class)co 7387  t crest 17383  Topctop 22780  TopOnctopon 22797   CnP ccnp 23112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-map 8801  df-en 8919  df-fin 8922  df-fi 9362  df-rest 17385  df-topgen 17406  df-top 22781  df-topon 22798  df-bases 22833  df-cnp 23115
This theorem is referenced by:  efrlim  26879  efrlimOLD  26880  cvmlift2lem11  35300
  Copyright terms: Public domain W3C validator