| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nsgqusf1o | Structured version Visualization version GIF version | ||
| Description: The canonical projection homomorphism 𝐸 defines a bijective correspondence between the set 𝑆 of subgroups of 𝐺 containing a normal subgroup 𝑁 and the subgroups of the quotient group 𝐺 / 𝑁. This theorem is sometimes called the correspondence theorem, or the fourth isomorphism theorem. (Contributed by Thierry Arnoux, 4-Aug-2024.) |
| Ref | Expression |
|---|---|
| nsgqusf1o.b | ⊢ 𝐵 = (Base‘𝐺) |
| nsgqusf1o.s | ⊢ 𝑆 = {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ} |
| nsgqusf1o.t | ⊢ 𝑇 = (SubGrp‘𝑄) |
| nsgqusf1o.1 | ⊢ ≤ = (le‘(toInc‘𝑆)) |
| nsgqusf1o.2 | ⊢ ≲ = (le‘(toInc‘𝑇)) |
| nsgqusf1o.q | ⊢ 𝑄 = (𝐺 /s (𝐺 ~QG 𝑁)) |
| nsgqusf1o.p | ⊢ ⊕ = (LSSum‘𝐺) |
| nsgqusf1o.e | ⊢ 𝐸 = (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) |
| nsgqusf1o.f | ⊢ 𝐹 = (𝑓 ∈ 𝑇 ↦ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) |
| nsgqusf1o.n | ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺)) |
| Ref | Expression |
|---|---|
| nsgqusf1o | ⊢ (𝜑 → 𝐸:𝑆⟶1-1onto𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ ((toInc‘𝑆)MGalConn(toInc‘𝑇)) = ((toInc‘𝑆)MGalConn(toInc‘𝑇)) | |
| 2 | nsgqusf1o.s | . . . . . 6 ⊢ 𝑆 = {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ} | |
| 3 | fvex 6929 | . . . . . 6 ⊢ (SubGrp‘𝐺) ∈ V | |
| 4 | 2, 3 | rabex2 5309 | . . . . 5 ⊢ 𝑆 ∈ V |
| 5 | eqid 2763 | . . . . . 6 ⊢ (toInc‘𝑆) = (toInc‘𝑆) | |
| 6 | 5 | ipobas 18755 | . . . . 5 ⊢ (𝑆 ∈ V → 𝑆 = (Base‘(toInc‘𝑆))) |
| 7 | 4, 6 | ax-mp 5 | . . . 4 ⊢ 𝑆 = (Base‘(toInc‘𝑆)) |
| 8 | nsgqusf1o.t | . . . . . 6 ⊢ 𝑇 = (SubGrp‘𝑄) | |
| 9 | 8 | fvexi 6930 | . . . . 5 ⊢ 𝑇 ∈ V |
| 10 | eqid 2763 | . . . . . 6 ⊢ (toInc‘𝑇) = (toInc‘𝑇) | |
| 11 | 10 | ipobas 18755 | . . . . 5 ⊢ (𝑇 ∈ V → 𝑇 = (Base‘(toInc‘𝑇))) |
| 12 | 9, 11 | ax-mp 5 | . . . 4 ⊢ 𝑇 = (Base‘(toInc‘𝑇)) |
| 13 | nsgqusf1o.1 | . . . 4 ⊢ ≤ = (le‘(toInc‘𝑆)) | |
| 14 | nsgqusf1o.2 | . . . 4 ⊢ ≲ = (le‘(toInc‘𝑇)) | |
| 15 | 5 | ipopos 18760 | . . . . 5 ⊢ (toInc‘𝑆) ∈ Poset |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝜑 → (toInc‘𝑆) ∈ Poset) |
| 17 | 10 | ipopos 18760 | . . . . 5 ⊢ (toInc‘𝑇) ∈ Poset |
| 18 | 17 | a1i 11 | . . . 4 ⊢ (𝜑 → (toInc‘𝑇) ∈ Poset) |
| 19 | nsgqusf1o.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 20 | nsgqusf1o.q | . . . . 5 ⊢ 𝑄 = (𝐺 /s (𝐺 ~QG 𝑁)) | |
| 21 | nsgqusf1o.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 22 | nsgqusf1o.e | . . . . 5 ⊢ 𝐸 = (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) | |
| 23 | nsgqusf1o.f | . . . . 5 ⊢ 𝐹 = (𝑓 ∈ 𝑇 ↦ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) | |
| 24 | nsgqusf1o.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺)) | |
| 25 | 19, 2, 8, 1, 5, 10, 20, 21, 22, 23, 24 | nsgmgc 34067 | . . . 4 ⊢ (𝜑 → 𝐸((toInc‘𝑆)MGalConn(toInc‘𝑇))𝐹) |
| 26 | 1, 7, 12, 13, 14, 16, 18, 25 | mgcf1o 33663 | . . 3 ⊢ (𝜑 → (𝐸 ↾ ran 𝐹) Isom ≤ , ≲ (ran 𝐹, ran 𝐸)) |
| 27 | isof1o 7362 | . . 3 ⊢ ((𝐸 ↾ ran 𝐹) Isom ≤ , ≲ (ran 𝐹, ran 𝐸) → (𝐸 ↾ ran 𝐹):ran 𝐹⟶1-1ontoran 𝐸) | |
| 28 | 26, 27 | syl 18 | . 2 ⊢ (𝜑 → (𝐸 ↾ ran 𝐹):ran 𝐹⟶1-1ontoran 𝐸) |
| 29 | 19, 2, 8, 13, 14, 20, 21, 22, 23, 24 | nsgqusf1olem3 34070 | . . . . 5 ⊢ (𝜑 → ran 𝐹 = 𝑆) |
| 30 | 29 | reseq2d 5986 | . . . 4 ⊢ (𝜑 → (𝐸 ↾ ran 𝐹) = (𝐸 ↾ 𝑆)) |
| 31 | nfv 1949 | . . . . . 6 ⊢ Ⅎℎ𝜑 | |
| 32 | vex 3458 | . . . . . . . . 9 ⊢ ℎ ∈ V | |
| 33 | 32 | mptex 7260 | . . . . . . . 8 ⊢ (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V |
| 34 | 33 | rnex 7956 | . . . . . . 7 ⊢ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V |
| 35 | 34 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V) |
| 36 | 31, 35, 22 | fnmptd 6710 | . . . . 5 ⊢ (𝜑 → 𝐸 Fn 𝑆) |
| 37 | fnresdm 6688 | . . . . 5 ⊢ (𝐸 Fn 𝑆 → (𝐸 ↾ 𝑆) = 𝐸) | |
| 38 | 36, 37 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐸 ↾ 𝑆) = 𝐸) |
| 39 | 30, 38 | eqtrd 2798 | . . 3 ⊢ (𝜑 → (𝐸 ↾ ran 𝐹) = 𝐸) |
| 40 | 19, 2, 8, 13, 14, 20, 21, 22, 23, 24 | nsgqusf1olem2 34069 | . . 3 ⊢ (𝜑 → ran 𝐸 = 𝑇) |
| 41 | 39, 29, 40 | f1oeq123d 6848 | . 2 ⊢ (𝜑 → ((𝐸 ↾ ran 𝐹):ran 𝐹⟶1-1ontoran 𝐸 ↔ 𝐸:𝑆⟶1-1onto𝑇)) |
| 42 | 28, 41 | mpbid 235 | 1 ⊢ (𝜑 → 𝐸:𝑆⟶1-1onto𝑇) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {crab 3416 Vcvv 3454 ⊆ wss 3900 {csn 4588 ↦ cmpt 5192 ran crn 5659 ↾ cres 5660 Fn wfn 6561 ⟶1-1ontowf1o 6565 ‘cfv 6566 Isom wiso 6567 (class class class)co 7451 Basecbs 17431 lecple 17479 /s cqus 17727 Posetcpo 18531 toInccipo 18751 SubGrpcsubg 19380 NrmSGrpcnsg 19381 ~QG cqg 19382 LSSumclsm 19899 MGalConncmgc 33639 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-tpos 8281 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-ec 8757 df-qs 8761 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-fz 13680 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-sca 17489 df-vsca 17490 df-ip 17491 df-tset 17492 df-ple 17493 df-ocomp 17494 df-ds 17495 df-0g 17662 df-imas 17730 df-qus 17731 df-proset 18518 df-poset 18537 df-ipo 18752 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-submnd 19029 df-grp 19197 df-minusg 19198 df-subg 19383 df-nsg 19384 df-eqg 19385 df-ghm 19478 df-oppg 19611 df-lsm 19901 df-mnt 33640 df-mgc 33641 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |