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 6672 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
2 | fvmptrabfv.r | . . . 4 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓)) | |
3 | 1, 2 | rabeqbidv 3487 | . . 3 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑} = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
4 | fvmptrabfv.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑}) | |
5 | fvex 6685 | . . . 4 ⊢ (𝐺‘𝑋) ∈ V | |
6 | 5 | rabex 5237 | . . 3 ⊢ {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} ∈ V |
7 | 3, 4, 6 | fvmpt 6770 | . 2 ⊢ (𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
8 | fvprc 6665 | . . 3 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = ∅) | |
9 | fvprc 6665 | . . . . 5 ⊢ (¬ 𝑋 ∈ V → (𝐺‘𝑋) = ∅) | |
10 | 9 | rabeqdv 3486 | . . . 4 ⊢ (¬ 𝑋 ∈ V → {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓}) |
11 | rab0 4339 | . . . 4 ⊢ {𝑦 ∈ ∅ ∣ 𝜓} = ∅ | |
12 | 10, 11 | syl6req 2875 | . . 3 ⊢ (¬ 𝑋 ∈ V → ∅ = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
13 | 8, 12 | eqtrd 2858 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
14 | 7, 13 | pm2.61i 184 | 1 ⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 {crab 3144 Vcvv 3496 ∅c0 4293 ↦ cmpt 5148 ‘cfv 6357 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-iota 6316 df-fun 6359 df-fv 6365 |
This theorem is referenced by: uvtxval 27171 |
Copyright terms: Public domain | W3C validator |