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 38105
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 23501 (which uses distop 23318 and restopn2 23500). (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 5339 . . . 4 (𝑌 ∈ 𝑉 → 𝒫 𝑌 ∈ V)
2 elrest 17603 . . . 4 ((𝒫 𝑌 ∈ V ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝑌 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴)))
31, 2sylan 592 . . 3 ((𝑌 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝑌 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴)))
4 velpw 4561 . . . . . . 7 (𝑦 ∈ 𝒫 𝑌 ↔ 𝑦 ⊆ 𝑌)
54anbi1i 636 . . . . . 6 ((𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ (𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
65exbii 1880 . . . . 5 (∃𝑦(𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
7 sstr2 3915 . . . . . . . . . 10 (𝑥 ⊆ 𝑦 → (𝑦 ⊆ 𝑌 → 𝑥 ⊆ 𝑌))
87com12 33 . . . . . . . . 9 (𝑦 ⊆ 𝑌 → (𝑥 ⊆ 𝑦 → 𝑥 ⊆ 𝑌))
9 inss1 4133 . . . . . . . . . 10 (𝑦 ∩ 𝐴) ⊆ 𝑦
10 sseq1 3933 . . . . . . . . . 10 (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝑦 ↔ (𝑦 ∩ 𝐴) ⊆ 𝑦))
119, 10mpbiri 261 . . . . . . . . 9 (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝑦)
128, 11impel 515 . . . . . . . 8 ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ 𝑌)
13 inss2 4134 . . . . . . . . . 10 (𝑦 ∩ 𝐴) ⊆ 𝐴
14 sseq1 3933 . . . . . . . . . 10 (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∩ 𝐴) ⊆ 𝐴))
1513, 14mpbiri 261 . . . . . . . . 9 (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴)
1615adantl 487 . . . . . . . 8 ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ 𝐴)
1712, 16ssind 4137 . . . . . . 7 ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ (𝑌 ∩ 𝐴))
1817exlimiv 1962 . . . . . 6 (∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ (𝑌 ∩ 𝐴))
19 inss1 4133 . . . . . . . 8 (𝑌 ∩ 𝐴) ⊆ 𝑌
20 sstr2 3915 . . . . . . . 8 (𝑥 ⊆ (𝑌 ∩ 𝐴) → ((𝑌 ∩ 𝐴) ⊆ 𝑌 → 𝑥 ⊆ 𝑌))
2119, 20mpi 21 . . . . . . 7 (𝑥 ⊆ (𝑌 ∩ 𝐴) → 𝑥 ⊆ 𝑌)
22 inss2 4134 . . . . . . . 8 (𝑌 ∩ 𝐴) ⊆ 𝐴
23 sstr2 3915 . . . . . . . 8 (𝑥 ⊆ (𝑌 ∩ 𝐴) → ((𝑌 ∩ 𝐴) ⊆ 𝐴 → 𝑥 ⊆ 𝐴))
2422, 23mpi 21 . . . . . . 7 (𝑥 ⊆ (𝑌 ∩ 𝐴) → 𝑥 ⊆ 𝐴)
25 ssidd 3931 . . . . . . . . . 10 (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝑥)
26 id 23 . . . . . . . . . 10 (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐴)
2725, 26ssind 4137 . . . . . . . . 9 (𝑥 ⊆ 𝐴 → 𝑥 ⊆ (𝑥 ∩ 𝐴))
28 inss1 4133 . . . . . . . . . 10 (𝑥 ∩ 𝐴) ⊆ 𝑥
2928a1i 11 . . . . . . . . 9 (𝑥 ⊆ 𝐴 → (𝑥 ∩ 𝐴) ⊆ 𝑥)
3027, 29eqssd 3925 . . . . . . . 8 (𝑥 ⊆ 𝐴 → 𝑥 = (𝑥 ∩ 𝐴))
31 vex 3454 . . . . . . . . 9 𝑥 ∈ V
32 sseq1 3933 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑦 ⊆ 𝑌 ↔ 𝑥 ⊆ 𝑌))
33 ineq1 4110 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑦 ∩ 𝐴) = (𝑥 ∩ 𝐴))
3433eqeq2d 2771 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑥 = (𝑦 ∩ 𝐴) ↔ 𝑥 = (𝑥 ∩ 𝐴)))
3532, 34anbi12d 644 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ (𝑥 ⊆ 𝑌 ∧ 𝑥 = (𝑥 ∩ 𝐴))))
3631, 35spcev 3560 . . . . . . . 8 ((𝑥 ⊆ 𝑌 ∧ 𝑥 = (𝑥 ∩ 𝐴)) → ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
3730, 36sylan2 605 . . . . . . 7 ((𝑥 ⊆ 𝑌 ∧ 𝑥 ⊆ 𝐴) → ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
3821, 24, 37syl2anc 596 . . . . . 6 (𝑥 ⊆ (𝑌 ∩ 𝐴) → ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
3918, 38impbii 212 . . . . 5 (∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ 𝑥 ⊆ (𝑌 ∩ 𝐴))
406, 39bitri 278 . . . 4 (∃𝑦(𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ 𝑥 ⊆ (𝑌 ∩ 𝐴))
41 df-rex 3087 . . . 4 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
42 velpw 4561 . . . 4 (𝑥 ∈ 𝒫 (𝑌 ∩ 𝐴) ↔ 𝑥 ⊆ (𝑌 ∩ 𝐴))
4340, 41, 423bitr4i 306 . . 3 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌 ∩ 𝐴))
443, 43bitrdi 290 . 2 ((𝑌 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝑌 ↾t 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌 ∩ 𝐴)))
4544eqrdv 2758 1 ((𝑌 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝒫 𝑌 ↾t 𝐴) = 𝒫 (𝑌 ∩ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  (class class class)co 7420   ↾t crest 17596
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-rest 17598
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator