Theorem fvmptrab 47646

Description: Value of a function mapping a set to a class abstraction restricting a class depending on the argument of the function. More general version of fvmptrabfv 6982, but relying on the fact that out-of-domain arguments evaluate to the empty set, which relies on set.mm's particular encoding. (Contributed by AV, 14-Feb-2022.)

Hypotheses

Ref	Expression
fvmptrab.f	⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ 𝑀 ∣ 𝜑})
fvmptrab.r	⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
fvmptrab.s	⊢ (𝑥 = 𝑋 → 𝑀 = 𝑁)
fvmptrab.v	⊢ (𝑋 ∈ 𝑉 → 𝑁 ∈ V)
fvmptrab.n	⊢ (𝑋 ∉ 𝑉 → 𝑁 = ∅)

Assertion

Ref	Expression
fvmptrab	⊢ (𝐹‘𝑋) = {𝑦 ∈ 𝑁 ∣ 𝜓}

Distinct variable groups:   𝑦,𝑀   𝑥,𝑁,𝑦   𝑥,𝑋,𝑦   𝑥,𝑉   𝜓,𝑥

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

Proof of Theorem fvmptrab

Step	Hyp	Ref	Expression
1		fvmptrab.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ 𝑀 ∣ 𝜑})
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ 𝑀 ∣ 𝜑}))
3		fvmptrab.s	. . . . 5 ⊢ (𝑥 = 𝑋 → 𝑀 = 𝑁)
4		fvmptrab.r	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ 𝜓))
5	3, 4	rabeqbidv 3419	. . . 4 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ 𝑀 ∣ 𝜑} = {𝑦 ∈ 𝑁 ∣ 𝜓})
6	5	adantl 481	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑥 = 𝑋) → {𝑦 ∈ 𝑀 ∣ 𝜑} = {𝑦 ∈ 𝑁 ∣ 𝜓})
7		id 22	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ 𝑉)
8		eqid 2737	. . . 4 ⊢ {𝑦 ∈ 𝑁 ∣ 𝜓} = {𝑦 ∈ 𝑁 ∣ 𝜓}
9		fvmptrab.v	. . . 4 ⊢ (𝑋 ∈ 𝑉 → 𝑁 ∈ V)
10	8, 9	rabexd 5287	. . 3 ⊢ (𝑋 ∈ 𝑉 → {𝑦 ∈ 𝑁 ∣ 𝜓} ∈ V)
11	2, 6, 7, 10	fvmptd 6957	. 2 ⊢ (𝑋 ∈ 𝑉 → (𝐹‘𝑋) = {𝑦 ∈ 𝑁 ∣ 𝜓})
12	1	fvmptndm 6981	. . 3 ⊢ (¬ 𝑋 ∈ 𝑉 → (𝐹‘𝑋) = ∅)
13		df-nel 3038	. . . 4 ⊢ (𝑋 ∉ 𝑉 ↔ ¬ 𝑋 ∈ 𝑉)
14		fvmptrab.n	. . . . 5 ⊢ (𝑋 ∉ 𝑉 → 𝑁 = ∅)
15		rabeq 3415	. . . . . 6 ⊢ (𝑁 = ∅ → {𝑦 ∈ 𝑁 ∣ 𝜓} = {𝑦 ∈ ∅ ∣ 𝜓})
16		rab0 4340	. . . . . 6 ⊢ {𝑦 ∈ ∅ ∣ 𝜓} = ∅
17	15, 16	eqtr2di 2789	. . . . 5 ⊢ (𝑁 = ∅ → ∅ = {𝑦 ∈ 𝑁 ∣ 𝜓})
18	14, 17	syl 17	. . . 4 ⊢ (𝑋 ∉ 𝑉 → ∅ = {𝑦 ∈ 𝑁 ∣ 𝜓})
19	13, 18	sylbir 235	. . 3 ⊢ (¬ 𝑋 ∈ 𝑉 → ∅ = {𝑦 ∈ 𝑁 ∣ 𝜓})
20	12, 19	eqtrd 2772	. 2 ⊢ (¬ 𝑋 ∈ 𝑉 → (𝐹‘𝑋) = {𝑦 ∈ 𝑁 ∣ 𝜓})
21	11, 20	pm2.61i 182	1 ⊢ (𝐹‘𝑋) = {𝑦 ∈ 𝑁 ∣ 𝜓}

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114   ∉ wnel 3037  {crab 3401  Vcvv 3442  ∅c0 4287   ↦ cmpt 5181  ‘cfv 6500

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508

This theorem is referenced by: (None)