| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > undefval | Structured version Visualization version GIF version | ||
| Description: Value of the undefined value function. Normally we will not reference the explicit value but will use undefnel 8221 instead. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 24-Dec-2016.) |
| Ref | Expression |
|---|---|
| undefval | ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-undef 8216 | . 2 ⊢ Undef = (𝑠 ∈ V ↦ 𝒫 ∪ 𝑠) | |
| 2 | unieq 4862 | . . 3 ⊢ (𝑠 = 𝑆 → ∪ 𝑠 = ∪ 𝑆) | |
| 3 | 2 | pweqd 4559 | . 2 ⊢ (𝑠 = 𝑆 → 𝒫 ∪ 𝑠 = 𝒫 ∪ 𝑆) |
| 4 | elex 3451 | . 2 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V) | |
| 5 | uniexg 7687 | . . 3 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑆 ∈ V) | |
| 6 | 5 | pwexd 5316 | . 2 ⊢ (𝑆 ∈ 𝑉 → 𝒫 ∪ 𝑆 ∈ V) |
| 7 | 1, 3, 4, 6 | fvmptd3 6965 | 1 ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3430 𝒫 cpw 4542 ∪ cuni 4851 ‘cfv 6492 Undefcund 8215 |
| 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 5231 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| 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-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6448 df-fun 6494 df-fv 6500 df-undef 8216 |
| This theorem is referenced by: undefnel2 8220 undefne0 8222 ndfatafv2undef 47672 |
| Copyright terms: Public domain | W3C validator |