Theorem inintabss 43934

Description: Upper bound on intersection of class and the intersection of a class. (Contributed by RP, 13-Aug-2020.)

Assertion

Ref	Expression
inintabss	⊢ (𝐴 ∩ ∩ {𝑥 ∣ 𝜑}) ⊆ ∩ {𝑤 ∈ 𝒫 𝐴 ∣ ∃𝑥(𝑤 = (𝐴 ∩ 𝑥) ∧ 𝜑)}

Distinct variable groups:   𝜑,𝑤   𝑥,𝑤,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem inintabss

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-1 6	. . . 4 ⊢ (𝑢 ∈ 𝐴 → (∃𝑥𝜑 → 𝑢 ∈ 𝐴))
2	1	anim1i 616	. . 3 ⊢ ((𝑢 ∈ 𝐴 ∧ ∀𝑥(𝜑 → 𝑢 ∈ 𝑥)) → ((∃𝑥𝜑 → 𝑢 ∈ 𝐴) ∧ ∀𝑥(𝜑 → 𝑢 ∈ 𝑥)))
3		elinintab 43931	. . 3 ⊢ (𝑢 ∈ (𝐴 ∩ ∩ {𝑥 ∣ 𝜑}) ↔ (𝑢 ∈ 𝐴 ∧ ∀𝑥(𝜑 → 𝑢 ∈ 𝑥)))
4		elinintrab 43933	. . . 4 ⊢ (𝑢 ∈ V → (𝑢 ∈ ∩ {𝑤 ∈ 𝒫 𝐴 ∣ ∃𝑥(𝑤 = (𝐴 ∩ 𝑥) ∧ 𝜑)} ↔ ((∃𝑥𝜑 → 𝑢 ∈ 𝐴) ∧ ∀𝑥(𝜑 → 𝑢 ∈ 𝑥))))
5	4	elv 3447	. . 3 ⊢ (𝑢 ∈ ∩ {𝑤 ∈ 𝒫 𝐴 ∣ ∃𝑥(𝑤 = (𝐴 ∩ 𝑥) ∧ 𝜑)} ↔ ((∃𝑥𝜑 → 𝑢 ∈ 𝐴) ∧ ∀𝑥(𝜑 → 𝑢 ∈ 𝑥)))
6	2, 3, 5	3imtr4i 292	. 2 ⊢ (𝑢 ∈ (𝐴 ∩ ∩ {𝑥 ∣ 𝜑}) → 𝑢 ∈ ∩ {𝑤 ∈ 𝒫 𝐴 ∣ ∃𝑥(𝑤 = (𝐴 ∩ 𝑥) ∧ 𝜑)})
7	6	ssriv 3939	1 ⊢ (𝐴 ∩ ∩ {𝑥 ∣ 𝜑}) ⊆ ∩ {𝑤 ∈ 𝒫 𝐴 ∣ ∃𝑥(𝑤 = (𝐴 ∩ 𝑥) ∧ 𝜑)}

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715  {crab 3401  Vcvv 3442   ∩ cin 3902   ⊆ wss 3903  𝒫 cpw 4556  ∩ cint 4904

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-sep 5243

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-in 3910  df-ss 3920  df-pw 4558  df-int 4905

This theorem is referenced by: (None)