| 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 6883 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
| 2 | fvmptrabfv.r | . . . 4 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | rabeqbidv 3434 | . . 3 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑} = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
| 4 | fvmptrabfv.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑}) | |
| 5 | fvex 6896 | . . . 4 ⊢ (𝐺‘𝑋) ∈ V | |
| 6 | 5 | rabex 5311 | . . 3 ⊢ {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} ∈ V |
| 7 | 3, 4, 6 | fvmpt 6991 | . 2 ⊢ (𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
| 8 | fvprc 6875 | . . 3 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = ∅) | |
| 9 | fvprc 6875 | . . . . 5 ⊢ (¬ 𝑋 ∈ V → (𝐺‘𝑋) = ∅) | |
| 10 | 9 | rabeqdv 3431 | . . . 4 ⊢ (¬ 𝑋 ∈ V → {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓}) |
| 11 | rab0 4343 | . . . 4 ⊢ {𝑦 ∈ ∅ ∣ 𝜓} = ∅ | |
| 12 | 10, 11 | eqtr2di 2815 | . . 3 ⊢ (¬ 𝑋 ∈ V → ∅ = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
| 13 | 8, 12 | eqtrd 2798 | . 2 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}) |
| 14 | 7, 13 | pm2.61i 184 | 1 ⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2143 {crab 3416 Vcvv 3455 ∅c0 4287 ↦ cmpt 5193 ‘cfv 6538 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6494 df-fun 6540 df-fv 6546 |
| This theorem is referenced by: uvtxval 29718 |
| Copyright terms: Public domain | W3C validator |