![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lagsubg | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
lagsubg.1 | ⊢ 𝑋 = (Base‘𝐺) |
Ref | Expression |
---|---|
lagsubg | ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∥ (♯‘𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 479 | . . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝑋 ∈ Fin) | |
2 | pwfi 8551 | . . . . . . 7 ⊢ (𝑋 ∈ Fin ↔ 𝒫 𝑋 ∈ Fin) | |
3 | 1, 2 | sylib 210 | . . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝒫 𝑋 ∈ Fin) |
4 | lagsubg.1 | . . . . . . . . 9 ⊢ 𝑋 = (Base‘𝐺) | |
5 | eqid 2778 | . . . . . . . . 9 ⊢ (𝐺 ~QG 𝑌) = (𝐺 ~QG 𝑌) | |
6 | 4, 5 | eqger 18032 | . . . . . . . 8 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝑌) Er 𝑋) |
7 | 6 | adantr 474 | . . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (𝐺 ~QG 𝑌) Er 𝑋) |
8 | 7 | qsss 8093 | . . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (𝑋 / (𝐺 ~QG 𝑌)) ⊆ 𝒫 𝑋) |
9 | 3, 8 | ssfid 8473 | . . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (𝑋 / (𝐺 ~QG 𝑌)) ∈ Fin) |
10 | hashcl 13466 | . . . . 5 ⊢ ((𝑋 / (𝐺 ~QG 𝑌)) ∈ Fin → (♯‘(𝑋 / (𝐺 ~QG 𝑌))) ∈ ℕ0) | |
11 | 9, 10 | syl 17 | . . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘(𝑋 / (𝐺 ~QG 𝑌))) ∈ ℕ0) |
12 | 11 | nn0zd 11836 | . . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘(𝑋 / (𝐺 ~QG 𝑌))) ∈ ℤ) |
13 | id 22 | . . . . . 6 ⊢ (𝑋 ∈ Fin → 𝑋 ∈ Fin) | |
14 | 4 | subgss 17983 | . . . . . 6 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → 𝑌 ⊆ 𝑋) |
15 | ssfi 8470 | . . . . . 6 ⊢ ((𝑋 ∈ Fin ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ Fin) | |
16 | 13, 14, 15 | syl2anr 590 | . . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝑌 ∈ Fin) |
17 | hashcl 13466 | . . . . 5 ⊢ (𝑌 ∈ Fin → (♯‘𝑌) ∈ ℕ0) | |
18 | 16, 17 | syl 17 | . . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∈ ℕ0) |
19 | 18 | nn0zd 11836 | . . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∈ ℤ) |
20 | dvdsmul2 15415 | . . 3 ⊢ (((♯‘(𝑋 / (𝐺 ~QG 𝑌))) ∈ ℤ ∧ (♯‘𝑌) ∈ ℤ) → (♯‘𝑌) ∥ ((♯‘(𝑋 / (𝐺 ~QG 𝑌))) · (♯‘𝑌))) | |
21 | 12, 19, 20 | syl2anc 579 | . 2 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∥ ((♯‘(𝑋 / (𝐺 ~QG 𝑌))) · (♯‘𝑌))) |
22 | simpl 476 | . . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → 𝑌 ∈ (SubGrp‘𝐺)) | |
23 | 4, 5, 22, 1 | lagsubg2 18043 | . 2 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑋) = ((♯‘(𝑋 / (𝐺 ~QG 𝑌))) · (♯‘𝑌))) |
24 | 21, 23 | breqtrrd 4916 | 1 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑌) ∥ (♯‘𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 = wceq 1601 ∈ wcel 2107 ⊆ wss 3792 𝒫 cpw 4379 class class class wbr 4888 ‘cfv 6137 (class class class)co 6924 Er wer 8025 / cqs 8027 Fincfn 8243 · cmul 10279 ℕ0cn0 11646 ℤcz 11732 ♯chash 13439 ∥ cdvds 15391 Basecbs 16259 SubGrpcsubg 17976 ~QG cqg 17978 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 ax-inf2 8837 ax-cnex 10330 ax-resscn 10331 ax-1cn 10332 ax-icn 10333 ax-addcl 10334 ax-addrcl 10335 ax-mulcl 10336 ax-mulrcl 10337 ax-mulcom 10338 ax-addass 10339 ax-mulass 10340 ax-distr 10341 ax-i2m1 10342 ax-1ne0 10343 ax-1rid 10344 ax-rnegex 10345 ax-rrecex 10346 ax-cnre 10347 ax-pre-lttri 10348 ax-pre-lttrn 10349 ax-pre-ltadd 10350 ax-pre-mulgt0 10351 ax-pre-sup 10352 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-fal 1615 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-int 4713 df-iun 4757 df-disj 4857 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-se 5317 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-isom 6146 df-riota 6885 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-om 7346 df-1st 7447 df-2nd 7448 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-1o 7845 df-2o 7846 df-oadd 7849 df-er 8028 df-ec 8030 df-qs 8034 df-map 8144 df-en 8244 df-dom 8245 df-sdom 8246 df-fin 8247 df-sup 8638 df-oi 8706 df-card 9100 df-pnf 10415 df-mnf 10416 df-xr 10417 df-ltxr 10418 df-le 10419 df-sub 10610 df-neg 10611 df-div 11035 df-nn 11379 df-2 11442 df-3 11443 df-n0 11647 df-z 11733 df-uz 11997 df-rp 12142 df-fz 12648 df-fzo 12789 df-seq 13124 df-exp 13183 df-hash 13440 df-cj 14250 df-re 14251 df-im 14252 df-sqrt 14386 df-abs 14387 df-clim 14631 df-sum 14829 df-dvds 15392 df-ndx 16262 df-slot 16263 df-base 16265 df-sets 16266 df-ress 16267 df-plusg 16355 df-0g 16492 df-mgm 17632 df-sgrp 17674 df-mnd 17685 df-grp 17816 df-minusg 17817 df-subg 17979 df-eqg 17981 |
This theorem is referenced by: oddvds2 18371 fislw 18428 sylow3lem4 18433 ablfacrp2 18857 ablfac1c 18861 ablfac1eu 18863 |
Copyright terms: Public domain | W3C validator |