| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ptbasin2 | Structured version Visualization version GIF version | ||
| Description: The basis for a product topology is closed under intersections. (Contributed by Mario Carneiro, 19-Mar-2015.) |
| Ref | Expression |
|---|---|
| ptbas.1 | ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} |
| Ref | Expression |
|---|---|
| ptbasin2 | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (fi‘𝐵) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ptbas.1 | . . . 4 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} | |
| 2 | 1 | ptbasin 23803 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 ∩ 𝑣) ∈ 𝐵) |
| 3 | 2 | ralrimivva 3205 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵) |
| 4 | 1 | ptuni2 23802 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐵) |
| 5 | ixpexg 8929 | . . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V) | |
| 6 | fvex 6891 | . . . . . . . 8 ⊢ (𝐹‘𝑘) ∈ V | |
| 7 | 6 | uniex 7743 | . . . . . . 7 ⊢ ∪ (𝐹‘𝑘) ∈ V |
| 8 | 7 | a1i 11 | . . . . . 6 ⊢ (𝑘 ∈ 𝐴 → ∪ (𝐹‘𝑘) ∈ V) |
| 9 | 5, 8 | mprg 3082 | . . . . 5 ⊢ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V |
| 10 | 4, 9 | eqeltrrdi 2869 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∪ 𝐵 ∈ V) |
| 11 | uniexb 7763 | . . . 4 ⊢ (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V) | |
| 12 | 10, 11 | sylibr 237 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐵 ∈ V) |
| 13 | inficl 9395 | . . 3 ⊢ (𝐵 ∈ V → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵 ↔ (fi‘𝐵) = 𝐵)) | |
| 14 | 12, 13 | syl 18 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵 ↔ (fi‘𝐵) = 𝐵)) |
| 15 | 3, 14 | mpbid 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 2738 ∀wral 3076 ∃wrex 3086 Vcvv 3450 ∖ cdif 3896 ∩ cin 3898 ∪ cuni 4867 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 Xcixp 8904 Fincfn 8952 ficfi 9380 Topctop 23118 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-om 7863 df-1o 8455 df-2o 8456 df-ixp 8905 df-en 8953 df-fin 8956 df-fi 9381 df-top 23119 |
| This theorem is used by: ptbas 23805 ptbasfi 23807 |
| Copyright terms: Public domain | W3C validator |