Theorem undefval 8278

Description: Value of the undefined value function. Normally we will not reference the explicit value but will use undefnel 8280 instead. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 24-Dec-2016.)

Assertion

Ref	Expression
undefval	⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆)

Proof of Theorem undefval

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-undef 8274	. 2 ⊢ Undef = (𝑠 ∈ V ↦ 𝒫 ∪ 𝑠)
2		unieq 4878	. . 3 ⊢ (𝑠 = 𝑆 → ∪ 𝑠 = ∪ 𝑆)
3	2	pweqd 4574	. 2 ⊢ (𝑠 = 𝑆 → 𝒫 ∪ 𝑠 = 𝒫 ∪ 𝑆)
4		elex 3472	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
5		uniexg 7746	. . 3 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑆 ∈ V)
6	5	pwexd 5341	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝒫 ∪ 𝑆 ∈ V)
7	1, 3, 4, 6	fvmptd3 7009	1 ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6531  Undefcund 8273

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 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-undef 8274

This theorem is used by:  undefnel2  8279  undefne0  8281  ndfatafv2undef  48226