Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fvresex | Structured version Visualization version GIF version |
Description: Existence of the class of values of a restricted class. (Contributed by NM, 14-Nov-1995.) (Revised by Mario Carneiro, 11-Sep-2015.) |
Ref | Expression |
---|---|
fvresex.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
fvresex | ⊢ {𝑦 ∣ ∃𝑥 𝑦 = ((𝐹 ↾ 𝐴)‘𝑥)} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssv 3991 | . . . . . . . 8 ⊢ 𝐴 ⊆ V | |
2 | resmpt 5900 | . . . . . . . 8 ⊢ (𝐴 ⊆ V → ((𝑧 ∈ V ↦ (𝐹‘𝑧)) ↾ 𝐴) = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))) | |
3 | 1, 2 | ax-mp 5 | . . . . . . 7 ⊢ ((𝑧 ∈ V ↦ (𝐹‘𝑧)) ↾ 𝐴) = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) |
4 | 3 | fveq1i 6666 | . . . . . 6 ⊢ (((𝑧 ∈ V ↦ (𝐹‘𝑧)) ↾ 𝐴)‘𝑥) = ((𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))‘𝑥) |
5 | fveq2 6665 | . . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥)) | |
6 | eqid 2821 | . . . . . . . . 9 ⊢ (𝑧 ∈ V ↦ (𝐹‘𝑧)) = (𝑧 ∈ V ↦ (𝐹‘𝑧)) | |
7 | fvex 6678 | . . . . . . . . 9 ⊢ (𝐹‘𝑥) ∈ V | |
8 | 5, 6, 7 | fvmpt 6763 | . . . . . . . 8 ⊢ (𝑥 ∈ V → ((𝑧 ∈ V ↦ (𝐹‘𝑧))‘𝑥) = (𝐹‘𝑥)) |
9 | 8 | elv 3500 | . . . . . . 7 ⊢ ((𝑧 ∈ V ↦ (𝐹‘𝑧))‘𝑥) = (𝐹‘𝑥) |
10 | fveqres 6707 | . . . . . . 7 ⊢ (((𝑧 ∈ V ↦ (𝐹‘𝑧))‘𝑥) = (𝐹‘𝑥) → (((𝑧 ∈ V ↦ (𝐹‘𝑧)) ↾ 𝐴)‘𝑥) = ((𝐹 ↾ 𝐴)‘𝑥)) | |
11 | 9, 10 | ax-mp 5 | . . . . . 6 ⊢ (((𝑧 ∈ V ↦ (𝐹‘𝑧)) ↾ 𝐴)‘𝑥) = ((𝐹 ↾ 𝐴)‘𝑥) |
12 | 4, 11 | eqtr3i 2846 | . . . . 5 ⊢ ((𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))‘𝑥) = ((𝐹 ↾ 𝐴)‘𝑥) |
13 | 12 | eqeq2i 2834 | . . . 4 ⊢ (𝑦 = ((𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))‘𝑥) ↔ 𝑦 = ((𝐹 ↾ 𝐴)‘𝑥)) |
14 | 13 | exbii 1844 | . . 3 ⊢ (∃𝑥 𝑦 = ((𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))‘𝑥) ↔ ∃𝑥 𝑦 = ((𝐹 ↾ 𝐴)‘𝑥)) |
15 | 14 | abbii 2886 | . 2 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = ((𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))‘𝑥)} = {𝑦 ∣ ∃𝑥 𝑦 = ((𝐹 ↾ 𝐴)‘𝑥)} |
16 | fvresex.1 | . . . 4 ⊢ 𝐴 ∈ V | |
17 | 16 | mptex 6980 | . . 3 ⊢ (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) ∈ V |
18 | 17 | fvclex 7654 | . 2 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = ((𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))‘𝑥)} ∈ V |
19 | 15, 18 | eqeltrri 2910 | 1 ⊢ {𝑦 ∣ ∃𝑥 𝑦 = ((𝐹 ↾ 𝐴)‘𝑥)} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∃wex 1776 ∈ wcel 2110 {cab 2799 Vcvv 3495 ⊆ wss 3936 ↦ cmpt 5139 ↾ cres 5552 ‘cfv 6350 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |