| 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 8980 | . . 3 ⊢ {𝑌} ∈ Fin | |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → {𝑌} ∈ Fin) |
| 5 | ptopn2.o | . . . . . 6 ⊢ (𝜑 → 𝑂 ∈ (𝐹‘𝑌)) | |
| 6 | 5 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑂 ∈ (𝐹‘𝑌)) |
| 7 | fveq2 6827 | . . . . . 6 ⊢ (𝑘 = 𝑌 → (𝐹‘𝑘) = (𝐹‘𝑌)) | |
| 8 | 7 | eleq2d 2825 | . . . . 5 ⊢ (𝑘 = 𝑌 → (𝑂 ∈ (𝐹‘𝑘) ↔ 𝑂 ∈ (𝐹‘𝑌))) |
| 9 | 6, 8 | syl5ibrcom 248 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑘 = 𝑌 → 𝑂 ∈ (𝐹‘𝑘))) |
| 10 | 9 | imp 407 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑘 = 𝑌) → 𝑂 ∈ (𝐹‘𝑘)) |
| 11 | 2 | ffvelcdmda 7025 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ Top) |
| 12 | eqid 2739 | . . . . . 6 ⊢ ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝑘) | |
| 13 | 12 | topopn 22889 | . . . . 5 ⊢ ((𝐹‘𝑘) ∈ Top → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 14 | 11, 13 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 15 | 14 | adantr 481 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 = 𝑌) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 16 | 10, 15 | ifclda 4490 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (𝐹‘𝑘)) |
| 17 | eldifn 4062 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 ∈ {𝑌}) | |
| 18 | velsn 4571 | . . . . 5 ⊢ (𝑘 ∈ {𝑌} ↔ 𝑘 = 𝑌) | |
| 19 | 17, 18 | sylnib 329 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 = 𝑌) |
| 20 | 19 | iffalsed 4465 | . . 3 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 21 | 20 | adantl 482 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝑌})) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 22 | 1, 2, 4, 16, 21 | ptopn 23566 | 1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (∏t‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∖ cdif 3880 ifcif 4454 {csn 4555 ∪ cuni 4838 ⟶wf 6481 ‘cfv 6485 Xcixp 8835 Fincfn 8883 ∏tcpt 17392 Topctop 22876 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-om 7807 df-1o 8395 df-2o 8396 df-ixp 8836 df-en 8884 df-fin 8887 df-fi 9314 df-topgen 17397 df-pt 17398 df-top 22877 df-bases 22929 |
| This theorem is referenced by: ptcld 23596 |
| Copyright terms: Public domain | W3C validator |