Theorem nn0eln0 4712

Description: A natural number is nonempty iff it contains the empty set. Although in constructive mathematics it is generally more natural to work with inhabited sets and ignore the whole concept of nonempty sets, in the specific case of natural numbers this theorem may be helpful in converting proofs which were written assuming excluded middle. (Contributed by Jim Kingdon, 28-Aug-2019.)

Assertion

Ref	Expression
nn0eln0	|- ( A e. om -> ( (/) e. A <-> A =/= (/) ) )

Proof of Theorem nn0eln0

Step	Hyp	Ref	Expression
1		0elnn 4711	. 2 |- ( A e. om -> ( A = (/) \/ (/) e. A ) )
2		noel 3495	. . . . 5 |- -. (/) e. (/)
3		eleq2 2293	. . . . 5 |- ( A = (/) -> ( (/) e. A <-> (/) e. (/) ) )
4	2, 3	mtbiri 679	. . . 4 |- ( A = (/) -> -. (/) e. A )
5		nner 2404	. . . 4 |- ( A = (/) -> -. A =/= (/) )
6	4, 5	2falsed 707	. . 3 |- ( A = (/) -> ( (/) e. A <-> A =/= (/) ) )
7		id 19	. . . 4 |- ( (/) e. A -> (/) e. A )
8		ne0i 3498	. . . 4 |- ( (/) e. A -> A =/= (/) )
9	7, 8	2thd 175	. . 3 |- ( (/) e. A -> ( (/) e. A <-> A =/= (/) ) )
10	6, 9	jaoi 721	. 2 |- ( ( A = (/) \/ (/) e. A ) -> ( (/) e. A <-> A =/= (/) ) )
11	1, 10	syl 14	1 |- ( A e. om -> ( (/) e. A <-> A =/= (/) ) )

Syntax hints:   -> wi 4   <-> wb 105   \/ wo 713   = wceq 1395   e. wcel 2200   =/= wne 2400   (/)c0 3491   omcom 4682

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-uni 3889  df-int 3924  df-suc 4462  df-iom 4683

This theorem is referenced by:  nnmord  6663  bj-charfunr  16173