| 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 19854 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ (𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)))) |
| 7 | subgrcl 19302 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 8 | grpmnd 19112 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 9 | 4, 7, 8 | 3syl 19 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 10 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 10 | subgss 19298 | . . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺)) |
| 12 | 2, 11 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝐺)) |
| 13 | 10 | subgss 19298 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 14 | 3, 13 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑈 ⊆ (Base‘𝐺)) |
| 15 | 10, 1 | lsmssv 19818 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 16 | 9, 12, 14, 15 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 17 | 10 | subgss 19298 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 18 | 4, 17 | syl 18 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐺)) |
| 19 | 10, 5 | cntzrec 19511 | . . 3 ⊢ (((𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 20 | 16, 18, 19 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 21 | 10, 5 | cntzrec 19511 | . . . 4 ⊢ ((𝑇 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 22 | 12, 18, 21 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 23 | 10, 5 | cntzrec 19511 | . . . 4 ⊢ ((𝑈 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 24 | 14, 18, 23 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 25 | 22, 24 | anbi12d 644 | . 2 ⊢ (𝜑 → ((𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| 26 | 6, 20, 25 | 3bitr3d 312 | 1 ⊢ (𝜑 → (𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3898 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 Mndcmnd 18884 Grpcgrp 19105 SubGrpcsubg 19291 Cntzccntz 19490 LSSumclsm 19809 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-nn 12305 df-2 12374 df-sets 17303 df-slot 17321 df-ndx 17333 df-base 17349 df-ress 17370 df-plusg 17402 df-0g 17573 df-mgm 18777 df-sgrp 18869 df-mnd 18885 df-submnd 18940 df-grp 19108 df-minusg 19109 df-subg 19294 df-cntz 19492 df-lsm 19811 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |