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

Theorem elptr 23581
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 1200 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → 𝐺 Fn 𝐴)
2 simp1 1137 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → 𝐴𝑉)
31, 2fnexd 7238 . . 3 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → 𝐺 ∈ V)
4 simp2r 1201 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦))
5 difeq2 4120 . . . . . . 7 (𝑤 = 𝑊 → (𝐴𝑤) = (𝐴𝑊))
65raleqdv 3326 . . . . . 6 (𝑤 = 𝑊 → (∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦) ↔ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦)))
76rspcev 3622 . . . . 5 ((𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦)) → ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))
873ad2ant3 1136 . . . 4 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))
91, 4, 83jca 1129 . . 3 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦)))
10 fveq1 6905 . . . . . . 7 ( = 𝐺 → (𝑦) = (𝐺𝑦))
1110eqcomd 2743 . . . . . 6 ( = 𝐺 → (𝐺𝑦) = (𝑦))
1211ixpeq2dv 8953 . . . . 5 ( = 𝐺X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦))
1312biantrud 531 . . . 4 ( = 𝐺 → (( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ↔ (( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦))))
14 fneq1 6659 . . . . 5 ( = 𝐺 → ( Fn 𝐴𝐺 Fn 𝐴))
1510eleq1d 2826 . . . . . 6 ( = 𝐺 → ((𝑦) ∈ (𝐹𝑦) ↔ (𝐺𝑦) ∈ (𝐹𝑦)))
1615ralbidv 3178 . . . . 5 ( = 𝐺 → (∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ↔ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)))
1710eqeq1d 2739 . . . . . 6 ( = 𝐺 → ((𝑦) = (𝐹𝑦) ↔ (𝐺𝑦) = (𝐹𝑦)))
1817rexralbidv 3223 . . . . 5 ( = 𝐺 → (∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦) ↔ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦)))
1914, 16, 183anbi123d 1438 . . . 4 ( = 𝐺 → (( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ↔ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))))
2013, 19bitr3d 281 . . 3 ( = 𝐺 → ((( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦)) ↔ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝐺𝑦) = (𝐹𝑦))))
213, 9, 20spcedv 3598 . 2 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → ∃(( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦)))
22 ptbas.1 . . 3 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))}
2322elpt 23580 . 2 (X𝑦𝐴 (𝐺𝑦) ∈ 𝐵 ↔ ∃(( Fn 𝐴 ∧ ∀𝑦𝐴 (𝑦) ∈ (𝐹𝑦) ∧ ∃𝑤 ∈ Fin ∀𝑦 ∈ (𝐴𝑤)(𝑦) = (𝐹𝑦)) ∧ X𝑦𝐴 (𝐺𝑦) = X𝑦𝐴 (𝑦)))
2421, 23sylibr 234 1 ((𝐴𝑉 ∧ (𝐺 Fn 𝐴 ∧ ∀𝑦𝐴 (𝐺𝑦) ∈ (𝐹𝑦)) ∧ (𝑊 ∈ Fin ∧ ∀𝑦 ∈ (𝐴𝑊)(𝐺𝑦) = (𝐹𝑦))) → X𝑦𝐴 (𝐺𝑦) ∈ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1540  wex 1779  wcel 2108  {cab 2714  wral 3061  wrex 3070  Vcvv 3480  cdif 3948   cuni 4907   Fn wfn 6556  cfv 6561  Xcixp 8937  Fincfn 8985
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ixp 8938
This theorem is referenced by:  elptr2  23582
  Copyright terms: Public domain W3C validator