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

Theorem ptbasin2 23890
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 23889 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 ∩ 𝑣) ∈ 𝐵)
32ralrimivva 3206 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵)
41ptuni2 23888 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐵)
5 ixpexg 8943 . . . . . 6 (∀𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V)
6 fvex 6896 . . . . . . . 8 (𝐹‘𝑘) ∈ V
76uniex 7756 . . . . . . 7 ∪ (𝐹‘𝑘) ∈ V
87a1i 11 . . . . . 6 (𝑘 ∈ 𝐴 → ∪ (𝐹‘𝑘) ∈ V)
95, 8mprg 3083 . . . . 5 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V
104, 9eqeltrrdi 2870 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∪ 𝐵 ∈ V)
11 uniexb 7776 . . . 4 (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V)
1210, 11sylibr 237 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐵 ∈ V)
13 inficl 9410 . . 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 2145  {cab 2739  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ∖ cdif 3896   ∩ cin 3898  ∪ cuni 4867   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  Xcixp 8918  Fincfn 8966  ficfi 9395  Topctop 23204
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-om 7876  df-1o 8469  df-2o 8470  df-ixp 8919  df-en 8967  df-fin 8970  df-fi 9396  df-top 23205
This theorem is used by:  ptbas  23891  ptbasfi  23893
  Copyright terms: Public domain W3C validator