| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > riinopn | Structured version Visualization version GIF version | ||
| Description: A finite indexed relative intersection of open sets is open. (Contributed by Mario Carneiro, 22-Aug-2015.) |
| Ref | Expression |
|---|---|
| 1open.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| riinopn | ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) ∈ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | riin0 5047 | . . . 4 ⊢ (𝐴 = ∅ → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = 𝑋) | |
| 2 | 1 | adantl 487 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 = ∅) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = 𝑋) |
| 3 | simpl1 1210 | . . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 = ∅) → 𝐽 ∈ Top) | |
| 4 | 1open.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
| 5 | 4 | topopn 23279 | . . . 4 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
| 6 | 3, 5 | syl 18 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 = ∅) → 𝑋 ∈ 𝐽) |
| 7 | 2, 6 | eqeltrd 2864 | . 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 = ∅) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) ∈ 𝐽) |
| 8 | 4 | eltopss 23280 | . . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ∈ 𝐽) → 𝐵 ⊆ 𝑋) |
| 9 | 8 | ex 418 | . . . . . . 7 ⊢ (𝐽 ∈ Top → (𝐵 ∈ 𝐽 → 𝐵 ⊆ 𝑋)) |
| 10 | 9 | adantr 486 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin) → (𝐵 ∈ 𝐽 → 𝐵 ⊆ 𝑋)) |
| 11 | 10 | ralimdv 3180 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin) → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝑋)) |
| 12 | 11 | 3impia 1135 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝑋) |
| 13 | riinn0 5048 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝑋 ∧ 𝐴 ≠ ∅) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = ∩ 𝑥 ∈ 𝐴 𝐵) | |
| 14 | 12, 13 | sylan 592 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 ≠ ∅) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = ∩ 𝑥 ∈ 𝐴 𝐵) |
| 15 | iinopn 23275 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝐴 ∈ Fin ∧ 𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽)) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) | |
| 16 | 15 | 3exp2 1373 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐴 ∈ Fin → (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽)))) |
| 17 | 16 | com34 92 | . . . 4 ⊢ (𝐽 ∈ Top → (𝐴 ∈ Fin → (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽 → (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽)))) |
| 18 | 17 | 3imp1 1366 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) |
| 19 | 14, 18 | eqeltrd 2864 | . 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) ∧ 𝐴 ≠ ∅) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) ∈ 𝐽) |
| 20 | 7, 19 | pm2.61dane 3046 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝐽) → (𝑋 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) ∈ 𝐽) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 ∪ cuni 4872 ∩ ciin 4957 Fincfn 9011 Topctop 23266 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-om 7912 df-1st 8035 df-2nd 8036 df-1o 8514 df-2o 8515 df-en 9012 df-dom 9013 df-fin 9015 df-top 23267 |
| This theorem is used by: rintopn 23282 iuncld 23418 |
| Copyright terms: Public domain | W3C validator |