Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-restpw Structured version   Visualization version   GIF version

Theorem bj-restpw 37420
Description: The elementwise intersection on a powerset is the powerset of the intersection. This allows to prove for instance that the topology induced on a subset by the discrete topology is the discrete topology on that subset. See also restdis 23153 (which uses distop 22970 and restopn2 23152). (Contributed by BJ, 27-Apr-2021.)
Assertion
Ref Expression
bj-restpw ((𝑌𝑉𝐴𝑊) → (𝒫 𝑌t 𝐴) = 𝒫 (𝑌𝐴))

Proof of Theorem bj-restpw
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pwexg 5315 . . . 4 (𝑌𝑉 → 𝒫 𝑌 ∈ V)
2 elrest 17381 . . . 4 ((𝒫 𝑌 ∈ V ∧ 𝐴𝑊) → (𝑥 ∈ (𝒫 𝑌t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)))
31, 2sylan 581 . . 3 ((𝑌𝑉𝐴𝑊) → (𝑥 ∈ (𝒫 𝑌t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)))
4 velpw 4547 . . . . . . 7 (𝑦 ∈ 𝒫 𝑌𝑦𝑌)
54anbi1i 625 . . . . . 6 ((𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)) ↔ (𝑦𝑌𝑥 = (𝑦𝐴)))
65exbii 1850 . . . . 5 (∃𝑦(𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)) ↔ ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
7 sstr2 3929 . . . . . . . . . 10 (𝑥𝑦 → (𝑦𝑌𝑥𝑌))
87com12 32 . . . . . . . . 9 (𝑦𝑌 → (𝑥𝑦𝑥𝑌))
9 inss1 4178 . . . . . . . . . 10 (𝑦𝐴) ⊆ 𝑦
10 sseq1 3948 . . . . . . . . . 10 (𝑥 = (𝑦𝐴) → (𝑥𝑦 ↔ (𝑦𝐴) ⊆ 𝑦))
119, 10mpbiri 258 . . . . . . . . 9 (𝑥 = (𝑦𝐴) → 𝑥𝑦)
128, 11impel 505 . . . . . . . 8 ((𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥𝑌)
13 inss2 4179 . . . . . . . . . 10 (𝑦𝐴) ⊆ 𝐴
14 sseq1 3948 . . . . . . . . . 10 (𝑥 = (𝑦𝐴) → (𝑥𝐴 ↔ (𝑦𝐴) ⊆ 𝐴))
1513, 14mpbiri 258 . . . . . . . . 9 (𝑥 = (𝑦𝐴) → 𝑥𝐴)
1615adantl 481 . . . . . . . 8 ((𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥𝐴)
1712, 16ssind 4182 . . . . . . 7 ((𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥 ⊆ (𝑌𝐴))
1817exlimiv 1932 . . . . . 6 (∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥 ⊆ (𝑌𝐴))
19 inss1 4178 . . . . . . . 8 (𝑌𝐴) ⊆ 𝑌
20 sstr2 3929 . . . . . . . 8 (𝑥 ⊆ (𝑌𝐴) → ((𝑌𝐴) ⊆ 𝑌𝑥𝑌))
2119, 20mpi 20 . . . . . . 7 (𝑥 ⊆ (𝑌𝐴) → 𝑥𝑌)
22 inss2 4179 . . . . . . . 8 (𝑌𝐴) ⊆ 𝐴
23 sstr2 3929 . . . . . . . 8 (𝑥 ⊆ (𝑌𝐴) → ((𝑌𝐴) ⊆ 𝐴𝑥𝐴))
2422, 23mpi 20 . . . . . . 7 (𝑥 ⊆ (𝑌𝐴) → 𝑥𝐴)
25 ssidd 3946 . . . . . . . . . 10 (𝑥𝐴𝑥𝑥)
26 id 22 . . . . . . . . . 10 (𝑥𝐴𝑥𝐴)
2725, 26ssind 4182 . . . . . . . . 9 (𝑥𝐴𝑥 ⊆ (𝑥𝐴))
28 inss1 4178 . . . . . . . . . 10 (𝑥𝐴) ⊆ 𝑥
2928a1i 11 . . . . . . . . 9 (𝑥𝐴 → (𝑥𝐴) ⊆ 𝑥)
3027, 29eqssd 3940 . . . . . . . 8 (𝑥𝐴𝑥 = (𝑥𝐴))
31 vex 3434 . . . . . . . . 9 𝑥 ∈ V
32 sseq1 3948 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑦𝑌𝑥𝑌))
33 ineq1 4154 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑦𝐴) = (𝑥𝐴))
3433eqeq2d 2748 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑥 = (𝑦𝐴) ↔ 𝑥 = (𝑥𝐴)))
3532, 34anbi12d 633 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝑦𝑌𝑥 = (𝑦𝐴)) ↔ (𝑥𝑌𝑥 = (𝑥𝐴))))
3631, 35spcev 3549 . . . . . . . 8 ((𝑥𝑌𝑥 = (𝑥𝐴)) → ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
3730, 36sylan2 594 . . . . . . 7 ((𝑥𝑌𝑥𝐴) → ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
3821, 24, 37syl2anc 585 . . . . . 6 (𝑥 ⊆ (𝑌𝐴) → ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
3918, 38impbii 209 . . . . 5 (∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)) ↔ 𝑥 ⊆ (𝑌𝐴))
406, 39bitri 275 . . . 4 (∃𝑦(𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)) ↔ 𝑥 ⊆ (𝑌𝐴))
41 df-rex 3063 . . . 4 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴) ↔ ∃𝑦(𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)))
42 velpw 4547 . . . 4 (𝑥 ∈ 𝒫 (𝑌𝐴) ↔ 𝑥 ⊆ (𝑌𝐴))
4340, 41, 423bitr4i 303 . . 3 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌𝐴))
443, 43bitrdi 287 . 2 ((𝑌𝑉𝐴𝑊) → (𝑥 ∈ (𝒫 𝑌t 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌𝐴)))
4544eqrdv 2735 1 ((𝑌𝑉𝐴𝑊) → (𝒫 𝑌t 𝐴) = 𝒫 (𝑌𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wex 1781  wcel 2114  wrex 3062  Vcvv 3430  cin 3889  wss 3890  𝒫 cpw 4542  (class class class)co 7360  t crest 17374
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 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-rest 17376
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator