Theorem elptr 23486

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

Hypothesis

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

Assertion

Ref	Expression
elptr	⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → X𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ 𝐵)

Distinct variable groups:   𝑥,𝑔,𝑦,𝐺   𝑧,𝑔,𝐴,𝑥,𝑦   𝑔,𝐹,𝑥,𝑦,𝑧   𝑔,𝑉,𝑥,𝑦,𝑧   𝑦,𝑊

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

Proof of Theorem elptr

Dummy variables ℎ 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp2l 1200	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → 𝐺 Fn 𝐴)
2		simp1 1136	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → 𝐴 ∈ 𝑉)
3	1, 2	fnexd 7152	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → 𝐺 ∈ V)
4		simp2r 1201	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦))
5		difeq2 4070	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝑊))
6	5	raleqdv 3292	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦)))
7	6	rspcev 3577	. . . . 5 ⊢ ((𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦)) → ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))
8	7	3ad2ant3 1135	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))
9	1, 4, 8	3jca 1128	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦)))
10		fveq1 6821	. . . . . . 7 ⊢ (ℎ = 𝐺 → (ℎ‘𝑦) = (𝐺‘𝑦))
11	10	eqcomd 2737	. . . . . 6 ⊢ (ℎ = 𝐺 → (𝐺‘𝑦) = (ℎ‘𝑦))
12	11	ixpeq2dv 8837	. . . . 5 ⊢ (ℎ = 𝐺 → X𝑦 ∈ 𝐴 (𝐺‘𝑦) = X𝑦 ∈ 𝐴 (ℎ‘𝑦))
13	12	biantrud 531	. . . 4 ⊢ (ℎ = 𝐺 → ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ↔ ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ X𝑦 ∈ 𝐴 (𝐺‘𝑦) = X𝑦 ∈ 𝐴 (ℎ‘𝑦))))
14		fneq1 6572	. . . . 5 ⊢ (ℎ = 𝐺 → (ℎ Fn 𝐴 ↔ 𝐺 Fn 𝐴))
15	10	eleq1d 2816	. . . . . 6 ⊢ (ℎ = 𝐺 → ((ℎ‘𝑦) ∈ (𝐹‘𝑦) ↔ (𝐺‘𝑦) ∈ (𝐹‘𝑦)))
16	15	ralbidv 3155	. . . . 5 ⊢ (ℎ = 𝐺 → (∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)))
17	10	eqeq1d 2733	. . . . . 6 ⊢ (ℎ = 𝐺 → ((ℎ‘𝑦) = ∪ (𝐹‘𝑦) ↔ (𝐺‘𝑦) = ∪ (𝐹‘𝑦)))
18	17	rexralbidv 3198	. . . . 5 ⊢ (ℎ = 𝐺 → (∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦) ↔ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦)))
19	14, 16, 18	3anbi123d 1438	. . . 4 ⊢ (ℎ = 𝐺 → ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ↔ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))))
20	13, 19	bitr3d 281	. . 3 ⊢ (ℎ = 𝐺 → (((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ X𝑦 ∈ 𝐴 (𝐺‘𝑦) = X𝑦 ∈ 𝐴 (ℎ‘𝑦)) ↔ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))))
21	3, 9, 20	spcedv 3553	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → ∃ℎ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ X𝑦 ∈ 𝐴 (𝐺‘𝑦) = X𝑦 ∈ 𝐴 (ℎ‘𝑦)))
22		ptbas.1	. . 3 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
23	22	elpt 23485	. 2 ⊢ (X𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ 𝐵 ↔ ∃ℎ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑤)(ℎ‘𝑦) = ∪ (𝐹‘𝑦)) ∧ X𝑦 ∈ 𝐴 (𝐺‘𝑦) = X𝑦 ∈ 𝐴 (ℎ‘𝑦)))
24	21, 23	sylibr 234	1 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ (𝐹‘𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑊)(𝐺‘𝑦) = ∪ (𝐹‘𝑦))) → X𝑦 ∈ 𝐴 (𝐺‘𝑦) ∈ 𝐵)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541  ∃wex 1780   ∈ wcel 2111  {cab 2709  ∀wral 3047  ∃wrex 3056  Vcvv 3436   ∖ cdif 3899  ∪ cuni 4859   Fn wfn 6476  ‘cfv 6481  Xcixp 8821  Fincfn 8869

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ixp 8822

This theorem is referenced by:  elptr2  23487