| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > restsspw | Structured version Visualization version GIF version | ||
| Description: The subspace topology is a collection of subsets of the restriction set. (Contributed by Mario Carneiro, 13-Aug-2015.) |
| Ref | Expression |
|---|---|
| restsspw | ⊢ (𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0i 4286 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ¬ (𝐽 ↾t 𝐴) = ∅) | |
| 2 | restfn 17509 | . . . . . . . . 9 ⊢ ↾t Fn (V × V) | |
| 3 | fndm 6635 | . . . . . . . . 9 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . . . 8 ⊢ dom ↾t = (V × V) |
| 5 | 4 | ndmov 7598 | . . . . . . 7 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
| 6 | 1, 5 | nsyl2 142 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
| 7 | elrest 17512 | . . . . . 6 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) |
| 9 | 8 | ibi 270 | . . . 4 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴)) |
| 10 | inss2 4183 | . . . . . 6 ⊢ (𝑦 ∩ 𝐴) ⊆ 𝐴 | |
| 11 | sseq1 3956 | . . . . . 6 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∩ 𝐴) ⊆ 𝐴)) | |
| 12 | 10, 11 | mpbiri 261 | . . . . 5 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 13 | 12 | rexlimivw 3159 | . . . 4 ⊢ (∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 14 | 9, 13 | syl 18 | . . 3 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ⊆ 𝐴) |
| 15 | velpw 4562 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴) | |
| 16 | 14, 15 | sylibr 237 | . 2 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ∈ 𝒫 𝐴) |
| 17 | 16 | ssriv 3935 | 1 ⊢ (𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 Vcvv 3450 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 × cxp 5653 dom cdm 5655 Fn wfn 6528 (class class class)co 7413 ↾t crest 17505 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-rest 17507 |
| This theorem is used by: 1stckgenlem 23779 prdstopn 23854 trfbas2 24069 trfil1 24112 trfil2 24113 fgtr 24116 trust 24455 zdis 25043 cnambfre 38417 dvdmsscn 46764 dvnmptconst 46769 dvnxpaek 46770 dvnmul 46771 dvnprodlem3 46776 |
| Copyright terms: Public domain | W3C validator |