Theorem suppval 8160

Description: The value of the operation constructing the support of a function. (Contributed by AV, 31-Mar-2019.) (Revised by AV, 6-Apr-2019.)

Assertion

Ref	Expression
suppval	⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 supp 𝑍) = {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}})

Distinct variable groups:   𝑖,𝑋   𝑖,𝑍

Allowed substitution hints:   𝑉(𝑖)   𝑊(𝑖)

Proof of Theorem suppval

Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-supp 8159	. . 3 ⊢ supp = (𝑥 ∈ V, 𝑧 ∈ V ↦ {𝑖 ∈ dom 𝑥 ∣ (𝑥 “ {𝑖}) ≠ {𝑧}})
2	1	a1i 11	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → supp = (𝑥 ∈ V, 𝑧 ∈ V ↦ {𝑖 ∈ dom 𝑥 ∣ (𝑥 “ {𝑖}) ≠ {𝑧}}))
3		dmeq 5887	. . . . 5 ⊢ (𝑥 = 𝑋 → dom 𝑥 = dom 𝑋)
4	3	adantr 486	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑧 = 𝑍) → dom 𝑥 = dom 𝑋)
5		imaeq1 6051	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 “ {𝑖}) = (𝑋 “ {𝑖}))
6	5	adantr 486	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑧 = 𝑍) → (𝑥 “ {𝑖}) = (𝑋 “ {𝑖}))
7		sneq 4594	. . . . . 6 ⊢ (𝑧 = 𝑍 → {𝑧} = {𝑍})
8	7	adantl 487	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑧 = 𝑍) → {𝑧} = {𝑍})
9	6, 8	neeq12d 3016	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑧 = 𝑍) → ((𝑥 “ {𝑖}) ≠ {𝑧} ↔ (𝑋 “ {𝑖}) ≠ {𝑍}))
10	4, 9	rabeqbidv 3429	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑧 = 𝑍) → {𝑖 ∈ dom 𝑥 ∣ (𝑥 “ {𝑖}) ≠ {𝑧}} = {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}})
11	10	adantl 487	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) ∧ (𝑥 = 𝑋 ∧ 𝑧 = 𝑍)) → {𝑖 ∈ dom 𝑥 ∣ (𝑥 “ {𝑖}) ≠ {𝑧}} = {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}})
12		elex 3471	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V)
13	12	adantr 486	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → 𝑋 ∈ V)
14		elex 3471	. . 3 ⊢ (𝑍 ∈ 𝑊 → 𝑍 ∈ V)
15	14	adantl 487	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → 𝑍 ∈ V)
16		dmexg 7898	. . . 4 ⊢ (𝑋 ∈ 𝑉 → dom 𝑋 ∈ V)
17	16	adantr 486	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → dom 𝑋 ∈ V)
18		rabexg 5302	. . 3 ⊢ (dom 𝑋 ∈ V → {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}} ∈ V)
19	17, 18	syl 18	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}} ∈ V)
20	2, 11, 13, 15, 19	ovmpod 7565	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑋 supp 𝑍) = {𝑖 ∈ dom 𝑋 ∣ (𝑋 “ {𝑖}) ≠ {𝑍}})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  {crab 3412  Vcvv 3450  {csn 4584  dom cdm 5655   “ cima 5658  (class class class)co 7413   ∈ cmpo 7415   supp csupp 8158

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398  ax-un 7736

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-supp 8159

This theorem is used by:  suppvalbr  8162  supp0  8163  suppval1  8164  suppssdm  8175  suppsnop  8176  ressuppss  8181  ressuppssdif  8183