| 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 17588 | . . . . . . . . 9 ⊢ ↾t Fn (V × V) | |
| 3 | fndm 6640 | . . . . . . . . 9 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . . . 8 ⊢ dom ↾t = (V × V) |
| 5 | 4 | ndmov 7603 | . . . . . . 7 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
| 6 | 1, 5 | nsyl2 142 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 ↾t 𝐴) → (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
| 7 | elrest 17591 | . . . . . 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 3160 | . . . 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 3087 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 × cxp 5649 dom cdm 5651 Fn wfn 6532 (class class class)co 7418 ↾t crest 17584 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7749 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7421 df-oprab 7422 df-mpo 7423 df-1st 7999 df-2nd 8000 df-rest 17586 |
| This theorem is used by: 1stckgenlem 23865 prdstopn 23940 trfbas2 24155 trfil1 24198 trfil2 24199 fgtr 24202 trust 24541 zdis 25129 cnambfre 38566 dvdmsscn 46915 dvnmptconst 46920 dvnxpaek 46921 dvnmul 46922 dvnprodlem3 46927 |
| Copyright terms: Public domain | W3C validator |