Theorem undefval 8298

Description: Value of the undefined value function. Normally we will not reference the explicit value but will use undefnel 8300 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 8294	. 2 ⊢ Undef = (𝑠 ∈ V ↦ 𝒫 ∪ 𝑠)
2		unieq 4877	. . 3 ⊢ (𝑠 = 𝑆 → ∪ 𝑠 = ∪ 𝑆)
3	2	pweqd 4573	. 2 ⊢ (𝑠 = 𝑆 → 𝒫 ∪ 𝑠 = 𝒫 ∪ 𝑆)
4		elex 3471	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
5		uniexg 7758	. . 3 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑆 ∈ V)
6	5	pwexd 5340	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝒫 ∪ 𝑆 ∈ V)
7	1, 3, 4, 6	fvmptd3 7018	1 ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450  𝒫 cpw 4556  ∪ cuni 4866  ‘cfv 6539  Undefcund 8293

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-undef 8294

This theorem is used by:  undefnel2  8299  undefne0  8301  ndfatafv2undef  48376