Theorem elptr2 23768

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 6899	. . . 4 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦)
2		nfcv 2928	. . . 4 ⊢ Ⅎ𝑦((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘)
3		fveq2 6888	. . . 4 ⊢ (𝑦 = 𝑘 → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘))
4	1, 2, 3	cbvixp 8921	. . 3 ⊢ X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = X𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘)
5		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
6		elptr2.3	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ∈ (𝐹‘𝑘))
7		eqid 2766	. . . . . 6 ⊢ (𝑘 ∈ 𝐴 ↦ 𝑆) = (𝑘 ∈ 𝐴 ↦ 𝑆)
8	7	fvmpt2 7008	. . . . 5 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝑆 ∈ (𝐹‘𝑘)) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = 𝑆)
9	5, 6, 8	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = 𝑆)
10	9	ixpeq2dva 8919	. . 3 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = X𝑘 ∈ 𝐴 𝑆)
11	4, 10	eqtrid 2813	. 2 ⊢ (𝜑 → X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = X𝑘 ∈ 𝐴 𝑆)
12		elptr2.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
13	6	ralrimiva 3160	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ∈ (𝐹‘𝑘))
14	7	fnmpt 6682	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝑆 ∈ (𝐹‘𝑘) → (𝑘 ∈ 𝐴 ↦ 𝑆) Fn 𝐴)
15	13, 14	syl 18	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑆) Fn 𝐴)
16	9, 6	eqeltrd 2866	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘))
17	16	ralrimiva 3160	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘))
18	1	nfel1 2944	. . . . 5 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦)
19		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘)
20		fveq2 6888	. . . . . 6 ⊢ (𝑦 = 𝑘 → (𝐹‘𝑦) = (𝐹‘𝑘))
21	3, 20	eleq12d 2860	. . . . 5 ⊢ (𝑦 = 𝑘 → (((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦) ↔ ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘)))
22	18, 19, 21	cbvralw 3310	. . . 4 ⊢ (∀𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦) ↔ ∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) ∈ (𝐹‘𝑘))
23	17, 22	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦))
24		elptr2.2	. . 3 ⊢ (𝜑 → 𝑊 ∈ Fin)
25		eldifi 4088	. . . . . . 7 ⊢ (𝑘 ∈ (𝐴 ∖ 𝑊) → 𝑘 ∈ 𝐴)
26	25, 9	sylan2 605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = 𝑆)
27		elptr2.4	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝑆 = ∪ (𝐹‘𝑘))
28	26, 27	eqtrd 2801	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘))
29	28	ralrimiva 3160	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘))
30	1	nfeq1 2943	. . . . 5 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦)
31		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘)
32	20	unieqd 4890	. . . . . 6 ⊢ (𝑦 = 𝑘 → ∪ (𝐹‘𝑦) = ∪ (𝐹‘𝑘))
33	3, 32	eqeq12d 2782	. . . . 5 ⊢ (𝑦 = 𝑘 → (((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦) ↔ ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘)))
34	30, 31, 33	cbvralw 3310	. . . 4 ⊢ (∀𝑦 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∀𝑘 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑘) = ∪ (𝐹‘𝑘))
35	29, 34	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦))
36		ptbas.1	. . . 4 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
37	36	elptr 23767	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝑘 ∈ 𝐴 ↦ 𝑆) Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) = ∪ (𝐹‘𝑦))) → X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ 𝐵)
38	12, 15, 23, 24, 35, 37	syl122anc 1406	. 2 ⊢ (𝜑 → X𝑦 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝑆)‘𝑦) ∈ 𝐵)
39	11, 38	eqeltrrd 2867	1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ∈ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2146  {cab 2744  ∀wral 3082  ∃wrex 3092   ∖ cdif 3905  ∪ cuni 4877   ↦ cmpt 5197   Fn wfn 6538  ‘cfv 6543  Xcixp 8904  Fincfn 8952

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ixp 8905

This theorem is used by:  ptbasid  23769  ptbasin  23771  ptpjpre2  23774  ptopn  23777