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

Theorem ptbasin2 23952
Description: The basis for a product topology is closed under intersections. (Contributed by Mario Carneiro, 19-Mar-2015.)
Hypothesis
Ref Expression
ptbas.1 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
Assertion
Ref Expression
ptbasin2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (fi‘𝐵) = 𝐵)
Distinct variable groups:   𝑥,𝑔,𝑦,𝑧,𝐴   𝑔,𝐹,𝑥,𝑦,𝑧   𝑔,𝑉,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐵(𝑥, 𝑦, 𝑧, 𝑔)

Proof of Theorem ptbasin2
Dummy variables 𝑘 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ptbas.1 . . . 4 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
21ptbasin 23951 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 ∩ 𝑣) ∈ 𝐵)
32ralrimivva 3209 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵)
41ptuni2 23950 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐵)
5 ixpexg 8988 . . . . . 6 (∀𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V)
6 fvex 6929 . . . . . . . 8 (𝐹‘𝑘) ∈ V
76uniex 7790 . . . . . . 7 ∪ (𝐹‘𝑘) ∈ V
87a1i 11 . . . . . 6 (𝑘 ∈ 𝐴 → ∪ (𝐹‘𝑘) ∈ V)
95, 8mprg 3086 . . . . 5 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V
104, 9eqeltrrdi 2873 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∪ 𝐵 ∈ V)
11 uniexb 7810 . . . 4 (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V)
1210, 11sylibr 237 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐵 ∈ V)
13 inficl 9454 . . 3 (𝐵 ∈ V → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵 ↔ (fi‘𝐵) = 𝐵))
1412, 13syl 18 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵 ↔ (fi‘𝐵) = 𝐵))
153, 14mpbid 235 1 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (fi‘𝐵) = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092  ∪ cuni 4872   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  Xcixp 8963  Fincfn 9011  ficfi 9439  Topctop 23266
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-om 7912  df-1o 8514  df-2o 8515  df-ixp 8964  df-en 9012  df-fin 9015  df-fi 9440  df-top 23267
This theorem is used by:  ptbas  23953  ptbasfi  23955
  Copyright terms: Public domain W3C validator