Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prnz | Structured version Visualization version GIF version |
Description: A pair containing a set is not empty. (Contributed by NM, 9-Apr-1994.) |
Ref | Expression |
---|---|
prnz.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
prnz | ⊢ {𝐴, 𝐵} ≠ ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prnz.1 | . . 3 ⊢ 𝐴 ∈ V | |
2 | 1 | prid1 4700 | . 2 ⊢ 𝐴 ∈ {𝐴, 𝐵} |
3 | 2 | ne0ii 4305 | 1 ⊢ {𝐴, 𝐵} ≠ ∅ |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2114 ≠ wne 3018 Vcvv 3496 ∅c0 4293 {cpr 4571 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-v 3498 df-dif 3941 df-un 3943 df-nul 4294 df-sn 4570 df-pr 4572 |
This theorem is referenced by: opnz 5367 propssopi 5400 fiint 8797 wilthlem2 25648 upgrbi 26880 wlkvtxiedg 27408 shincli 29141 chincli 29239 spr0nelg 43645 sprvalpwn0 43652 |
Copyright terms: Public domain | W3C validator |