| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ptopn2 | Structured version Visualization version GIF version | ||
| Description: A sub-basic open set in the product topology. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
| Ref | Expression |
|---|---|
| ptopn2.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ptopn2.f | ⊢ (𝜑 → 𝐹:𝐴⟶Top) |
| ptopn2.o | ⊢ (𝜑 → 𝑂 ∈ (𝐹‘𝑌)) |
| Ref | Expression |
|---|---|
| ptopn2 | ⊢ (𝜑 → X𝑘 ∈ 𝐴 if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (∏t‘𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ptopn2.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 2 | ptopn2.f | . 2 ⊢ (𝜑 → 𝐹:𝐴⟶Top) | |
| 3 | snfi 9079 | . . 3 ⊢ {𝑌} ∈ Fin | |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → {𝑌} ∈ Fin) |
| 5 | ptopn2.o | . . . . . 6 ⊢ (𝜑 → 𝑂 ∈ (𝐹‘𝑌)) | |
| 6 | 5 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑂 ∈ (𝐹‘𝑌)) |
| 7 | fveq2 6890 | . . . . . 6 ⊢ (𝑘 = 𝑌 → (𝐹‘𝑘) = (𝐹‘𝑌)) | |
| 8 | 7 | eleq2d 2846 | . . . . 5 ⊢ (𝑘 = 𝑌 → (𝑂 ∈ (𝐹‘𝑘) ↔ 𝑂 ∈ (𝐹‘𝑌))) |
| 9 | 6, 8 | syl5ibrcom 250 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑘 = 𝑌 → 𝑂 ∈ (𝐹‘𝑘))) |
| 10 | 9 | imp 412 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑘 = 𝑌) → 𝑂 ∈ (𝐹‘𝑘)) |
| 11 | 2 | ffvelcdmda 7089 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ Top) |
| 12 | eqid 2760 | . . . . . 6 ⊢ ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝑘) | |
| 13 | 12 | topopn 23233 | . . . . 5 ⊢ ((𝐹‘𝑘) ∈ Top → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 14 | 11, 13 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 15 | 14 | adantr 486 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 = 𝑌) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 16 | 10, 15 | ifclda 4517 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (𝐹‘𝑘)) |
| 17 | eldifn 4067 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 ∈ {𝑌}) | |
| 18 | velsn 4596 | . . . . 5 ⊢ (𝑘 ∈ {𝑌} ↔ 𝑘 = 𝑌) | |
| 19 | 17, 18 | sylnib 331 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 = 𝑌) |
| 20 | 19 | iffalsed 4492 | . . 3 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 21 | 20 | adantl 487 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝑌})) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 22 | 1, 2, 4, 16, 21 | ptopn 23911 | 1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (∏t‘𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∖ cdif 4044 ifcif 4481 {csn 4584 ∪ cuni 4866 ⟶wf 6539 ‘cfv 6543 Xcixp 8933 Fincfn 8981 ∏tcpt 17618 Topctop 23220 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 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 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-om 7882 df-1o 8484 df-2o 8485 df-ixp 8934 df-en 8982 df-fin 8985 df-fi 9410 df-topgen 17623 df-pt 17624 df-top 23221 df-bases 23273 |
| This theorem is used by: ptcld 23941 |
| Copyright terms: Public domain | W3C validator |