| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elmapssres | GIF version | ||
| Description: A restricted mapping is a mapping. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Mario Carneiro, 5-May-2015.) |
| Ref | Expression |
|---|---|
| elmapssres | ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 𝐶) ∧ 𝐷 ⊆ 𝐶) → (𝐴 ↾ 𝐷) ∈ (𝐵 ↑𝑚 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elmapi 6882 | . . 3 ⊢ (𝐴 ∈ (𝐵 ↑𝑚 𝐶) → 𝐴:𝐶⟶𝐵) | |
| 2 | fssres 5520 | . . 3 ⊢ ((𝐴:𝐶⟶𝐵 ∧ 𝐷 ⊆ 𝐶) → (𝐴 ↾ 𝐷):𝐷⟶𝐵) | |
| 3 | 1, 2 | sylan 283 | . 2 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 𝐶) ∧ 𝐷 ⊆ 𝐶) → (𝐴 ↾ 𝐷):𝐷⟶𝐵) |
| 4 | elmapex 6881 | . . . . 5 ⊢ (𝐴 ∈ (𝐵 ↑𝑚 𝐶) → (𝐵 ∈ V ∧ 𝐶 ∈ V)) | |
| 5 | 4 | simpld 112 | . . . 4 ⊢ (𝐴 ∈ (𝐵 ↑𝑚 𝐶) → 𝐵 ∈ V) |
| 6 | 5 | adantr 276 | . . 3 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 𝐶) ∧ 𝐷 ⊆ 𝐶) → 𝐵 ∈ V) |
| 7 | 4 | simprd 114 | . . . 4 ⊢ (𝐴 ∈ (𝐵 ↑𝑚 𝐶) → 𝐶 ∈ V) |
| 8 | ssexg 4233 | . . . . 5 ⊢ ((𝐷 ⊆ 𝐶 ∧ 𝐶 ∈ V) → 𝐷 ∈ V) | |
| 9 | 8 | ancoms 268 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐷 ⊆ 𝐶) → 𝐷 ∈ V) |
| 10 | 7, 9 | sylan 283 | . . 3 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 𝐶) ∧ 𝐷 ⊆ 𝐶) → 𝐷 ∈ V) |
| 11 | 6, 10 | elmapd 6874 | . 2 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 𝐶) ∧ 𝐷 ⊆ 𝐶) → ((𝐴 ↾ 𝐷) ∈ (𝐵 ↑𝑚 𝐷) ↔ (𝐴 ↾ 𝐷):𝐷⟶𝐵)) |
| 12 | 3, 11 | mpbird 167 | 1 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 𝐶) ∧ 𝐷 ⊆ 𝐶) → (𝐴 ↾ 𝐷) ∈ (𝐵 ↑𝑚 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2202 Vcvv 2803 ⊆ wss 3201 ↾ cres 4733 ⟶wf 5329 (class class class)co 6028 ↑𝑚 cmap 6860 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-map 6862 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |