MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fvmptrabfv Structured version   Visualization version   GIF version

Theorem fvmptrabfv 7052
Description: Value of a function mapping a set to a class abstraction restricting the value of another function. (Contributed by AV, 18-Feb-2022.)
Hypotheses
Ref Expression
fvmptrabfv.f 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑})
fvmptrabfv.r (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
fvmptrabfv (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}
Distinct variable groups:   𝑥,𝐺,𝑦   𝑥,𝑋,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem fvmptrabfv
StepHypRef Expression
1 fveq2 6911 . . . 4 (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋))
2 fvmptrabfv.r . . . 4 (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
31, 2rabeqbidv 3433 . . 3 (𝑥 = 𝑋 → {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑} = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
4 fvmptrabfv.f . . 3 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑})
5 fvex 6924 . . . 4 (𝐺‘𝑋) ∈ V
65rabex 5305 . . 3 {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} ∈ V
73, 4, 6fvmpt 7019 . 2 (𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
8 fvprc 6903 . . 3 (¬ 𝑋 ∈ V → (𝐹‘𝑋) = ∅)
9 fvprc 6903 . . . . 5 (¬ 𝑋 ∈ V → (𝐺‘𝑋) = ∅)
109rabeqdv 3431 . . . 4 (¬ 𝑋 ∈ V → {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓})
11 rab0 4338 . . . 4 {𝑦 ∈ ∅ ∣ 𝜓} = ∅
1210, 11eqtr2di 2815 . . 3 (¬ 𝑋 ∈ V → ∅ = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
138, 12eqtrd 2798 . 2 (¬ 𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
147, 13pm2.61i 184 1 (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  ∅c0 4281   ↦ cmpt 5190  ‘cfv 6561
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569
This theorem is used by:  uvtxval  30001
  Copyright terms: Public domain W3C validator