Theorem ptuni2 23907

Description: The base set for the product topology. (Contributed by Mario Carneiro, 3-Feb-2015.)

Hypothesis

Ref	Expression
ptbas.1	⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}

Assertion

Ref	Expression
ptuni2	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐵)

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

Allowed substitution hints:   𝐵(𝑥, 𝑦, 𝑧, 𝑔)

Proof of Theorem ptuni2

Step	Hyp	Ref	Expression
1		ptbas.1	. . . 4 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
2	1	ptbasid 23906	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ 𝐵)
3		elssuni 4901	. . 3 ⊢ (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ 𝐵 → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ⊆ ∪ 𝐵)
4	2, 3	syl 18	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ⊆ ∪ 𝐵)
5		simpr2 1214	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦))) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦))
6		elssuni 4901	. . . . . . . . . . 11 ⊢ ((𝑔‘𝑦) ∈ (𝐹‘𝑦) → (𝑔‘𝑦) ⊆ ∪ (𝐹‘𝑦))
7	6	ralimi 3102	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ ∪ (𝐹‘𝑦))
8		ss2ixp 8949	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ ∪ (𝐹‘𝑦) → X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ X𝑦 ∈ 𝐴 ∪ (𝐹‘𝑦))
9	5, 7, 8	3syl 19	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦))) → X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ X𝑦 ∈ 𝐴 ∪ (𝐹‘𝑦))
10		fveq2 6893	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑘 → (𝐹‘𝑦) = (𝐹‘𝑘))
11	10	unieqd 4882	. . . . . . . . . 10 ⊢ (𝑦 = 𝑘 → ∪ (𝐹‘𝑦) = ∪ (𝐹‘𝑘))
12	11	cbvixpv 8954	. . . . . . . . 9 ⊢ X𝑦 ∈ 𝐴 ∪ (𝐹‘𝑦) = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)
13	9, 12	sseqtrdi 3952	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦))) → X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
14		velpw 4564	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ 𝑥 ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
15		sseq1 3937	. . . . . . . . 9 ⊢ (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑥 ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)))
16	14, 15	bitrid 286	. . . . . . . 8 ⊢ (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑥 ∈ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)))
17	13, 16	syl5ibrcom 250	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦))) → (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → 𝑥 ∈ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)))
18	17	expimpd 459	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → 𝑥 ∈ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)))
19	18	exlimdv 1967	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → 𝑥 ∈ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)))
20	19	abssdv 3994	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
21	1, 20	eqsstrid 3950	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐵 ⊆ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
22		sspwuni 5062	. . 3 ⊢ (𝐵 ⊆ 𝒫 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ ∪ 𝐵 ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
23	21, 22	sylib 221	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∪ 𝐵 ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
24	4, 23	eqssd 3929	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2146  {cab 2741  ∀wral 3079  ∃wrex 3089   ⊆ wss 3899   ∖ cdif 4047  𝒫 cpw 4559  ∪ cuni 4869   Fn wfn 6541  ⟶wf 6542  ‘cfv 6546  Xcixp 8936  Fincfn 8984  Topctop 23223

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6371  df-on 6372  df-lim 6373  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-om 7885  df-ixp 8937  df-en 8985  df-fin 8988  df-top 23224

This theorem is used by:  ptbasin2  23909  ptbasfi  23912  ptuni  23925