Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > undefne0 | Structured version Visualization version GIF version |
Description: The undefined value generated from a set is not empty. (Contributed by NM, 3-Sep-2018.) |
Ref | Expression |
---|---|
undefne0 | ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | undefval 7402 | . 2 ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) = 𝒫 ∪ 𝑆) | |
2 | pwne0 4835 | . . 3 ⊢ 𝒫 ∪ 𝑆 ≠ ∅ | |
3 | 2 | a1i 11 | . 2 ⊢ (𝑆 ∈ 𝑉 → 𝒫 ∪ 𝑆 ≠ ∅) |
4 | 1, 3 | eqnetrd 2861 | 1 ⊢ (𝑆 ∈ 𝑉 → (Undef‘𝑆) ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 1990 ≠ wne 2794 ∅c0 3915 𝒫 cpw 4158 ∪ cuni 4436 ‘cfv 5888 Undefcund 7398 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fv 5896 df-undef 7399 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |