| 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 8992 | . . 3 ⊢ {𝑌} ∈ Fin | |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝜑 → {𝑌} ∈ Fin) |
| 5 | ptopn2.o | . . . . . 6 ⊢ (𝜑 → 𝑂 ∈ (𝐹‘𝑌)) | |
| 6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑂 ∈ (𝐹‘𝑌)) |
| 7 | fveq2 6842 | . . . . . 6 ⊢ (𝑘 = 𝑌 → (𝐹‘𝑘) = (𝐹‘𝑌)) | |
| 8 | 7 | eleq2d 2823 | . . . . 5 ⊢ (𝑘 = 𝑌 → (𝑂 ∈ (𝐹‘𝑘) ↔ 𝑂 ∈ (𝐹‘𝑌))) |
| 9 | 6, 8 | syl5ibrcom 247 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝑘 = 𝑌 → 𝑂 ∈ (𝐹‘𝑘))) |
| 10 | 9 | imp 406 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝑘 = 𝑌) → 𝑂 ∈ (𝐹‘𝑘)) |
| 11 | 2 | ffvelcdmda 7038 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ Top) |
| 12 | eqid 2737 | . . . . . 6 ⊢ ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝑘) | |
| 13 | 12 | topopn 22862 | . . . . 5 ⊢ ((𝐹‘𝑘) ∈ Top → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 14 | 11, 13 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 15 | 14 | adantr 480 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝑘 = 𝑌) → ∪ (𝐹‘𝑘) ∈ (𝐹‘𝑘)) |
| 16 | 10, 15 | ifclda 4517 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (𝐹‘𝑘)) |
| 17 | eldifn 4086 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 ∈ {𝑌}) | |
| 18 | velsn 4598 | . . . . 5 ⊢ (𝑘 ∈ {𝑌} ↔ 𝑘 = 𝑌) | |
| 19 | 17, 18 | sylnib 328 | . . . 4 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → ¬ 𝑘 = 𝑌) |
| 20 | 19 | iffalsed 4492 | . . 3 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑌}) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 21 | 20 | adantl 481 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝑌})) → if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)) |
| 22 | 1, 2, 4, 16, 21 | ptopn 23539 | 1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 if(𝑘 = 𝑌, 𝑂, ∪ (𝐹‘𝑘)) ∈ (∏t‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3900 ifcif 4481 {csn 4582 ∪ cuni 4865 ⟶wf 6496 ‘cfv 6500 Xcixp 8847 Fincfn 8895 ∏tcpt 17370 Topctop 22849 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-om 7819 df-1o 8407 df-2o 8408 df-ixp 8848 df-en 8896 df-fin 8899 df-fi 9326 df-topgen 17375 df-pt 17376 df-top 22850 df-bases 22902 |
| This theorem is referenced by: ptcld 23569 |
| Copyright terms: Public domain | W3C validator |