| 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 4289 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ¬ (𝐽 ↾t 𝐴) = ∅) | |
| 2 | restfn 17645 | . . . . . . . . 9 ⊢ ↾t Fn (V × V) | |
| 3 | fndm 6672 | . . . . . . . . 9 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . . . 8 ⊢ dom ↾t = (V × V) |
| 5 | 4 | ndmov 7637 | . . . . . . 7 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
| 6 | 1, 5 | nsyl2 142 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
| 7 | elrest 17648 | . . . . . 6 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) |
| 9 | 8 | ibi 270 | . . . 4 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴)) |
| 10 | inss2 4137 | . . . . . 6 ⊢ (𝑦 ∩ 𝐴) ⊆ 𝐴 | |
| 11 | sseq1 3938 | . . . . . 6 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∩ 𝐴) ⊆ 𝐴)) | |
| 12 | 10, 11 | mpbiri 261 | . . . . 5 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 13 | 12 | rexlimivw 3163 | . . . 4 ⊢ (∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 14 | 9, 13 | syl 18 | . . 3 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ⊆ 𝐴) |
| 15 | velpw 4565 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴) | |
| 16 | 14, 15 | sylibr 237 | . 2 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ∈ 𝒫 𝐴) |
| 17 | 16 | ssriv 3917 | 1 ⊢ (𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 𝒫 cpw 4560 × cxp 5656 dom cdm 5658 Fn wfn 6561 (class class class)co 7451 ↾t crest 17641 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| 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 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-csb 3852 df-ss 3901 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-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 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-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-rest 17643 |
| This theorem is used by: 1stckgenlem 23927 prdstopn 24002 trfbas2 24217 trfil1 24260 trfil2 24261 fgtr 24264 trust 24603 zdis 25191 cnambfre 38854 dvdmsscn 47219 dvnmptconst 47224 dvnxpaek 47225 dvnmul 47226 dvnprodlem3 47231 |
| Copyright terms: Public domain | W3C validator |