Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fvmptrabfv | Structured version Visualization version GIF version |
Description: Value of a function mapping a set to a class abstraction restricting the value of another function. (Contributed by AV, 18-Feb-2022.) |
Ref | Expression |
---|---|
fvmptrabfv.f | ⊢ 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑}) |
fvmptrabfv.r | ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
fvmptrabfv | ⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6756 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
2 | fvmptrabfv.r | . . . 4 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓)) | |
3 | 1, 2 | rabeqbidv 3410 | . . 3 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑} = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
4 | fvmptrabfv.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑}) | |
5 | fvex 6769 | . . . 4 ⊢ (𝐺‘𝑋) ∈ V | |
6 | 5 | rabex 5251 | . . 3 ⊢ {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} ∈ V |
7 | 3, 4, 6 | fvmpt 6857 | . 2 ⊢ (𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
8 | fvprc 6748 | . . 3 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = ∅) | |
9 | fvprc 6748 | . . . . 5 ⊢ (¬ 𝑋 ∈ V → (𝐺‘𝑋) = ∅) | |
10 | 9 | rabeqdv 3409 | . . . 4 ⊢ (¬ 𝑋 ∈ V → {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓}) |
11 | rab0 4313 | . . . 4 ⊢ {𝑦 ∈ ∅ ∣ 𝜓} = ∅ | |
12 | 10, 11 | eqtr2di 2796 | . . 3 ⊢ (¬ 𝑋 ∈ V → ∅ = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
13 | 8, 12 | eqtrd 2778 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
14 | 7, 13 | pm2.61i 182 | 1 ⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 {crab 3067 Vcvv 3422 ∅c0 4253 ↦ cmpt 5153 ‘cfv 6418 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-iota 6376 df-fun 6420 df-fv 6426 |
This theorem is referenced by: uvtxval 27657 |
Copyright terms: Public domain | W3C validator |