| 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 4293 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ¬ (𝐽 ↾t 𝐴) = ∅) | |
| 2 | restfn 17494 | . . . . . . . . 9 ⊢ ↾t Fn (V × V) | |
| 3 | fndm 6642 | . . . . . . . . 9 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . . . 8 ⊢ dom ↾t = (V × V) |
| 5 | 4 | ndmov 7600 | . . . . . . 7 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
| 6 | 1, 5 | nsyl2 142 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
| 7 | elrest 17497 | . . . . . 6 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝑥 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴))) |
| 9 | 8 | ibi 270 | . . . 4 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → ∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴)) |
| 10 | inss2 4190 | . . . . . 6 ⊢ (𝑦 ∩ 𝐴) ⊆ 𝐴 | |
| 11 | sseq1 3963 | . . . . . 6 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∩ 𝐴) ⊆ 𝐴)) | |
| 12 | 10, 11 | mpbiri 261 | . . . . 5 ⊢ (𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 13 | 12 | rexlimivw 3164 | . . . 4 ⊢ (∃𝑦 ∈ 𝐽 𝑥 = (𝑦 ∩ 𝐴) → 𝑥 ⊆ 𝐴) |
| 14 | 9, 13 | syl 18 | . . 3 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ⊆ 𝐴) |
| 15 | velpw 4569 | . . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴) | |
| 16 | 14, 15 | sylibr 237 | . 2 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → 𝑥 ∈ 𝒫 𝐴) |
| 17 | 16 | ssriv 3942 | 1 ⊢ (𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 Vcvv 3457 ∩ cin 3905 ⊆ wss 3906 ∅c0 4286 𝒫 cpw 4564 × cxp 5661 dom cdm 5663 Fn wfn 6535 (class class class)co 7416 ↾t crest 17490 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7738 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-rest 17492 |
| This theorem is used by: 1stckgenlem 23739 prdstopn 23814 trfbas2 24029 trfil1 24072 trfil2 24073 fgtr 24076 trust 24415 zdis 25003 cnambfre 38352 dvdmsscn 46683 dvnmptconst 46688 dvnxpaek 46689 dvnmul 46690 dvnprodlem3 46695 |
| Copyright terms: Public domain | W3C validator |