Metamath Proof Explorer


Theorem hashge2el2dif

Description: A set with size at least 2 has at least 2 different elements. (Contributed by AV, 18-Mar-2019)

Ref Expression
Assertion hashge2el2dif DV2DxDyDxy

Proof

Step Hyp Ref Expression
1 fveq2 D=xD=x
2 hashsng xDx=1
3 1 2 sylan9eqr xDD=xD=1
4 3 ralimiaa xDD=xxDD=1
5 0re 0
6 1re 1
7 5 6 readdcli 0+1
8 7 a1i DFinDV2D0+1
9 2re 2
10 9 a1i DFinDV2D2
11 hashcl DFinD0
12 11 nn0red DFinD
13 12 adantr DFinDV2DD
14 8 10 13 3jca DFinDV2D0+12D
15 0p1e1 0+1=1
16 1lt2 1<2
17 15 16 eqbrtri 0+1<2
18 17 jctl 2D0+1<22D
19 18 adantl DV2D0+1<22D
20 19 adantl DFinDV2D0+1<22D
21 ltleletr 0+12D0+1<22D0+1D
22 14 20 21 sylc DFinDV2D0+1D
23 11 nn0zd DFinD
24 0z 0
25 23 24 jctil DFin0D
26 25 adantr DFinDV2D0D
27 zltp1le 0D0<D0+1D
28 26 27 syl DFinDV2D0<D0+1D
29 22 28 mpbird DFinDV2D0<D
30 0ltpnf 0<+∞
31 simpl DV2DDV
32 31 anim2i ¬DFinDV2D¬DFinDV
33 32 ancomd ¬DFinDV2DDV¬DFin
34 hashinf DV¬DFinD=+∞
35 33 34 syl ¬DFinDV2DD=+∞
36 30 35 breqtrrid ¬DFinDV2D0<D
37 29 36 pm2.61ian DV2D0<D
38 hashgt0n0 DV0<DD
39 37 38 syldan DV2DD
40 rspn0 DxDD=1D=1
41 39 40 syl DV2DxDD=1D=1
42 breq2 D=12D21
43 6 9 ltnlei 1<2¬21
44 pm2.21 ¬2121¬xDD=x
45 43 44 sylbi 1<221¬xDD=x
46 16 45 ax-mp 21¬xDD=x
47 42 46 syl6bi D=12D¬xDD=x
48 47 com12 2DD=1¬xDD=x
49 48 adantl DV2DD=1¬xDD=x
50 41 49 syldc xDD=1DV2D¬xDD=x
51 4 50 syl xDD=xDV2D¬xDD=x
52 ax-1 ¬xDD=xDV2D¬xDD=x
53 51 52 pm2.61i DV2D¬xDD=x
54 eqsn DD=xyDy=x
55 39 54 syl DV2DD=xyDy=x
56 equcom y=xx=y
57 56 a1i DV2Dy=xx=y
58 57 ralbidv DV2DyDy=xyDx=y
59 55 58 bitrd DV2DD=xyDx=y
60 59 ralbidv DV2DxDD=xxDyDx=y
61 53 60 mtbid DV2D¬xDyDx=y
62 df-ne xy¬x=y
63 62 rexbii yDxyyD¬x=y
64 rexnal yD¬x=y¬yDx=y
65 63 64 bitri yDxy¬yDx=y
66 65 rexbii xDyDxyxD¬yDx=y
67 rexnal xD¬yDx=y¬xDyDx=y
68 66 67 bitri xDyDxy¬xDyDx=y
69 61 68 sylibr DV2DxDyDxy