Theorem dfiin2g 4045

Description: Alternate definition of indexed intersection when 𝐵 is a set. (Contributed by Jeff Hankins, 27-Aug-2009.)

Assertion

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

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

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥, 𝑦)

Proof of Theorem dfiin2g

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

Step	Hyp	Ref	Expression
1		df-ral 2533	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵))
2		df-ral 2533	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐶))
3		eleq2 2302	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐵 → (𝑤 ∈ 𝑧 ↔ 𝑤 ∈ 𝐵))
4	3	biimprcd 160	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ 𝐵 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧))
5	4	alrimiv 1927	. . . . . . . . . . 11 ⊢ (𝑤 ∈ 𝐵 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))
6		eqid 2238	. . . . . . . . . . . 12 ⊢ 𝐵 = 𝐵
7		eqeq1 2245	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝐵 → (𝑧 = 𝐵 ↔ 𝐵 = 𝐵))
8	7, 3	imbi12d 234	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐵 → ((𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ (𝐵 = 𝐵 → 𝑤 ∈ 𝐵)))
9	8	spcgv 2912	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ 𝐶 → (∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧) → (𝐵 = 𝐵 → 𝑤 ∈ 𝐵)))
10	6, 9	mpii 44	. . . . . . . . . . 11 ⊢ (𝐵 ∈ 𝐶 → (∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧) → 𝑤 ∈ 𝐵))
11	5, 10	impbid2 143	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝐶 → (𝑤 ∈ 𝐵 ↔ ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
12	11	imim2i 12	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐶) → (𝑥 ∈ 𝐴 → (𝑤 ∈ 𝐵 ↔ ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))))
13	12	pm5.74d 182	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐶) → ((𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))))
14	13	alimi 1508	. . . . . . 7 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐶) → ∀𝑥((𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))))
15		albi 1521	. . . . . . 7 ⊢ (∀𝑥((𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))) → (∀𝑥(𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))))
16	14, 15	syl 14	. . . . . 6 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝐵 ∈ 𝐶) → (∀𝑥(𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))))
17	2, 16	sylbi 121	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → (∀𝑥(𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧))))
18		df-ral 2533	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 (𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
19	18	albii 1523	. . . . . . 7 ⊢ (∀𝑧∀𝑥 ∈ 𝐴 (𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ ∀𝑧∀𝑥(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
20		alcom 1531	. . . . . . 7 ⊢ (∀𝑥∀𝑧(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)) ↔ ∀𝑧∀𝑥(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
21	19, 20	bitr4i 187	. . . . . 6 ⊢ (∀𝑧∀𝑥 ∈ 𝐴 (𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ ∀𝑥∀𝑧(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
22		r19.23v 2660	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 (𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ (∃𝑥 ∈ 𝐴 𝑧 = 𝐵 → 𝑤 ∈ 𝑧))
23		vex 2824	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
24		eqeq1 2245	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑦 = 𝐵 ↔ 𝑧 = 𝐵))
25	24	rexbidv 2551	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵))
26	23, 25	elab 2970	. . . . . . . . 9 ⊢ (𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
27	26	imbi1i 238	. . . . . . . 8 ⊢ ((𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧) ↔ (∃𝑥 ∈ 𝐴 𝑧 = 𝐵 → 𝑤 ∈ 𝑧))
28	22, 27	bitr4i 187	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ (𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧))
29	28	albii 1523	. . . . . 6 ⊢ (∀𝑧∀𝑥 ∈ 𝐴 (𝑧 = 𝐵 → 𝑤 ∈ 𝑧) ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧))
30		19.21v 1926	. . . . . . 7 ⊢ (∀𝑧(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)) ↔ (𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
31	30	albii 1523	. . . . . 6 ⊢ (∀𝑥∀𝑧(𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ∈ 𝑧)) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧)))
32	21, 29, 31	3bitr3ri 211	. . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑧(𝑧 = 𝐵 → 𝑤 ∈ 𝑧)) ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧))
33	17, 32	bitrdi 196	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → (∀𝑥(𝑥 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧)))
34	1, 33	bitrid 192	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → (∀𝑥 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧)))
35	34	abbidv 2358	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → {𝑤 ∣ ∀𝑥 ∈ 𝐴 𝑤 ∈ 𝐵} = {𝑤 ∣ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧)})
36		df-iin 4015	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑤 ∣ ∀𝑥 ∈ 𝐴 𝑤 ∈ 𝐵}
37		df-int 3971	. 2 ⊢ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} = {𝑤 ∣ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → 𝑤 ∈ 𝑧)}
38	35, 36, 37	3eqtr4g 2296	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})

This proof depends on syntax axioms:   → wi 4   ↔ wb 105  ∀wal 1400   = wceq 1402   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  ∩ cint 3970  ∩ ciin 4013

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-int 3971  df-iin 4015

This theorem is used by:  dfiin2  4047  iinexgm  4290  dfiin3g  5040  fniinfv  5761