MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elptr Structured version   Visualization version   GIF version

Theorem elptr 23397
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.
StepHypRef Expression
1 simp2l 1198 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → 𝐺 Fn 𝐴)
2 simp1 1135 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → 𝐴𝑉)
31, 2fnexd 7222 . . 3 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → 𝐺 ∈ V)
4 simp2r 1199 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦))
5 difeq2 4116 . . . . . . 7 (𝑤 = 𝑊 → (𝐴𝑤) = (𝐴𝑊))
65raleqdv 3324 . . . . . 6 (𝑤 = 𝑊 → (∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦) ↔ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦)))
76rspcev 3612 . . . . 5 ((𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦)) → ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))
873ad2ant3 1134 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))
91, 4, 83jca 1127 . . 3 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦)))
10 fveq1 6890 . . . . . . 7 ( = 𝐺 → (𝑦) = (𝐺𝑦))
1110eqcomd 2737 . . . . . 6 ( = 𝐺 → (𝐺𝑦) = (𝑦))
1211ixpeq2dv 8913 . . . . 5 ( = 𝐺X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦))
1312biantrud 531 . . . 4 ( = 𝐺 → (( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ↔ (( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦))))
14 fneq1 6640 . . . . 5 ( = 𝐺 → ( Fn 𝐴𝐺 Fn 𝐴))
1510eleq1d 2817 . . . . . 6 ( = 𝐺 → ((𝑦) ∈ (𝐹𝑦) ↔ (𝐺𝑦) ∈ (𝐹𝑦)))
1615ralbidv 3176 . . . . 5 ( = 𝐺 → (∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ↔ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)))
1710eqeq1d 2733 . . . . . 6 ( = 𝐺 → ((𝑦) = (𝐹𝑦) ↔ (𝐺𝑦) = (𝐹𝑦)))
1817rexralbidv 3219 . . . . 5 ( = 𝐺 → (∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦) ↔ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦)))
1914, 16, 183anbi123d 1435 . . . 4 ( = 𝐺 → (( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ↔ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))))
2013, 19bitr3d 281 . . 3 ( = 𝐺 → ((( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦)) ↔ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))))
213, 9, 20spcedv 3588 . 2 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → ∃(( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦)))
22 ptbas.1 . . 3 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))}
2322elpt 23396 . 2 (X𝑦𝐴 (𝐺𝑦) ∈ 𝐵 ↔ ∃(( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦)))
2421, 23sylibr 233 1 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → X𝑦𝐴 (𝐺𝑦) ∈ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wex 1780  wcel 2105  {cab 2708  wral 3060  wrex 3069  Vcvv 3473  cdif 3945   cuni 4908   Fn wfn 6538  cfv 6543  Xcixp 8897  Fincfn 8945
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ixp 8898
This theorem is referenced by:  elptr2  23398
  Copyright terms: Public domain W3C validator