lagsubg - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > lagsubg		Structured version Visualization version GIF version

Theorem lagsubg 19118

Description: Lagrange's theorem for Groups: the order of any subgroup of a finite group is a divisor of the order of the group. This is Metamath 100 proof #71. (Contributed by Mario Carneiro, 11-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)

**Hypothesis**
Ref	Expression
lagsubg.1	⊢ 𝑋 = (Base‘𝐺)

**Assertion**
Ref	Expression
lagsubg	⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∥ (♯‘𝑋))

**Proof of Theorem lagsubg**
Step	Hyp	Ref	Expression
1		simpr 484	. . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝑋 ∈ Fin)
2		pwfi 9177	. . . . . . 7 ⊢ (𝑋 ∈ Fin ↔ 𝒫 𝑋 ∈ Fin)
3	1, 2	sylib 217	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝒫 𝑋 ∈ Fin)
4		lagsubg.1	. . . . . . . . 9 ⊢ 𝑋 = (Base‘𝐺)
5		eqid 2726	. . . . . . . . 9 ⊢ (𝐺 ~_QG 𝑌) = (𝐺 ~_QG 𝑌)
6	4, 5	eqger 19102	. . . . . . . 8 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝐺 ~_QG 𝑌) Er 𝑋)
7	6	adantr 480	. . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (𝐺 ~_QG 𝑌) Er 𝑋)
8	7	qsss 8771	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (𝑋 / (𝐺 ~_QG 𝑌)) ⊆ 𝒫 𝑋)
9	3, 8	ssfid 9266	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (𝑋 / (𝐺 ~_QG 𝑌)) ∈ Fin)
10		hashcl 14318	. . . . 5 ⊢ ((𝑋 / (𝐺 ~_QG 𝑌)) ∈ Fin → (♯‘(𝑋 / (𝐺 ~_QG 𝑌))) ∈ ℕ₀)
11	9, 10	syl 17	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘(𝑋 / (𝐺 ~_QG 𝑌))) ∈ ℕ₀)
12	11	nn0zd 12585	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘(𝑋 / (𝐺 ~_QG 𝑌))) ∈ ℤ)
13		id 22	. . . . . 6 ⊢ (𝑋 ∈ Fin → 𝑋 ∈ Fin)
14	4	subgss 19051	. . . . . 6 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → 𝑌 ⊆ 𝑋)
15		ssfi 9172	. . . . . 6 ⊢ ((𝑋 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ Fin)
16	13, 14, 15	syl2anr 596	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝑌 ∈ Fin)
17		hashcl 14318	. . . . 5 ⊢ (𝑌 ∈ Fin → (♯‘𝑌) ∈ ℕ₀)
18	16, 17	syl 17	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∈ ℕ₀)
19	18	nn0zd 12585	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∈ ℤ)
20		dvdsmul2 16226	. . 3 ⊢ (((♯‘(𝑋 / (𝐺 ~_QG 𝑌))) ∈ ℤ ∧ (♯‘𝑌) ∈ ℤ) → (♯‘𝑌) ∥ ((♯‘(𝑋 / (𝐺 ~_QG 𝑌))) · (♯‘𝑌)))
21	12, 19, 20	syl2anc 583	. 2 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∥ ((♯‘(𝑋 / (𝐺 ~_QG 𝑌))) · (♯‘𝑌)))
22		simpl 482	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝑌 ∈ (SubGrp‘𝐺))
23	4, 5, 22, 1	lagsubg2 19117	. 2 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑋) = ((♯‘(𝑋 / (𝐺 ~_QG 𝑌))) · (♯‘𝑌)))
24	21, 23	breqtrrd 5169	1 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∥ (♯‘𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ⊆ wss 3943 𝒫 cpw 4597 class class class wbr 5141 ‘cfv 6536 (class class class)co 7404 Er wer 8699 / cqs 8701 Fincfn 8938 · cmul 11114 ℕ₀cn0 12473 ℤcz 12559 ♯chash 14292 ∥ cdvds 16201 Basecbs 17150 SubGrpcsubg 19044 ~_QG cqg 19046

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-inf2 9635 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-pre-sup 11187

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-disj 5107 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6293 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8264 df-wrecs 8295 df-recs 8369 df-rdg 8408 df-1o 8464 df-er 8702 df-ec 8704 df-qs 8708 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-sup 9436 df-oi 9504 df-card 9933 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11447 df-neg 11448 df-div 11873 df-nn 12214 df-2 12276 df-3 12277 df-n0 12474 df-z 12560 df-uz 12824 df-rp 12978 df-fz 13488 df-fzo 13631 df-seq 13970 df-exp 14030 df-hash 14293 df-cj 15049 df-re 15050 df-im 15051 df-sqrt 15185 df-abs 15186 df-clim 15435 df-sum 15636 df-dvds 16202 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17151 df-ress 17180 df-plusg 17216 df-0g 17393 df-mgm 18570 df-sgrp 18649 df-mnd 18665 df-grp 18863 df-minusg 18864 df-subg 19047 df-eqg 19049

This theorem is referenced by: oddvds2 19483 fislw 19542 sylow3lem4 19547 ablfacrp2 19986 ablfac1c 19990 ablfac1eu 19992 prmgrpsimpgd 20033

W3C validator