fvmptrabfv - Metamath Proof Explorer

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

Theorem fvmptrabfv 7037

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**
Step	Hyp	Ref	Expression
1		fveq2 6897	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋))
2		fvmptrabfv.r	. . . 4 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
3	1, 2	rabeqbidv 3446	. . 3 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑} = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
4		fvmptrabfv.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ V ↦ {𝑦 ∈ (𝐺‘𝑥) ∣ 𝜑})
5		fvex 6910	. . . 4 ⊢ (𝐺‘𝑋) ∈ V
6	5	rabex 5334	. . 3 ⊢ {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} ∈ V
7	3, 4, 6	fvmpt 7005	. 2 ⊢ (𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
8		fvprc 6889	. . 3 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = ∅)
9		fvprc 6889	. . . . 5 ⊢ (¬ 𝑋 ∈ V → (𝐺‘𝑋) = ∅)
10	9	rabeqdv 3444	. . . 4 ⊢ (¬ 𝑋 ∈ V → {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓})
11		rab0 4383	. . . 4 ⊢ {𝑦 ∈ ∅ ∣ 𝜓} = ∅
12	10, 11	eqtr2di 2785	. . 3 ⊢ (¬ 𝑋 ∈ V → ∅ = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
13	8, 12	eqtrd 2768	. 2 ⊢ (¬ 𝑋 ∈ V → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓})
14	7, 13	pm2.61i 182	1 ⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑋) ∣ 𝜓}

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1534 ∈ wcel 2099 {crab 3429 Vcvv 3471 ∅c0 4323 ↦ cmpt 5231 ‘cfv 6548

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pr 5429

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3430 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-iota 6500 df-fun 6550 df-fv 6556

This theorem is referenced by: uvtxval 29199

W3C validator

	
		OSZAR »