Theorem elpt 23435

Description: Elementhood in the bases of a product topology. (Contributed by Mario Carneiro, 3-Feb-2015.)

Hypothesis

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

Assertion

Ref	Expression
elpt	⊢ (𝑆 ∈ 𝐵 ↔ ∃ℎ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (ℎ‘𝑦)))

Distinct variable groups:   𝑔,ℎ,𝑤,𝑥,𝑦,𝑧,𝐴   𝑔,𝐹,ℎ,𝑤,𝑥,𝑦,𝑧   𝑆,𝑔,ℎ,𝑥

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

Proof of Theorem elpt

Step	Hyp	Ref	Expression
1		ptbas.1	. . 3 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
2	1	eleq2i 2820	. 2 ⊢ (𝑆 ∈ 𝐵 ↔ 𝑆 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))})
3		simpr 484	. . . . 5 ⊢ (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))
4		ixpexg 8872	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ V → X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ V)
5		fvexd 6855	. . . . . 6 ⊢ (𝑦 ∈ 𝐴 → (𝑔‘𝑦) ∈ V)
6	4, 5	mprg 3050	. . . . 5 ⊢ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ V
7	3, 6	eqeltrdi 2836	. . . 4 ⊢ (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → 𝑆 ∈ V)
8	7	exlimiv 1930	. . 3 ⊢ (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → 𝑆 ∈ V)
9		eqeq1 2733	. . . . 5 ⊢ (𝑥 = 𝑆 → (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) ↔ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
10	9	anbi2d 630	. . . 4 ⊢ (𝑥 = 𝑆 → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))))
11	10	exbidv 1921	. . 3 ⊢ (𝑥 = 𝑆 → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))))
12	8, 11	elab3 3650	. 2 ⊢ (𝑆 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
13		fneq1 6591	. . . . 5 ⊢ (𝑔 = ℎ → (𝑔 Fn 𝐴 ↔ ℎ Fn 𝐴))
14		fveq1 6839	. . . . . . 7 ⊢ (𝑔 = ℎ → (𝑔‘𝑦) = (ℎ‘𝑦))
15	14	eleq1d 2813	. . . . . 6 ⊢ (𝑔 = ℎ → ((𝑔‘𝑦) ∈ (𝐹‘𝑦) ↔ (ℎ‘𝑦) ∈ (𝐹‘𝑦)))
16	15	ralbidv 3156	. . . . 5 ⊢ (𝑔 = ℎ → (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ↔ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦)))
17	14	eqeq1d 2731	. . . . . . 7 ⊢ (𝑔 = ℎ → ((𝑔‘𝑦) = ∪ (𝐹‘𝑦) ↔ (ℎ‘𝑦) = ∪ (𝐹‘𝑦)))
18	17	rexralbidv 3201	. . . . . 6 ⊢ (𝑔 = ℎ → (∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)))
19		difeq2 4079	. . . . . . . 8 ⊢ (𝑧 = 𝑤 → (𝐴 ∖ 𝑧) = (𝐴 ∖ 𝑤))
20	19	raleqdv 3296	. . . . . . 7 ⊢ (𝑧 = 𝑤 → (∀𝑦 ∈ (𝐴 ∖ 𝑧)(ℎ‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)))
21	20	cbvrexvw 3214	. . . . . 6 ⊢ (∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(ℎ‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦))
22	18, 21	bitrdi 287	. . . . 5 ⊢ (𝑔 = ℎ → (∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)))
23	13, 16, 22	3anbi123d 1438	. . . 4 ⊢ (𝑔 = ℎ → ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ↔ (ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦))))
24	14	ixpeq2dv 8863	. . . . 5 ⊢ (𝑔 = ℎ → X𝑦 ∈ 𝐴 (𝑔‘𝑦) = X𝑦 ∈ 𝐴 (ℎ‘𝑦))
25	24	eqeq2d 2740	. . . 4 ⊢ (𝑔 = ℎ → (𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) ↔ 𝑆 = X𝑦 ∈ 𝐴 (ℎ‘𝑦)))
26	23, 25	anbi12d 632	. . 3 ⊢ (𝑔 = ℎ → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (ℎ‘𝑦))))
27	26	cbvexvw 2037	. 2 ⊢ (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ∃ℎ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (ℎ‘𝑦)))
28	2, 12, 27	3bitri 297	1 ⊢ (𝑆 ∈ 𝐵 ↔ ∃ℎ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑆 = X𝑦 ∈ 𝐴 (ℎ‘𝑦)))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707  ∀wral 3044  ∃wrex 3053  Vcvv 3444   ∖ cdif 3908  ∪ cuni 4867   Fn wfn 6494  ‘cfv 6499  Xcixp 8847  Fincfn 8895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-fv 6507  df-ixp 8848

This theorem is referenced by:  elptr  23436  ptbasin  23440  ptbasfi  23444  ptrecube  37587