Theorem undefval 8275

Description: Value of the undefined value function. Normally we will not reference the explicit value but will use undefnel 8277 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 8272	. 2 ⊢ Undef = (𝑠 ∈ V ↦ 𝒫 ∪ 𝑠)
2		unieq 4914	. . 3 ⊢ (𝑠 = 𝑆 → ∪ 𝑠 = ∪ 𝑆)
3	2	pweqd 4615	. 2 ⊢ (𝑠 = 𝑆 → 𝒫 ∪ 𝑠 = 𝒫 ∪ 𝑆)
4		elex 3489	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
5		uniexg 7739	. . 3 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑆 ∈ V)
6	5	pwexd 5373	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝒫 ∪ 𝑆 ∈ V)
7	1, 3, 4, 6	fvmptd3 7022	1 ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆)

Syntax hints:   → wi 4   = wceq 1534   ∈ wcel 2099  Vcvv 3470  𝒫 cpw 4598  ∪ cuni 4903  ‘cfv 6542  Undefcund 8271

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3058  df-rex 3067  df-rab 3429  df-v 3472  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-iota 6494  df-fun 6544  df-fv 6550  df-undef 8272

This theorem is referenced by:  undefnel2  8276  undefne0  8278  ndfatafv2undef  46586

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »