Metamath Proof Explorer

Theorem hashge3el3dif

Description: A set with size at least 3 has at least 3 different elements. In contrast to hashge2el2dif , which has an elementary proof, the dominance relation and 1-1 functions from a set with three elements which are known to be different are used to prove this theorem. Although there is also an elementary proof for this theorem, it might be much longer. After all, this proof should be kept because it can be used as template for proofs for higher cardinalities. (Contributed by AV, 20-Mar-2019) (Proof modification is discouraged.)

Ref Expression
Assertion hashge3el3dif ⊢D∈V∧3≤D→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z

Proof

Step Hyp Ref Expression
1 0nep0 ⊢∅≠∅
2 0ex ⊢∅∈V
3 2 sneqr ⊢∅=∅→∅=∅
4 3 necon3i ⊢∅≠∅→∅≠∅
5 1 4 ax-mp ⊢∅≠∅
6 snex ⊢∅∈V
7 snnzg ⊢∅∈V→∅≠∅
8 6 7 ax-mp ⊢∅≠∅
9 1 5 8 3pm3.2i ⊢∅≠∅∧∅≠∅∧∅≠∅
10 snex ⊢∅∈V
11 2 6 10 3pm3.2i ⊢∅∈V∧∅∈V∧∅∈V
12 hashtpg ⊢∅∈V∧∅∈V∧∅∈V→∅≠∅∧∅≠∅∧∅≠∅↔∅∅∅=3
13 11 12 ax-mp ⊢∅≠∅∧∅≠∅∧∅≠∅↔∅∅∅=3
14 9 13 mpbi ⊢∅∅∅=3
15 14 eqcomi ⊢3=∅∅∅
16 15 a1i ⊢D∈V→3=∅∅∅
17 16 breq1d ⊢D∈V→3≤D↔∅∅∅≤D
18 tpfi ⊢∅∅∅∈Fin
19 hashdom ⊢∅∅∅∈Fin∧D∈V→∅∅∅≤D↔∅∅∅≼D
20 18 19 mpan ⊢D∈V→∅∅∅≤D↔∅∅∅≼D
21 17 20 bitrd ⊢D∈V→3≤D↔∅∅∅≼D
22 brdomg ⊢D∈V→∅∅∅≼D↔∃ff:∅∅∅⟶1-1D
23 11 a1i ⊢D∈V∧f:∅∅∅⟶1-1D→∅∈V∧∅∈V∧∅∈V
24 7 necomd ⊢∅∈V→∅≠∅
25 6 24 ax-mp ⊢∅≠∅
26 1 25 5 3pm3.2i ⊢∅≠∅∧∅≠∅∧∅≠∅
27 26 a1i ⊢D∈V∧f:∅∅∅⟶1-1D→∅≠∅∧∅≠∅∧∅≠∅
28 simpr ⊢D∈V∧f:∅∅∅⟶1-1D→f:∅∅∅⟶1-1D
29 23 27 28 f1dom3el3dif ⊢D∈V∧f:∅∅∅⟶1-1D→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z
30 29 expcom ⊢f:∅∅∅⟶1-1D→D∈V→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z
31 30 exlimiv ⊢∃ff:∅∅∅⟶1-1D→D∈V→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z
32 31 com12 ⊢D∈V→∃ff:∅∅∅⟶1-1D→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z
33 22 32 sylbid ⊢D∈V→∅∅∅≼D→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z
34 21 33 sylbid ⊢D∈V→3≤D→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z
35 34 imp ⊢D∈V∧3≤D→∃x∈D∃y∈D∃z∈Dx≠y∧x≠z∧y≠z