![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > resex | GIF version |
Description: The restriction of a set is a set. (Contributed by Jeff Madsen, 19-Jun-2011.) |
Ref | Expression |
---|---|
resex.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
resex | ⊢ (𝐴 ↾ 𝐵) ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resex.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | resexg 4650 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ↾ 𝐵) ∈ V) | |
3 | 1, 2 | ax-mp 7 | 1 ⊢ (𝐴 ↾ 𝐵) ∈ V |
Colors of variables: wff set class |
Syntax hints: ∈ wcel 1393 Vcvv 2557 ↾ cres 4347 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-v 2559 df-in 2924 df-ss 2931 df-res 4357 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |