Theorem fvmptrabdm 45987

Description: Value of a function mapping a set to a class abstraction restricting the value of another function. See also fvmptrabfv 7026. (Suggested by BJ, 18-Feb-2022.) (Contributed by AV, 18-Feb-2022.)

Hypotheses

Ref	Expression
fvmptrabdm.f	⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑})
fvmptrabdm.r	⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
fvmptrabdm.v	⊢ (𝑌 ∈ dom 𝐺 → 𝑋 ∈ dom 𝐹)

Assertion

Ref	Expression
fvmptrabdm	⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓}

Distinct variable groups:   𝑥,𝐹   𝑥,𝐺,𝑦   𝑥,𝑉   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑦)   𝐹(𝑦)   𝑉(𝑦)

Proof of Theorem fvmptrabdm

Step	Hyp	Ref	Expression
1		fvmptrabdm.v	. 2 ⊢ (𝑌 ∈ dom 𝐺 → 𝑋 ∈ dom 𝐹)
2		pm2.1 895	. 2 ⊢ (¬ 𝑋 ∈ dom 𝐹 ∨ 𝑋 ∈ dom 𝐹)
3		imor 851	. . 3 ⊢ ((𝑌 ∈ dom 𝐺 → 𝑋 ∈ dom 𝐹) ↔ (¬ 𝑌 ∈ dom 𝐺 ∨ 𝑋 ∈ dom 𝐹))
4		ordir 1005	. . . . 5 ⊢ (((¬ 𝑋 ∈ dom 𝐹 ∧ ¬ 𝑌 ∈ dom 𝐺) ∨ 𝑋 ∈ dom 𝐹) ↔ ((¬ 𝑋 ∈ dom 𝐹 ∨ 𝑋 ∈ dom 𝐹) ∧ (¬ 𝑌 ∈ dom 𝐺 ∨ 𝑋 ∈ dom 𝐹)))
5		ndmfv 6923	. . . . . . 7 ⊢ (¬ 𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = ∅)
6		ndmfv 6923	. . . . . . . . 9 ⊢ (¬ 𝑌 ∈ dom 𝐺 → (𝐺‘𝑌) = ∅)
7	6	rabeqdv 3447	. . . . . . . 8 ⊢ (¬ 𝑌 ∈ dom 𝐺 → {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓})
8		rab0 4381	. . . . . . . 8 ⊢ {𝑦 ∈ ∅ ∣ 𝜓} = ∅
9	7, 8	eqtr2di 2789	. . . . . . 7 ⊢ (¬ 𝑌 ∈ dom 𝐺 → ∅ = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓})
10	5, 9	sylan9eq 2792	. . . . . 6 ⊢ ((¬ 𝑋 ∈ dom 𝐹 ∧ ¬ 𝑌 ∈ dom 𝐺) → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓})
11		fvmptrabdm.f	. . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑})
12		fvmptrabdm.r	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
13	12	rabbidv 3440	. . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓})
14	11	dmmpt 6236	. . . . . . . . . 10 ⊢ dom 𝐹 = {𝑥 ∈ 𝑉 ∣ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} ∈ V}
15		rabid2 3464	. . . . . . . . . . 11 ⊢ (𝑉 = {𝑥 ∈ 𝑉 ∣ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} ∈ V} ↔ ∀𝑥 ∈ 𝑉 {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} ∈ V)
16		fvex 6901	. . . . . . . . . . . . 13 ⊢ (𝐺‘𝑌) ∈ V
17	16	rabex 5331	. . . . . . . . . . . 12 ⊢ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} ∈ V
18	17	a1i 11	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑉 → {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} ∈ V)
19	15, 18	mprgbir 3068	. . . . . . . . . 10 ⊢ 𝑉 = {𝑥 ∈ 𝑉 ∣ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜑} ∈ V}
20	14, 19	eqtr4i 2763	. . . . . . . . 9 ⊢ dom 𝐹 = 𝑉
21	20	eleq2i 2825	. . . . . . . 8 ⊢ (𝑋 ∈ dom 𝐹 ↔ 𝑋 ∈ 𝑉)
22	21	biimpi 215	. . . . . . 7 ⊢ (𝑋 ∈ dom 𝐹 → 𝑋 ∈ 𝑉)
23	16	rabex 5331	. . . . . . . 8 ⊢ {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓} ∈ V
24	23	a1i 11	. . . . . . 7 ⊢ (𝑋 ∈ dom 𝐹 → {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓} ∈ V)
25	11, 13, 22, 24	fvmptd3 7018	. . . . . 6 ⊢ (𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓})
26	10, 25	jaoi 855	. . . . 5 ⊢ (((¬ 𝑋 ∈ dom 𝐹 ∧ ¬ 𝑌 ∈ dom 𝐺) ∨ 𝑋 ∈ dom 𝐹) → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓})
27	4, 26	sylbir 234	. . . 4 ⊢ (((¬ 𝑋 ∈ dom 𝐹 ∨ 𝑋 ∈ dom 𝐹) ∧ (¬ 𝑌 ∈ dom 𝐺 ∨ 𝑋 ∈ dom 𝐹)) → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓})
28	27	expcom 414	. . 3 ⊢ ((¬ 𝑌 ∈ dom 𝐺 ∨ 𝑋 ∈ dom 𝐹) → ((¬ 𝑋 ∈ dom 𝐹 ∨ 𝑋 ∈ dom 𝐹) → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓}))
29	3, 28	sylbi 216	. 2 ⊢ ((𝑌 ∈ dom 𝐺 → 𝑋 ∈ dom 𝐹) → ((¬ 𝑋 ∈ dom 𝐹 ∨ 𝑋 ∈ dom 𝐹) → (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓}))
30	1, 2, 29	mp2 9	1 ⊢ (𝐹‘𝑋) = {𝑦 ∈ (𝐺‘𝑌) ∣ 𝜓}

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  {crab 3432  Vcvv 3474  ∅c0 4321   ↦ cmpt 5230  dom cdm 5675  ‘cfv 6540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fv 6548

This theorem is referenced by: (None)