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 37981
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 23476 (which uses distop 23293 and restopn2 23475). (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 5340 . . . 4 (𝑌 ∈ 𝑉 → 𝒫 𝑌 ∈ V)
2 elrest 17578 . . . 4 ((𝒫 𝑌 ∈ V ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝑌 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴)))
31, 2sylan 592 . . 3 ((𝑌 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝑌 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴)))
4 velpw 4562 . . . . . . 7 (𝑦 ∈ 𝒫 𝑌 ↔ 𝑦 ⊆ 𝑌)
54anbi1i 636 . . . . . 6 ((𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ (𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
65exbii 1881 . . . . 5 (∃𝑦(𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
7 sstr2 3938 . . . . . . . . . 10 (𝑥 ⊆ 𝑦 → (𝑦 ⊆ 𝑌 → 𝑥 ⊆ 𝑌))
87com12 33 . . . . . . . . 9 (𝑦 ⊆ 𝑌 → (𝑥 ⊆ 𝑦 → 𝑥 ⊆ 𝑌))
9 inss1 4182 . . . . . . . . . 10 (𝑦 ∩ 𝐴) ⊆ 𝑦
10 sseq1 3956 . . . . . . . . . 10 (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝑦 ↔ (𝑦 ∩ 𝐴) ⊆ 𝑦))
119, 10mpbiri 261 . . . . . . . . 9 (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝑦)
128, 11impel 515 . . . . . . . 8 ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ 𝑌)
13 inss2 4183 . . . . . . . . . 10 (𝑦 ∩ 𝐴) ⊆ 𝐴
14 sseq1 3956 . . . . . . . . . 10 (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∩ 𝐴) ⊆ 𝐴))
1513, 14mpbiri 261 . . . . . . . . 9 (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴)
1615adantl 487 . . . . . . . 8 ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ 𝐴)
1712, 16ssind 4186 . . . . . . 7 ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ (𝑌 ∩ 𝐴))
1817exlimiv 1963 . . . . . 6 (∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) → 𝑥 ⊆ (𝑌 ∩ 𝐴))
19 inss1 4182 . . . . . . . 8 (𝑌 ∩ 𝐴) ⊆ 𝑌
20 sstr2 3938 . . . . . . . 8 (𝑥 ⊆ (𝑌 ∩ 𝐴) → ((𝑌 ∩ 𝐴) ⊆ 𝑌 → 𝑥 ⊆ 𝑌))
2119, 20mpi 21 . . . . . . 7 (𝑥 ⊆ (𝑌 ∩ 𝐴) → 𝑥 ⊆ 𝑌)
22 inss2 4183 . . . . . . . 8 (𝑌 ∩ 𝐴) ⊆ 𝐴
23 sstr2 3938 . . . . . . . 8 (𝑥 ⊆ (𝑌 ∩ 𝐴) → ((𝑌 ∩ 𝐴) ⊆ 𝐴 → 𝑥 ⊆ 𝐴))
2422, 23mpi 21 . . . . . . 7 (𝑥 ⊆ (𝑌 ∩ 𝐴) → 𝑥 ⊆ 𝐴)
25 ssidd 3954 . . . . . . . . . 10 (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝑥)
26 id 23 . . . . . . . . . 10 (𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐴)
2725, 26ssind 4186 . . . . . . . . 9 (𝑥 ⊆ 𝐴 → 𝑥 ⊆ (𝑥 ∩ 𝐴))
28 inss1 4182 . . . . . . . . . 10 (𝑥 ∩ 𝐴) ⊆ 𝑥
2928a1i 11 . . . . . . . . 9 (𝑥 ⊆ 𝐴 → (𝑥 ∩ 𝐴) ⊆ 𝑥)
3027, 29eqssd 3948 . . . . . . . 8 (𝑥 ⊆ 𝐴 → 𝑥 = (𝑥 ∩ 𝐴))
31 vex 3455 . . . . . . . . 9 𝑥 ∈ V
32 sseq1 3956 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑦 ⊆ 𝑌 ↔ 𝑥 ⊆ 𝑌))
33 ineq1 4159 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑦 ∩ 𝐴) = (𝑥 ∩ 𝐴))
3433eqeq2d 2772 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑥 = (𝑦 ∩ 𝐴) ↔ 𝑥 = (𝑥 ∩ 𝐴)))
3532, 34anbi12d 644 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ (𝑥 ⊆ 𝑌 ∧ 𝑥 = (𝑥 ∩ 𝐴))))
3631, 35spcev 3561 . . . . . . . 8 ((𝑥 ⊆ 𝑌 ∧ 𝑥 = (𝑥 ∩ 𝐴)) → ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
3730, 36sylan2 605 . . . . . . 7 ((𝑥 ⊆ 𝑌 ∧ 𝑥 ⊆ 𝐴) → ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
3821, 24, 37syl2anc 596 . . . . . 6 (𝑥 ⊆ (𝑌 ∩ 𝐴) → ∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
3918, 38impbii 212 . . . . 5 (∃𝑦(𝑦 ⊆ 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ 𝑥 ⊆ (𝑌 ∩ 𝐴))
406, 39bitri 278 . . . 4 (∃𝑦(𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)) ↔ 𝑥 ⊆ (𝑌 ∩ 𝐴))
41 df-rex 3088 . . . 4 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴) ↔ ∃𝑦(𝑦 ∈ 𝒫 𝑌 ∧ 𝑥 = (𝑦 ∩ 𝐴)))
42 velpw 4562 . . . 4 (𝑥 ∈ 𝒫 (𝑌 ∩ 𝐴) ↔ 𝑥 ⊆ (𝑌 ∩ 𝐴))
4340, 41, 423bitr4i 306 . . 3 (∃𝑦 ∈ 𝒫 𝑌𝑥 = (𝑦 ∩ 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌 ∩ 𝐴))
443, 43bitrdi 290 . 2 ((𝑌 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑥 ∈ (𝒫 𝑌 ↾t 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑌 ∩ 𝐴)))
4544eqrdv 2759 1 ((𝑌 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝒫 𝑌 ↾t 𝐴) = 𝒫 (𝑌 ∩ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  (class class class)co 7412   ↾t crest 17571
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-rest 17573
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator