| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resexd | Structured version Visualization version GIF version | ||
| Description: The restriction of a set is a set. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| resexd.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| resexd | ⊢ (𝜑 → (𝐴 ↾ 𝐵) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resexd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 2 | resexg 5981 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ↾ 𝐵) ∈ V) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝜑 → (𝐴 ↾ 𝐵) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3427 ↾ cres 5622 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 ax-sep 5220 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-3an 1089 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-rab 3388 df-v 3429 df-in 3892 df-ss 3902 df-res 5632 |
| This theorem is referenced by: gsum2dlem2 19935 tsmspropd 24085 ulmss 26350 elrgspnlem4 33294 extvfvcl 33668 esplyind 33707 lmimdim 33736 aks6d1c6lem3 42599 psrbagres 42977 pwssplit4 43505 limsupresre 46112 limsupresico 46116 limsupresuz 46119 limsupres 46121 limsupresxr 46182 liminfresxr 46183 liminfresico 46187 liminfresre 46195 liminfresuz 46200 isubgriedg 48327 isubgrvtx 48331 |
| Copyright terms: Public domain | W3C validator |