isnumbasgrplem3 - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > isnumbasgrplem3		Structured version Visualization version GIF version

Theorem isnumbasgrplem3 43062

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.)

**Assertion**
Ref	Expression
isnumbasgrplem3	⊢ ((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) → 𝑆 ∈ (Base “ Abel))

**Proof of Theorem isnumbasgrplem3**
Step	Hyp	Ref	Expression
1		hashcl 14405	. . . . . 6 ⊢ (𝑆 ∈ Fin → (♯‘𝑆) ∈ ℕ₀)
2	1	adantl 481	. . . . 5 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → (♯‘𝑆) ∈ ℕ₀)
3		eqid 2740	. . . . . 6 ⊢ (ℤ/nℤ‘(♯‘𝑆)) = (ℤ/nℤ‘(♯‘𝑆))
4	3	zncrng 21586	. . . . 5 ⊢ ((♯‘𝑆) ∈ ℕ₀ → (ℤ/nℤ‘(♯‘𝑆)) ∈ CRing)
5		crngring 20272	. . . . 5 ⊢ ((ℤ/nℤ‘(♯‘𝑆)) ∈ CRing → (ℤ/nℤ‘(♯‘𝑆)) ∈ Ring)
6		ringabl 20304	. . . . 5 ⊢ ((ℤ/nℤ‘(♯‘𝑆)) ∈ Ring → (ℤ/nℤ‘(♯‘𝑆)) ∈ Abel)
7	2, 4, 5, 6	4syl 19	. . . 4 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → (ℤ/nℤ‘(♯‘𝑆)) ∈ Abel)
8		hashnncl 14415	. . . . . . . 8 ⊢ (𝑆 ∈ Fin → ((♯‘𝑆) ∈ ℕ ↔ 𝑆 ≠ ∅))
9	8	biimparc 479	. . . . . . 7 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → (♯‘𝑆) ∈ ℕ)
10		eqid 2740	. . . . . . . 8 ⊢ (Base‘(ℤ/nℤ‘(♯‘𝑆))) = (Base‘(ℤ/nℤ‘(♯‘𝑆)))
11	3, 10	znhash 21600	. . . . . . 7 ⊢ ((♯‘𝑆) ∈ ℕ → (♯‘(Base‘(ℤ/nℤ‘(♯‘𝑆)))) = (♯‘𝑆))
12	9, 11	syl 17	. . . . . 6 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → (♯‘(Base‘(ℤ/nℤ‘(♯‘𝑆)))) = (♯‘𝑆))
13	12	eqcomd 2746	. . . . 5 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → (♯‘𝑆) = (♯‘(Base‘(ℤ/nℤ‘(♯‘𝑆)))))
14		simpr 484	. . . . . 6 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → 𝑆 ∈ Fin)
15	3, 10	znfi 21601	. . . . . . 7 ⊢ ((♯‘𝑆) ∈ ℕ → (Base‘(ℤ/nℤ‘(♯‘𝑆))) ∈ Fin)
16	9, 15	syl 17	. . . . . 6 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → (Base‘(ℤ/nℤ‘(♯‘𝑆))) ∈ Fin)
17		hashen 14396	. . . . . 6 ⊢ ((𝑆 ∈ Fin ∧ (Base‘(ℤ/nℤ‘(♯‘𝑆))) ∈ Fin) → ((♯‘𝑆) = (♯‘(Base‘(ℤ/nℤ‘(♯‘𝑆)))) ↔ 𝑆 ≈ (Base‘(ℤ/nℤ‘(♯‘𝑆)))))
18	14, 16, 17	syl2anc 583	. . . . 5 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → ((♯‘𝑆) = (♯‘(Base‘(ℤ/nℤ‘(♯‘𝑆)))) ↔ 𝑆 ≈ (Base‘(ℤ/nℤ‘(♯‘𝑆)))))
19	13, 18	mpbid 232	. . . 4 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → 𝑆 ≈ (Base‘(ℤ/nℤ‘(♯‘𝑆))))
20	10	isnumbasgrplem1 43058	. . . 4 ⊢ (((ℤ/nℤ‘(♯‘𝑆)) ∈ Abel ∧ 𝑆 ≈ (Base‘(ℤ/nℤ‘(♯‘𝑆)))) → 𝑆 ∈ (Base “ Abel))
21	7, 19, 20	syl2anc 583	. . 3 ⊢ ((𝑆 ≠ ∅ ∧ 𝑆 ∈ Fin) → 𝑆 ∈ (Base “ Abel))
22	21	adantll 713	. 2 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ 𝑆 ∈ Fin) → 𝑆 ∈ (Base “ Abel))
23		2nn0 12570	. . . . . . 7 ⊢ 2 ∈ ℕ₀
24		eqid 2740	. . . . . . . 8 ⊢ (ℤ/nℤ‘2) = (ℤ/nℤ‘2)
25	24	zncrng 21586	. . . . . . 7 ⊢ (2 ∈ ℕ₀ → (ℤ/nℤ‘2) ∈ CRing)
26		crngring 20272	. . . . . . 7 ⊢ ((ℤ/nℤ‘2) ∈ CRing → (ℤ/nℤ‘2) ∈ Ring)
27	23, 25, 26	mp2b 10	. . . . . 6 ⊢ (ℤ/nℤ‘2) ∈ Ring
28		eqid 2740	. . . . . . 7 ⊢ ((ℤ/nℤ‘2) freeLMod 𝑆) = ((ℤ/nℤ‘2) freeLMod 𝑆)
29	28	frlmlmod 21792	. . . . . 6 ⊢ (((ℤ/nℤ‘2) ∈ Ring ∧ 𝑆 ∈ dom card) → ((ℤ/nℤ‘2) freeLMod 𝑆) ∈ LMod)
30	27, 29	mpan 689	. . . . 5 ⊢ (𝑆 ∈ dom card → ((ℤ/nℤ‘2) freeLMod 𝑆) ∈ LMod)
31		lmodabl 20929	. . . . 5 ⊢ (((ℤ/nℤ‘2) freeLMod 𝑆) ∈ LMod → ((ℤ/nℤ‘2) freeLMod 𝑆) ∈ Abel)
32	30, 31	syl 17	. . . 4 ⊢ (𝑆 ∈ dom card → ((ℤ/nℤ‘2) freeLMod 𝑆) ∈ Abel)
33	32	ad2antrr 725	. . 3 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → ((ℤ/nℤ‘2) freeLMod 𝑆) ∈ Abel)
34		eqid 2740	. . . . . . 7 ⊢ (Base‘((ℤ/nℤ‘2) freeLMod 𝑆)) = (Base‘((ℤ/nℤ‘2) freeLMod 𝑆))
35	24, 28, 34	frlmpwfi 43055	. . . . . 6 ⊢ (𝑆 ∈ dom card → (Base‘((ℤ/nℤ‘2) freeLMod 𝑆)) ≈ (𝒫 𝑆 ∩ Fin))
36	35	ad2antrr 725	. . . . 5 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → (Base‘((ℤ/nℤ‘2) freeLMod 𝑆)) ≈ (𝒫 𝑆 ∩ Fin))
37		simpll 766	. . . . . 6 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → 𝑆 ∈ dom card)
38		numinfctb 43060	. . . . . . 7 ⊢ ((𝑆 ∈ dom card ∧ ¬ 𝑆 ∈ Fin) → ω ≼ 𝑆)
39	38	adantlr 714	. . . . . 6 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → ω ≼ 𝑆)
40		infpwfien 10131	. . . . . 6 ⊢ ((𝑆 ∈ dom card ∧ ω ≼ 𝑆) → (𝒫 𝑆 ∩ Fin) ≈ 𝑆)
41	37, 39, 40	syl2anc 583	. . . . 5 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → (𝒫 𝑆 ∩ Fin) ≈ 𝑆)
42		entr 9066	. . . . 5 ⊢ (((Base‘((ℤ/nℤ‘2) freeLMod 𝑆)) ≈ (𝒫 𝑆 ∩ Fin) ∧ (𝒫 𝑆 ∩ Fin) ≈ 𝑆) → (Base‘((ℤ/nℤ‘2) freeLMod 𝑆)) ≈ 𝑆)
43	36, 41, 42	syl2anc 583	. . . 4 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → (Base‘((ℤ/nℤ‘2) freeLMod 𝑆)) ≈ 𝑆)
44	43	ensymd 9065	. . 3 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → 𝑆 ≈ (Base‘((ℤ/nℤ‘2) freeLMod 𝑆)))
45	34	isnumbasgrplem1 43058	. . 3 ⊢ ((((ℤ/nℤ‘2) freeLMod 𝑆) ∈ Abel ∧ 𝑆 ≈ (Base‘((ℤ/nℤ‘2) freeLMod 𝑆))) → 𝑆 ∈ (Base “ Abel))
46	33, 44, 45	syl2anc 583	. 2 ⊢ (((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) ∧ ¬ 𝑆 ∈ Fin) → 𝑆 ∈ (Base “ Abel))
47	22, 46	pm2.61dan 812	1 ⊢ ((𝑆 ∈ dom card ∧ 𝑆 ≠ ∅) → 𝑆 ∈ (Base “ Abel))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∩ cin 3975 ∅c0 4352 𝒫 cpw 4622 class class class wbr 5166 dom cdm 5700 “ cima 5703 ‘cfv 6573 (class class class)co 7448 ωcom 7903 ≈ cen 9000 ≼ cdom 9001 Fincfn 9003 cardccrd 10004 ℕcn 12293 2c2 12348 ℕ₀cn0 12553 ♯chash 14379 Basecbs 17258 Abelcabl 19823 Ringcrg 20260 CRingccrg 20261 LModclmod 20880 ℤ/nℤczn 21536 freeLMod cfrlm 21789

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 ax-addf 11263 ax-mulf 11264

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-tpos 8267 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-seqom 8504 df-1o 8522 df-2o 8523 df-oadd 8526 df-er 8763 df-ec 8765 df-qs 8769 df-map 8886 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-sup 9511 df-inf 9512 df-oi 9579 df-dju 9970 df-card 10008 df-acn 10011 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-rp 13058 df-fz 13568 df-fzo 13712 df-fl 13843 df-mod 13921 df-seq 14053 df-hash 14380 df-dvds 16303 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-starv 17326 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-unif 17334 df-hom 17335 df-cco 17336 df-0g 17501 df-prds 17507 df-pws 17509 df-imas 17568 df-qus 17569 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-mhm 18818 df-grp 18976 df-minusg 18977 df-sbg 18978 df-mulg 19108 df-subg 19163 df-nsg 19164 df-eqg 19165 df-ghm 19253 df-gim 19299 df-gic 19300 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-ring 20262 df-cring 20263 df-oppr 20360 df-dvdsr 20383 df-rhm 20498 df-subrng 20572 df-subrg 20597 df-lmod 20882 df-lss 20953 df-lsp 20993 df-sra 21195 df-rgmod 21196 df-lidl 21241 df-rsp 21242 df-2idl 21283 df-cnfld 21388 df-zring 21481 df-zrh 21537 df-zn 21540 df-dsmm 21775 df-frlm 21790

This theorem is referenced by: isnumbasabl 43063 dfacbasgrp 43065

W3C validator