Metamath Proof Explorer


Theorem hashgt0elex

Description: If the size of a set is greater than zero, then the set must contain at least one element. (Contributed by Alexander van der Vekens, 6-Jan-2018)

Ref Expression
Assertion hashgt0elex VW0<VxxV

Proof

Step Hyp Ref Expression
1 alnex x¬xV¬xxV
2 eq0 V=x¬xV
3 2 biimpri x¬xVV=
4 3 a1d x¬xVVWV=
5 1 4 sylbir ¬xxVVWV=
6 5 impcom VW¬xxVV=
7 hashle00 VWV0V=
8 7 adantr VW¬xxVV0V=
9 6 8 mpbird VW¬xxVV0
10 hashxrcl VWV*
11 0xr 0*
12 xrlenlt V*0*V0¬0<V
13 10 11 12 sylancl VWV0¬0<V
14 13 bicomd VW¬0<VV0
15 14 adantr VW¬xxV¬0<VV0
16 9 15 mpbird VW¬xxV¬0<V
17 16 ex VW¬xxV¬0<V
18 17 con4d VW0<VxxV
19 18 imp VW0<VxxV