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 37457
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 23168 (which uses distop 22985 and restopn2 23167). (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 5314 . . . 4 (𝑌𝑉 → 𝒫 𝑌 ∈ V)
2 elrest 17388 . . . 4 ((𝒫 𝑌 ∈ V ∧ 𝐴𝑊) → (𝑥 ∈ (𝒫 𝑌t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)))
31, 2sylan 586 . . 3 ((𝑌𝑉𝐴𝑊) → (𝑥 ∈ (𝒫 𝑌t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)))
4 velpw 4541 . . . . . . 7 (𝑦 ∈ 𝒫 𝑌𝑦𝑌)
54anbi1i 630 . . . . . 6 ((𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)) ↔ (𝑦𝑌𝑥 = (𝑦𝐴)))
65exbii 1855 . . . . 5 (∃𝑦(𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)) ↔ ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
7 sstr2 3929 . . . . . . . . . 10 (𝑥𝑦 → (𝑦𝑌𝑥𝑌))
87com12 32 . . . . . . . . 9 (𝑦𝑌 → (𝑥𝑦𝑥𝑌))
9 inss1 4172 . . . . . . . . . 10 (𝑦𝐴) ⊆ 𝑦
10 sseq1 3947 . . . . . . . . . 10 (𝑥 = (𝑦𝐴) → (𝑥𝑦 ↔ (𝑦𝐴) ⊆ 𝑦))
119, 10mpbiri 259 . . . . . . . . 9 (𝑥 = (𝑦𝐴) → 𝑥𝑦)
128, 11impel 510 . . . . . . . 8 ((𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥𝑌)
13 inss2 4173 . . . . . . . . . 10 (𝑦𝐴) ⊆ 𝐴
14 sseq1 3947 . . . . . . . . . 10 (𝑥 = (𝑦𝐴) → (𝑥𝐴 ↔ (𝑦𝐴) ⊆ 𝐴))
1513, 14mpbiri 259 . . . . . . . . 9 (𝑥 = (𝑦𝐴) → 𝑥𝐴)
1615adantl 482 . . . . . . . 8 ((𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥𝐴)
1712, 16ssind 4176 . . . . . . 7 ((𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥 ⊆ (𝑌𝐴))
1817exlimiv 1937 . . . . . 6 (∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)) → 𝑥 ⊆ (𝑌𝐴))
19 inss1 4172 . . . . . . . 8 (𝑌𝐴) ⊆ 𝑌
20 sstr2 3929 . . . . . . . 8 (𝑥 ⊆ (𝑌𝐴) → ((𝑌𝐴) ⊆ 𝑌𝑥𝑌))
2119, 20mpi 20 . . . . . . 7 (𝑥 ⊆ (𝑌𝐴) → 𝑥𝑌)
22 inss2 4173 . . . . . . . 8 (𝑌𝐴) ⊆ 𝐴
23 sstr2 3929 . . . . . . . 8 (𝑥 ⊆ (𝑌𝐴) → ((𝑌𝐴) ⊆ 𝐴𝑥𝐴))
2422, 23mpi 20 . . . . . . 7 (𝑥 ⊆ (𝑌𝐴) → 𝑥𝐴)
25 ssidd 3945 . . . . . . . . . 10 (𝑥𝐴𝑥𝑥)
26 id 22 . . . . . . . . . 10 (𝑥𝐴𝑥𝐴)
2725, 26ssind 4176 . . . . . . . . 9 (𝑥𝐴𝑥 ⊆ (𝑥𝐴))
28 inss1 4172 . . . . . . . . . 10 (𝑥𝐴) ⊆ 𝑥
2928a1i 11 . . . . . . . . 9 (𝑥𝐴 → (𝑥𝐴) ⊆ 𝑥)
3027, 29eqssd 3939 . . . . . . . 8 (𝑥𝐴𝑥 = (𝑥𝐴))
31 vex 3436 . . . . . . . . 9 𝑥 ∈ V
32 sseq1 3947 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑦𝑌𝑥𝑌))
33 ineq1 4149 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑦𝐴) = (𝑥𝐴))
3433eqeq2d 2751 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑥 = (𝑦𝐴) ↔ 𝑥 = (𝑥𝐴)))
3532, 34anbi12d 638 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝑦𝑌𝑥 = (𝑦𝐴)) ↔ (𝑥𝑌𝑥 = (𝑥𝐴))))
3631, 35spcev 3551 . . . . . . . 8 ((𝑥𝑌𝑥 = (𝑥𝐴)) → ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
3730, 36sylan2 599 . . . . . . 7 ((𝑥𝑌𝑥𝐴) → ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
3821, 24, 37syl2anc 590 . . . . . 6 (𝑥 ⊆ (𝑌𝐴) → ∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)))
3918, 38impbii 210 . . . . 5 (∃𝑦(𝑦𝑌𝑥 = (𝑦𝐴)) ↔ 𝑥 ⊆ (𝑌𝐴))
406, 39bitri 276 . . . 4 (∃𝑦(𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)) ↔ 𝑥 ⊆ (𝑌𝐴))
41 df-rex 3065 . . . 4 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴) ↔ ∃𝑦(𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴)))
42 velpw 4541 . . . 4 (𝑥 ∈ 𝒫 (𝑌𝐴) ↔ 𝑥 ⊆ (𝑌𝐴))
4340, 41, 423bitr4i 304 . . 3 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌𝐴))
443, 43bitrdi 288 . 2 ((𝑌𝑉𝐴𝑊) → (𝑥 ∈ (𝒫 𝑌t 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌𝐴)))
4544eqrdv 2738 1 ((𝑌𝑉𝐴𝑊) → (𝒫 𝑌t 𝐴) = 𝒫 (𝑌𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wex 1786  wcel 2119  wrex 3064  Vcvv 3432  cin 3889  wss 3890  𝒫 cpw 4536  (class class class)co 7363  t crest 17381
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  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 7366  df-oprab 7367  df-mpo 7368  df-rest 17383
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator