Metamath Proof Explorer


Theorem hashnn0n0nn

Description: If a nonnegative integer is the size of a set which contains at least one element, this integer is a positive integer. (Contributed by Alexander van der Vekens, 9-Jan-2018)

Ref Expression
Assertion hashnn0n0nn VWY0V=YNVY

Proof

Step Hyp Ref Expression
1 ne0i NVV
2 hashge1 VWV1V
3 1 2 sylan2 VWNV1V
4 simpr 1VV0V0
5 0lt1 0<1
6 0re 0
7 1re 1
8 6 7 ltnlei 0<1¬10
9 5 8 mpbi ¬10
10 breq2 V=01V10
11 9 10 mtbiri V=0¬1V
12 11 necon2ai 1VV0
13 12 adantr 1VV0V0
14 elnnne0 VV0V0
15 4 13 14 sylanbrc 1VV0V
16 15 ex 1VV0V
17 3 16 syl VWNVV0V
18 17 impancom VWV0NVV
19 18 com12 NVVWV0V
20 eleq1 V=YV0Y0
21 20 anbi2d V=YVWV0VWY0
22 eleq1 V=YVY
23 21 22 imbi12d V=YVWV0VVWY0Y
24 19 23 syl5ib V=YNVVWY0Y
25 24 imp V=YNVVWY0Y
26 25 impcom VWY0V=YNVY