Theorem elmapintrab 44535

Description: Two ways to say a set is an element of the intersection of a class of images. (Contributed by RP, 16-Aug-2020.)

Hypotheses

Ref	Expression
elmapintrab.ex	⊢ 𝐶 ∈ V
elmapintrab.sub	⊢ 𝐶 ⊆ 𝐵

Assertion

Ref	Expression
elmapintrab	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ {𝑤 ∈ 𝒫 𝐵 ∣ ∃𝑥(𝑤 = 𝐶 ∧ 𝜑)} ↔ ((∃𝑥𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶))))

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

Allowed substitution hints:   𝜑(𝑥)   𝐶(𝑥)   𝑉(𝑥, 𝑤)

Proof of Theorem elmapintrab

Step	Hyp	Ref	Expression
1		elintrabg 4921	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ {𝑤 ∈ 𝒫 𝐵 ∣ ∃𝑥(𝑤 = 𝐶 ∧ 𝜑)} ↔ ∀𝑤 ∈ 𝒫 𝐵(∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)))
2		df-ral 3078	. . 3 ⊢ (∀𝑤 ∈ 𝒫 𝐵(∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤) ↔ ∀𝑤(𝑤 ∈ 𝒫 𝐵 → (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)))
3	1, 2	bitrdi 290	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ {𝑤 ∈ 𝒫 𝐵 ∣ ∃𝑥(𝑤 = 𝐶 ∧ 𝜑)} ↔ ∀𝑤(𝑤 ∈ 𝒫 𝐵 → (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤))))
4		velpw 4562	. . . . . 6 ⊢ (𝑤 ∈ 𝒫 𝐵 ↔ 𝑤 ⊆ 𝐵)
5		19.23v 1975	. . . . . . 7 ⊢ (∀𝑥((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤) ↔ (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤))
6	5	bicomi 227	. . . . . 6 ⊢ ((∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤) ↔ ∀𝑥((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤))
7	4, 6	imbi12i 353	. . . . 5 ⊢ ((𝑤 ∈ 𝒫 𝐵 → (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ (𝑤 ⊆ 𝐵 → ∀𝑥((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)))
8		19.21v 1972	. . . . 5 ⊢ (∀𝑥(𝑤 ⊆ 𝐵 → ((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ (𝑤 ⊆ 𝐵 → ∀𝑥((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)))
9		bi2.04 392	. . . . . . 7 ⊢ ((𝑤 ⊆ 𝐵 → ((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ ((𝑤 = 𝐶 ∧ 𝜑) → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤)))
10		impexp 456	. . . . . . 7 ⊢ (((𝑤 = 𝐶 ∧ 𝜑) → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤)) ↔ (𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))))
11	9, 10	bitri 278	. . . . . 6 ⊢ ((𝑤 ⊆ 𝐵 → ((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ (𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))))
12	11	albii 1852	. . . . 5 ⊢ (∀𝑥(𝑤 ⊆ 𝐵 → ((𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ ∀𝑥(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))))
13	7, 8, 12	3bitr2i 302	. . . 4 ⊢ ((𝑤 ∈ 𝒫 𝐵 → (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ ∀𝑥(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))))
14	13	albii 1852	. . 3 ⊢ (∀𝑤(𝑤 ∈ 𝒫 𝐵 → (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ ∀𝑤∀𝑥(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))))
15		alcom 2196	. . 3 ⊢ (∀𝑤∀𝑥(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))) ↔ ∀𝑥∀𝑤(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))))
16		elmapintrab.ex	. . . . . . 7 ⊢ 𝐶 ∈ V
17		sseq1 3956	. . . . . . . . 9 ⊢ (𝑤 = 𝐶 → (𝑤 ⊆ 𝐵 ↔ 𝐶 ⊆ 𝐵))
18		eleq2 2850	. . . . . . . . . 10 ⊢ (𝑤 = 𝐶 → (𝐴 ∈ 𝑤 ↔ 𝐴 ∈ 𝐶))
19		elmapintrab.sub	. . . . . . . . . . . 12 ⊢ 𝐶 ⊆ 𝐵
20	19	sseli 3927	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ 𝐵)
21	20	pm4.71ri 570	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐶 ↔ (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))
22	18, 21	bitrdi 290	. . . . . . . . 9 ⊢ (𝑤 = 𝐶 → (𝐴 ∈ 𝑤 ↔ (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)))
23	17, 22	imbi12d 347	. . . . . . . 8 ⊢ (𝑤 = 𝐶 → ((𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤) ↔ (𝐶 ⊆ 𝐵 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))))
24	23	imbi2d 343	. . . . . . 7 ⊢ (𝑤 = 𝐶 → ((𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤)) ↔ (𝜑 → (𝐶 ⊆ 𝐵 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)))))
25	16, 24	ceqsalv 3490	. . . . . 6 ⊢ (∀𝑤(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))) ↔ (𝜑 → (𝐶 ⊆ 𝐵 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))))
26		bi2.04 392	. . . . . 6 ⊢ ((𝜑 → (𝐶 ⊆ 𝐵 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))) ↔ (𝐶 ⊆ 𝐵 → (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))))
27		pm5.5 364	. . . . . . . 8 ⊢ (𝐶 ⊆ 𝐵 → ((𝐶 ⊆ 𝐵 → (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))) ↔ (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))))
28	19, 27	ax-mp 5	. . . . . . 7 ⊢ ((𝐶 ⊆ 𝐵 → (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))) ↔ (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)))
29		jcab 527	. . . . . . 7 ⊢ ((𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)) ↔ ((𝜑 → 𝐴 ∈ 𝐵) ∧ (𝜑 → 𝐴 ∈ 𝐶)))
30	28, 29	bitri 278	. . . . . 6 ⊢ ((𝐶 ⊆ 𝐵 → (𝜑 → (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶))) ↔ ((𝜑 → 𝐴 ∈ 𝐵) ∧ (𝜑 → 𝐴 ∈ 𝐶)))
31	25, 26, 30	3bitri 300	. . . . 5 ⊢ (∀𝑤(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))) ↔ ((𝜑 → 𝐴 ∈ 𝐵) ∧ (𝜑 → 𝐴 ∈ 𝐶)))
32	31	albii 1852	. . . 4 ⊢ (∀𝑥∀𝑤(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))) ↔ ∀𝑥((𝜑 → 𝐴 ∈ 𝐵) ∧ (𝜑 → 𝐴 ∈ 𝐶)))
33		19.26 1903	. . . 4 ⊢ (∀𝑥((𝜑 → 𝐴 ∈ 𝐵) ∧ (𝜑 → 𝐴 ∈ 𝐶)) ↔ (∀𝑥(𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶)))
34		19.23v 1975	. . . . 5 ⊢ (∀𝑥(𝜑 → 𝐴 ∈ 𝐵) ↔ (∃𝑥𝜑 → 𝐴 ∈ 𝐵))
35	34	anbi1i 636	. . . 4 ⊢ ((∀𝑥(𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶)) ↔ ((∃𝑥𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶)))
36	32, 33, 35	3bitri 300	. . 3 ⊢ (∀𝑥∀𝑤(𝑤 = 𝐶 → (𝜑 → (𝑤 ⊆ 𝐵 → 𝐴 ∈ 𝑤))) ↔ ((∃𝑥𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶)))
37	14, 15, 36	3bitri 300	. 2 ⊢ (∀𝑤(𝑤 ∈ 𝒫 𝐵 → (∃𝑥(𝑤 = 𝐶 ∧ 𝜑) → 𝐴 ∈ 𝑤)) ↔ ((∃𝑥𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶)))
38	3, 37	bitrdi 290	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ {𝑤 ∈ 𝒫 𝐵 ∣ ∃𝑥(𝑤 = 𝐶 ∧ 𝜑)} ↔ ((∃𝑥𝜑 → 𝐴 ∈ 𝐵) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝐶))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  {crab 3413  Vcvv 3451   ⊆ wss 3899  𝒫 cpw 4557  ∩ cint 4907

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-ss 3916  df-pw 4559  df-int 4908

This theorem is used by:  elinintrab  44536  cnvcnvintabd  44559  cnvintabd  44562