Theorem inpw 49904

Description: Two ways of expressing a collection of subsets as seen in df-ntr 23331, unimax 4905, and others. (Contributed by Zhi Wang, 27-Sep-2024.)

Assertion

Ref	Expression
inpw	⊢ (𝐵 ∈ 𝑉 → (𝐴 ∩ 𝒫 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ⊆ 𝐵})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑉

Proof of Theorem inpw

Step	Hyp	Ref	Expression
1		dfin5 3907	. 2 ⊢ (𝐴 ∩ 𝒫 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝒫 𝐵}
2		elpw2g 5295	. . 3 ⊢ (𝐵 ∈ 𝑉 → (𝑥 ∈ 𝒫 𝐵 ↔ 𝑥 ⊆ 𝐵))
3	2	rabbidv 3420	. 2 ⊢ (𝐵 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝑥 ∈ 𝒫 𝐵} = {𝑥 ∈ 𝐴 ∣ 𝑥 ⊆ 𝐵})
4	1, 3	eqtrid 2808	1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∩ 𝒫 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝑥 ⊆ 𝐵})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557

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-ext 2733  ax-sep 5249

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-in 3906  df-ss 3916  df-pw 4559

This theorem is used by:  toplatglb  50078