| 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 9036 | . . 3 ⊢ {𝑌} ∈ Fin | |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → {𝑌} ∈ Fin) |
| 5 | ptopn2.o | . . . . . 6 ⊢ (𝜑 → 𝑂 ∈ (𝐹‘𝑌)) | |
| 6 | 5 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑂 ∈ (𝐹‘𝑌)) |
| 7 | fveq2 6881 | . . . . . 6 ⊢ (𝑘 = 𝑌 → (𝐹‘𝑘) = (𝐹‘𝑌)) | |
| 8 | 7 | eleq2d 2849 | . . . . 5 ⊢ (𝑘 = 𝑌 → (𝑂 ∈ (𝐹‘𝑘) ↔ 𝑂 ∈ (𝐹‘𝑌))) |
| 9 | 6, 8 | syl5ibrcom 250 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑘 = 𝑌 → 𝑂 ∈ (𝐹‘𝑘))) |
| 10 | 9 | imp 411 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑘 = 𝑌) → 𝑂 ∈ (𝐹‘𝑘)) |
| 11 | 2 | ffvelcdmda 7079 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ Top) |
| 12 | eqid 2763 | . . . . . 6 ⊢ ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝑘) | |
| 13 | 12 | topopn 23063 | . . . . 5 ⊢ ((𝐹‘𝑘) ∈ Top → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 14 | 11, 13 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 15 | 14 | adantr 485 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 = 𝑌) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 16 | 10, 15 | ifclda 4523 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (𝐹‘𝑘)) |
| 17 | eldifn 4086 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 ∈ {𝑌}) | |
| 18 | velsn 4605 | . . . . 5 ⊢ (𝑘 ∈ {𝑌} ↔ 𝑘 = 𝑌) | |
| 19 | 17, 18 | sylnib 331 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 = 𝑌) |
| 20 | 19 | iffalsed 4498 | . . 3 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 21 | 20 | adantl 486 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝑌})) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 22 | 1, 2, 4, 16, 21 | ptopn 23740 | 1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (∏t‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∖ cdif 3902 ifcif 4487 {csn 4589 ∪ cuni 4872 ⟶wf 6532 ‘cfv 6536 Xcixp 8891 Fincfn 8939 ∏tcpt 17486 Topctop 23050 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-om 7859 df-1o 8449 df-2o 8450 df-ixp 8892 df-en 8940 df-fin 8943 df-fi 9367 df-topgen 17491 df-pt 17492 df-top 23051 df-bases 23103 |
| This theorem is referenced by: ptcld 23770 |
| Copyright terms: Public domain | W3C validator |