Theorem elptr2 23873

Description: A basic open set in the product topology. (Contributed by Mario Carneiro, 3-Feb-2015.)

Hypotheses

Ref	Expression
ptbas.1	⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
elptr2.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
elptr2.2	⊢ (𝜑 → 𝑊 ∈ Fin)
elptr2.3	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ∈ (𝐹‘𝑘))
elptr2.4	⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝑆 = ∪ (𝐹‘𝑘))

Assertion

Ref	Expression
elptr2	⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ∈ 𝐵)

Distinct variable groups:   𝐵,𝑘   𝑥,𝑔,𝑦   𝜑,𝑘   𝑔,𝑘,𝑧,𝐴,𝑥,𝑦   𝑔,𝐹,𝑘,𝑥,𝑦,𝑧   𝑆,𝑔,𝑥   𝑔,𝑉,𝑘,𝑥,𝑦,𝑧   𝑘,𝑊,𝑦   𝑦,𝑆

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑔)   𝐵(𝑥, 𝑦, 𝑧, 𝑔)   𝑆(𝑧, 𝑘)   𝑊(𝑥, 𝑧, 𝑔)

Proof of Theorem elptr2

Step	Hyp	Ref	Expression
1		nffvmpt1 6888	. . . 4 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦)
2		nfcv 2923	. . . 4 ⊢ Ⅎ𝑦((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘)
3		fveq2 6877	. . . 4 ⊢ (𝑦 = 𝑘 → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘))
4	1, 2, 3	cbvixp 8926	. . 3 ⊢ X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = X𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘)
5		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
6		elptr2.3	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ∈ (𝐹‘𝑘))
7		eqid 2761	. . . . . 6 ⊢ (𝑘 ∈ 𝐴 ↦ 𝑆) = (𝑘 ∈ 𝐴 ↦ 𝑆)
8	7	fvmpt2 6997	. . . . 5 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝑆 ∈ (𝐹‘𝑘)) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = 𝑆)
9	5, 6, 8	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = 𝑆)
10	9	ixpeq2dva 8924	. . 3 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = X𝑘 ∈ 𝐴 𝑆)
11	4, 10	eqtrid 2808	. 2 ⊢ (𝜑 → X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = X𝑘 ∈ 𝐴 𝑆)
12		elptr2.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
13	6	ralrimiva 3155	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ∈ (𝐹‘𝑘))
14	7	fnmpt 6671	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝑆 ∈ (𝐹‘𝑘) → (𝑘 ∈ 𝐴 ↦ 𝑆) Fn 𝐴)
15	13, 14	syl 18	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑆) Fn 𝐴)
16	9, 6	eqeltrd 2861	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘))
17	16	ralrimiva 3155	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘))
18	1	nfel1 2939	. . . . 5 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦)
19		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘)
20		fveq2 6877	. . . . . 6 ⊢ (𝑦 = 𝑘 → (𝐹‘𝑦) = (𝐹‘𝑘))
21	3, 20	eleq12d 2855	. . . . 5 ⊢ (𝑦 = 𝑘 → (((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦) ↔ ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘)))
22	18, 19, 21	cbvralw 3305	. . . 4 ⊢ (∀𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦) ↔ ∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘))
23	17, 22	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦))
24		elptr2.2	. . 3 ⊢ (𝜑 → 𝑊 ∈ Fin)
25		eldifi 4078	. . . . . . 7 ⊢ (𝑘 ∈ (𝐴 ∖ 𝑊) → 𝑘 ∈ 𝐴)
26	25, 9	sylan2 605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = 𝑆)
27		elptr2.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝑆 = ∪ (𝐹‘𝑘))
28	26, 27	eqtrd 2796	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘))
29	28	ralrimiva 3155	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘))
30	1	nfeq1 2938	. . . . 5 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦)
31		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘)
32	20	unieqd 4880	. . . . . 6 ⊢ (𝑦 = 𝑘 → ∪ (𝐹‘𝑦) = ∪ (𝐹‘𝑘))
33	3, 32	eqeq12d 2777	. . . . 5 ⊢ (𝑦 = 𝑘 → (((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦) ↔ ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘)))
34	30, 31, 33	cbvralw 3305	. . . 4 ⊢ (∀𝑦 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∀𝑘 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘))
35	29, 34	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦))
36		ptbas.1	. . . 4 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
37	36	elptr 23872	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝑘 ∈ 𝐴 ↦ 𝑆) Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦))) → X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ 𝐵)
38	12, 15, 23, 24, 35, 37	syl122anc 1406	. 2 ⊢ (𝜑 → X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ 𝐵)
39	11, 38	eqeltrrd 2862	1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ∈ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2739  ∀wral 3077  ∃wrex 3087   ∖ cdif 3896  ∪ cuni 4867   ↦ cmpt 5186   Fn wfn 6526  ‘cfv 6531  Xcixp 8909  Fincfn 8957

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  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ixp 8910

This theorem is used by:  ptbasid  23874  ptbasin  23876  ptpjpre2  23879  ptopn  23882