| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmcntzr | Structured version Visualization version GIF version | ||
| Description: The "subgroups commute" predicate applied to a subgroup sum. (Contributed by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmcntz.p | ⊢ ⊕ = (LSSum‘𝐺) |
| lsmcntz.s | ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) |
| lsmcntz.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| lsmcntz.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| lsmcntz.z | ⊢ 𝑍 = (Cntz‘𝐺) |
| Ref | Expression |
|---|---|
| lsmcntzr | ⊢ (𝜑 → (𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsmcntz.p | . . 3 ⊢ ⊕ = (LSSum‘𝐺) | |
| 2 | lsmcntz.t | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 3 | lsmcntz.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 4 | lsmcntz.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 5 | lsmcntz.z | . . 3 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 6 | 1, 2, 3, 4, 5 | lsmcntz 19643 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ (𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)))) |
| 7 | subgrcl 19096 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 8 | grpmnd 18905 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 9 | 4, 7, 8 | 3syl 18 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 10 | eqid 2735 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 10 | subgss 19092 | . . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺)) |
| 12 | 2, 11 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝐺)) |
| 13 | 10 | subgss 19092 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 14 | 3, 13 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑈 ⊆ (Base‘𝐺)) |
| 15 | 10, 1 | lsmssv 19607 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 16 | 9, 12, 14, 15 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 17 | 10 | subgss 19092 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 18 | 4, 17 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐺)) |
| 19 | 10, 5 | cntzrec 19300 | . . 3 ⊢ (((𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 20 | 16, 18, 19 | syl2anc 585 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 21 | 10, 5 | cntzrec 19300 | . . . 4 ⊢ ((𝑇 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 22 | 12, 18, 21 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 23 | 10, 5 | cntzrec 19300 | . . . 4 ⊢ ((𝑈 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 24 | 14, 18, 23 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 25 | 22, 24 | anbi12d 633 | . 2 ⊢ (𝜑 → ((𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| 26 | 6, 20, 25 | 3bitr3d 309 | 1 ⊢ (𝜑 → (𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ⊆ wss 3885 ‘cfv 6487 (class class class)co 7356 Basecbs 17168 Mndcmnd 18691 Grpcgrp 18898 SubGrpcsubg 19085 Cntzccntz 19279 LSSumclsm 19598 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-rmo 3340 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-sets 17123 df-slot 17141 df-ndx 17153 df-base 17169 df-ress 17190 df-plusg 17222 df-0g 17393 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-submnd 18741 df-grp 18901 df-minusg 18902 df-subg 19088 df-cntz 19281 df-lsm 19600 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |