Theorem iinexgm 4140

Description: The existence of an indexed union. 𝑥 is normally a free-variable parameter in 𝐵, which should be read 𝐵(𝑥). (Contributed by Jim Kingdon, 28-Aug-2018.)

Assertion

Ref	Expression
iinexgm	⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V)

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem iinexgm

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

Step	Hyp	Ref	Expression
1		dfiin2g 3906	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
2	1	adantl 275	. 2 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
3		elisset 2744	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)
4	3	rgenw 2525	. . . . . . . . 9 ⊢ ∀𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)
5		r19.2m 3501	. . . . . . . . 9 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵)) → ∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵))
6	4, 5	mpan2 423	. . . . . . . 8 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵))
7		r19.35-1 2620	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 (𝐵 ∈ 𝐶 → ∃𝑦 𝑦 = 𝐵) → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵))
8	6, 7	syl 14	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶 → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵))
9	8	imp 123	. . . . . 6 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵)
10		rexcom4 2753	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
11	9, 10	sylib 121	. . . . 5 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
12		abid 2158	. . . . . 6 ⊢ (𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
13	12	exbii 1598	. . . . 5 ⊢ (∃𝑦 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ ∃𝑦∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
14	11, 13	sylibr 133	. . . 4 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑦 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
15		nfv 1521	. . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}
16		nfsab1 2160	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}
17		eleq1w 2231	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}))
18	15, 16, 17	cbvex 1749	. . . 4 ⊢ (∃𝑦 𝑦 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ↔ ∃𝑧 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
19	14, 18	sylib 121	. . 3 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∃𝑧 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵})
20		inteximm 4135	. . 3 ⊢ (∃𝑧 𝑧 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V)
21	19, 20	syl 14	. 2 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V)
22	2, 21	eqeltrd 2247	1 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐶) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ V)

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1348  ∃wex 1485   ∈ wcel 2141  {cab 2156  ∀wral 2448  ∃wrex 2449  Vcvv 2730  ∩ cint 3831  ∩ ciin 3874

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-sep 4107

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-in 3127  df-ss 3134  df-int 3832  df-iin 3876

This theorem is referenced by: (None)