| 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 4285 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ¬ (𝐽 ↾t 𝐴) = ∅) | |
| 2 | restfn 17601 | . . . . . . . . 9 ⊢ ↾t Fn (V × V) | |
| 3 | fndm 6643 | . . . . . . . . 9 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . . . 8 ⊢ dom ↾t = (V × V) |
| 5 | 4 | ndmov 7606 | . . . . . . 7 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
| 6 | 1, 5 | nsyl2 142 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
| 7 | elrest 17604 | . . . . . 6 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) |
| 9 | 8 | ibi 270 | . . . 4 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴)) |
| 10 | inss2 4134 | . . . . . 6 ⊢ (𝑦 ∩ 𝐴) ⊆ 𝐴 | |
| 11 | sseq1 3933 | . . . . . 6 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∩ 𝐴) ⊆ 𝐴)) | |
| 12 | 10, 11 | mpbiri 261 | . . . . 5 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 13 | 12 | rexlimivw 3159 | . . . 4 ⊢ (∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 14 | 9, 13 | syl 18 | . . 3 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ⊆ 𝐴) |
| 15 | velpw 4561 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴) | |
| 16 | 14, 15 | sylibr 237 | . 2 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ∈ 𝒫 𝐴) |
| 17 | 16 | ssriv 3912 | 1 ⊢ (𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 Vcvv 3450 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 𝒫 cpw 4556 × cxp 5648 dom cdm 5650 Fn wfn 6534 (class class class)co 7421 ↾t crest 17597 |
| 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-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7752 |
| 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 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 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-rest 17599 |
| This theorem is used by: 1stckgenlem 23878 prdstopn 23953 trfbas2 24168 trfil1 24211 trfil2 24212 fgtr 24215 trust 24554 zdis 25142 cnambfre 38680 dvdmsscn 47040 dvnmptconst 47045 dvnxpaek 47046 dvnmul 47047 dvnprodlem3 47052 |
| Copyright terms: Public domain | W3C validator |