Theorem iinabrex 32665

Description: Rewriting an indexed intersection into an intersection of its image set. (Contributed by Thierry Arnoux, 15-Jun-2024.)

Assertion

Ref	Expression
iinabrex	⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})

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

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem iinabrex

Dummy variables 𝑡 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfra1 3264	. . . . . . . 8 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵
2		nfv 1921	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑡 ∈ 𝑧
3		eleq2 2829	. . . . . . . 8 ⊢ (𝑧 = 𝐵 → (𝑡 ∈ 𝑧 ↔ 𝑡 ∈ 𝐵))
4		vex 3436	. . . . . . . . 9 ⊢ 𝑧 ∈ V
5	4	a1i 11	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 → 𝑧 ∈ V)
6		rspa 3229	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑡 ∈ 𝐵)
7	1, 2, 3, 5, 6	elabreximd 32605	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 ∧ 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) → 𝑡 ∈ 𝑧)
8	7	ex 413	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 → (𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧))
9	8	alrimiv 1934	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 → ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧))
10	9	adantl 482	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵) → ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧))
11		nfra1 3264	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉
12	2	nfci 2890	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑧
13		nfre1 3265	. . . . . . . . . 10 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐴 𝑦 = 𝐵
14	13	nfab 2908	. . . . . . . . 9 ⊢ Ⅎ𝑥{𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}
15	12, 14	nfel 2916	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}
16	15, 2	nfim 1903	. . . . . . 7 ⊢ Ⅎ𝑥(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)
17	16	nfal 2332	. . . . . 6 ⊢ Ⅎ𝑥∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)
18	11, 17	nfan 1906	. . . . 5 ⊢ Ⅎ𝑥(∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧))
19		rspa 3229	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
20	19	elexd 3456	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ V)
21	20	adantlr 721	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ V)
22		simplr 774	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) ∧ 𝑥 ∈ 𝐴) → ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧))
23		rspe 3230	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
24		tbtru 1555	. . . . . . . . . . . 12 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤))
25	23, 24	sylib 219	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤))
26	25	ex 413	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → (𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤)))
27	26	alrimiv 1934	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤)))
28	27	adantl 482	. . . . . . . 8 ⊢ (((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) ∧ 𝑥 ∈ 𝐴) → ∀𝑦(𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤)))
29		elabgt 3617	. . . . . . . . 9 ⊢ ((𝐵 ∈ V ∧ ∀𝑦(𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤))) → (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ ⊤))
30		tbtru 1555	. . . . . . . . 9 ⊢ (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ ⊤))
31	29, 30	sylibr 235	. . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ ∀𝑦(𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ⊤))) → 𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
32	21, 28, 31	syl2anc 590	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
33		eleq1 2828	. . . . . . . . . . 11 ⊢ (𝑧 = 𝐵 → (𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ 𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}))
34	33, 3	imbi12d 345	. . . . . . . . . 10 ⊢ (𝑧 = 𝐵 → ((𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧) ↔ (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝐵)))
35	34	spcgv 3541	. . . . . . . . 9 ⊢ (𝐵 ∈ V → (∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧) → (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝐵)))
36	35	imp 407	. . . . . . . 8 ⊢ ((𝐵 ∈ V ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) → (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝐵))
37	36	imp 407	. . . . . . 7 ⊢ (((𝐵 ∈ V ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) ∧ 𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) → 𝑡 ∈ 𝐵)
38	21, 22, 32, 37	syl21anc 843	. . . . . 6 ⊢ (((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) ∧ 𝑥 ∈ 𝐴) → 𝑡 ∈ 𝐵)
39	38	ex 413	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) → (𝑥 ∈ 𝐴 → 𝑡 ∈ 𝐵))
40	18, 39	ralrimi 3238	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 ∧ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)) → ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵)
41	10, 40	impbida 806	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵 ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)))
42	41	abbidv 2806	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → {𝑡 ∣ ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵} = {𝑡 ∣ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)})
43		df-iin 4931	. . 3 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑡 ∣ ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵}
44	43	a1i 11	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑡 ∣ ∀𝑥 ∈ 𝐴 𝑡 ∈ 𝐵})
45		df-int 4885	. . 3 ⊢ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} = {𝑡 ∣ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)}
46	45	a1i 11	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} = {𝑡 ∣ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑡 ∈ 𝑧)})
47	42, 44, 46	3eqtr4d 2785	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396  ∀wal 1545   = wceq 1547  ⊤wtru 1548   ∈ wcel 2119  {cab 2718  ∀wral 3054  ∃wrex 3064  Vcvv 3432  ∩ cint 4884  ∩ ciin 4929

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ral 3055  df-rex 3065  df-v 3434  df-int 4885  df-iin 4931

This theorem is referenced by:  intimafv  32810