Metamath Proof Explorer


Theorem isnumbasgrplem3

Description: Every nonempty numerable set can be given the structure of an Abelian group, either a finite cyclic group or a vector space over Z/2Z. (Contributed by Stefan O'Rear, 10-Jul-2015)

Ref Expression
Assertion isnumbasgrplem3 ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ → S ∈ Base Abel

Proof

Step Hyp Ref Expression
1 hashcl ⊢ S ∈ Fin → S ∈ ℕ 0
2 1 adantl ⊢ S ≠ ∅ ∧ S ∈ Fin → S ∈ ℕ 0
3 eqid ⊢ ℤ/Sℤ = ℤ/Sℤ
4 3 zncrng ⊢ S ∈ ℕ 0 → ℤ/Sℤ ∈ CRing
5 crngring ⊢ ℤ/Sℤ ∈ CRing → ℤ/Sℤ ∈ Ring
6 ringabl ⊢ ℤ/Sℤ ∈ Ring → ℤ/Sℤ ∈ Abel
7 2 4 5 6 4syl ⊢ S ≠ ∅ ∧ S ∈ Fin → ℤ/Sℤ ∈ Abel
8 hashnncl ⊢ S ∈ Fin → S ∈ ℕ ↔ S ≠ ∅
9 8 biimparc ⊢ S ≠ ∅ ∧ S ∈ Fin → S ∈ ℕ
10 eqid ⊢ Base ℤ/Sℤ = Base ℤ/Sℤ
11 3 10 znhash ⊢ S ∈ ℕ → Base ℤ/Sℤ = S
12 9 11 syl ⊢ S ≠ ∅ ∧ S ∈ Fin → Base ℤ/Sℤ = S
13 12 eqcomd ⊢ S ≠ ∅ ∧ S ∈ Fin → S = Base ℤ/Sℤ
14 simpr ⊢ S ≠ ∅ ∧ S ∈ Fin → S ∈ Fin
15 3 10 znfi ⊢ S ∈ ℕ → Base ℤ/Sℤ ∈ Fin
16 9 15 syl ⊢ S ≠ ∅ ∧ S ∈ Fin → Base ℤ/Sℤ ∈ Fin
17 hashen ⊢ S ∈ Fin ∧ Base ℤ/Sℤ ∈ Fin → S = Base ℤ/Sℤ ↔ S ≈ Base ℤ/Sℤ
18 14 16 17 syl2anc ⊢ S ≠ ∅ ∧ S ∈ Fin → S = Base ℤ/Sℤ ↔ S ≈ Base ℤ/Sℤ
19 13 18 mpbid ⊢ S ≠ ∅ ∧ S ∈ Fin → S ≈ Base ℤ/Sℤ
20 10 isnumbasgrplem1 ⊢ ℤ/Sℤ ∈ Abel ∧ S ≈ Base ℤ/Sℤ → S ∈ Base Abel
21 7 19 20 syl2anc ⊢ S ≠ ∅ ∧ S ∈ Fin → S ∈ Base Abel
22 21 adantll ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ S ∈ Fin → S ∈ Base Abel
23 2nn0 ⊢ 2 ∈ ℕ 0
24 eqid ⊢ ℤ/ 2 ℤ = ℤ/ 2 ℤ
25 24 zncrng ⊢ 2 ∈ ℕ 0 → ℤ/ 2 ℤ ∈ CRing
26 crngring ⊢ ℤ/ 2 ℤ ∈ CRing → ℤ/ 2 ℤ ∈ Ring
27 23 25 26 mp2b ⊢ ℤ/ 2 ℤ ∈ Ring
28 eqid ⊢ ℤ/ 2 ℤ freeLMod S = ℤ/ 2 ℤ freeLMod S
29 28 frlmlmod ⊢ ℤ/ 2 ℤ ∈ Ring ∧ S ∈ dom ⁡ card → ℤ/ 2 ℤ freeLMod S ∈ LMod
30 27 29 mpan ⊢ S ∈ dom ⁡ card → ℤ/ 2 ℤ freeLMod S ∈ LMod
31 lmodabl ⊢ ℤ/ 2 ℤ freeLMod S ∈ LMod → ℤ/ 2 ℤ freeLMod S ∈ Abel
32 30 31 syl ⊢ S ∈ dom ⁡ card → ℤ/ 2 ℤ freeLMod S ∈ Abel
33 32 ad2antrr ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → ℤ/ 2 ℤ freeLMod S ∈ Abel
34 eqid ⊢ Base ℤ/ 2 ℤ freeLMod S = Base ℤ/ 2 ℤ freeLMod S
35 24 28 34 frlmpwfi ⊢ S ∈ dom ⁡ card → Base ℤ/ 2 ℤ freeLMod S ≈ 𝒫 S ∩ Fin
36 35 ad2antrr ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → Base ℤ/ 2 ℤ freeLMod S ≈ 𝒫 S ∩ Fin
37 simpll ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → S ∈ dom ⁡ card
38 numinfctb ⊢ S ∈ dom ⁡ card ∧ ¬ S ∈ Fin → ω ≼ S
39 38 adantlr ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → ω ≼ S
40 infpwfien ⊢ S ∈ dom ⁡ card ∧ ω ≼ S → 𝒫 S ∩ Fin ≈ S
41 37 39 40 syl2anc ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → 𝒫 S ∩ Fin ≈ S
42 entr ⊢ Base ℤ/ 2 ℤ freeLMod S ≈ 𝒫 S ∩ Fin ∧ 𝒫 S ∩ Fin ≈ S → Base ℤ/ 2 ℤ freeLMod S ≈ S
43 36 41 42 syl2anc ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → Base ℤ/ 2 ℤ freeLMod S ≈ S
44 43 ensymd ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → S ≈ Base ℤ/ 2 ℤ freeLMod S
45 34 isnumbasgrplem1 ⊢ ℤ/ 2 ℤ freeLMod S ∈ Abel ∧ S ≈ Base ℤ/ 2 ℤ freeLMod S → S ∈ Base Abel
46 33 44 45 syl2anc ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ ∧ ¬ S ∈ Fin → S ∈ Base Abel
47 22 46 pm2.61dan ⊢ S ∈ dom ⁡ card ∧ S ≠ ∅ → S ∈ Base Abel