| 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 23763 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 ∩ 𝑣) ∈ 𝐵) |
| 3 | 2 | ralrimivva 3210 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ∩ 𝑣) ∈ 𝐵) |
| 4 | 1 | ptuni2 23762 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐵) |
| 5 | ixpexg 8922 | . . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V) | |
| 6 | fvex 6898 | . . . . . . . 8 ⊢ (𝐹‘𝑘) ∈ V | |
| 7 | 6 | uniex 7745 | . . . . . . 7 ⊢ ∪ (𝐹‘𝑘) ∈ V |
| 8 | 7 | a1i 11 | . . . . . 6 ⊢ (𝑘 ∈ 𝐴 → ∪ (𝐹‘𝑘) ∈ V) |
| 9 | 5, 8 | mprg 3087 | . . . . 5 ⊢ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∈ V |
| 10 | 4, 9 | eqeltrrdi 2874 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ∪ 𝐵 ∈ V) |
| 11 | uniexb 7765 | . . . 4 ⊢ (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V) | |
| 12 | 10, 11 | sylibr 237 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐵 ∈ V) |
| 13 | inficl 9388 | . . 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 2146 {cab 2743 ∀wral 3081 ∃wrex 3091 Vcvv 3457 ∖ cdif 3903 ∩ cin 3905 ∪ cuni 4874 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 Xcixp 8897 Fincfn 8945 ficfi 9373 Topctop 23079 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-om 7865 df-1o 8455 df-2o 8456 df-ixp 8898 df-en 8946 df-fin 8949 df-fi 9374 df-top 23080 |
| This theorem is used by: ptbas 23765 ptbasfi 23767 |
| Copyright terms: Public domain | W3C validator |