| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sshauslem | Structured version Visualization version GIF version | ||
| Description: Lemma for sshaus 23693 and similar theorems. If the topological property 𝐴 is preserved under injective preimages, then a topology finer than one with property 𝐴 also has property 𝐴. (Contributed by Mario Carneiro, 25-Aug-2015.) |
| Ref | Expression |
|---|---|
| t1sep.1 | ⊢ 𝑋 = ∪ 𝐽 |
| sshauslem.2 | ⊢ (𝐽 ∈ 𝐴 → 𝐽 ∈ Top) |
| sshauslem.3 | ⊢ ((𝐽 ∈ 𝐴 ∧ ( I ↾ 𝑋):𝑋–1-1→𝑋 ∧ ( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽)) → 𝐾 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| sshauslem | ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐽 ∈ 𝐴) | |
| 2 | f1oi 6863 | . . 3 ⊢ ( I ↾ 𝑋):𝑋–1-1-onto→𝑋 | |
| 3 | f1of1 6823 | . . 3 ⊢ (( I ↾ 𝑋):𝑋–1-1-onto→𝑋 → ( I ↾ 𝑋):𝑋–1-1→𝑋) | |
| 4 | 2, 3 | mp1i 14 | . 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → ( I ↾ 𝑋):𝑋–1-1→𝑋) |
| 5 | simp3 1156 | . . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐽 ⊆ 𝐾) | |
| 6 | simp2 1155 | . . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ (TopOn‘𝑋)) | |
| 7 | sshauslem.2 | . . . . . 6 ⊢ (𝐽 ∈ 𝐴 → 𝐽 ∈ Top) | |
| 8 | 7 | 3ad2ant1 1151 | . . . . 5 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐽 ∈ Top) |
| 9 | t1sep.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
| 10 | 9 | toptopon 23235 | . . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋)) |
| 11 | 8, 10 | sylib 221 | . . . 4 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐽 ∈ (TopOn‘𝑋)) |
| 12 | ssidcn 23573 | . . . 4 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽) ↔ 𝐽 ⊆ 𝐾)) | |
| 13 | 6, 11, 12 | syl2anc 596 | . . 3 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽) ↔ 𝐽 ⊆ 𝐾)) |
| 14 | 5, 13 | mpbird 260 | . 2 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → ( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽)) |
| 15 | sshauslem.3 | . 2 ⊢ ((𝐽 ∈ 𝐴 ∧ ( I ↾ 𝑋):𝑋–1-1→𝑋 ∧ ( I ↾ 𝑋) ∈ (𝐾 Cn 𝐽)) → 𝐾 ∈ 𝐴) | |
| 16 | 1, 4, 14, 15 | syl3anc 1398 | 1 ⊢ ((𝐽 ∈ 𝐴 ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ∪ cuni 4866 I cid 5544 ↾ cres 5652 –1-1→wf1 6535 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7420 Topctop 23211 TopOnctopon 23228 Cn ccn 23542 |
| 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-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-map 8849 df-top 23212 df-topon 23229 df-cn 23545 |
| This theorem is used by: sst0 23691 sst1 23692 sshaus 23693 |
| Copyright terms: Public domain | W3C validator |